A DSATUR-based algorithm for the Equitable Coloring Problem
Year of publication: |
2015
|
---|---|
Authors: | Méndez-Díaz, Isabel ; Nasini, Graciela ; Severín, Daniel |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 57.2015, p. 41-50
|
Subject: | Equitable coloring | DSatur | Exact algorithm | Algorithmus | Algorithm | Theorie | Theory | Mathematische Optimierung | Mathematical programming |
-
Critical edges for the assignment problem : complexity and exact resolution
Bazgan, Cristina, (2013)
-
An exact algorithm for the unrestricted block relocation problem
Tanaka, Shunji, (2018)
-
A new exact approach for the 0-1 Collapsing Knapsack Problem
Della Croce, Federico, (2017)
- More ...
-
Solving the List Coloring Problem through a branch-and-price algorithm
Lucci, Mauro, (2024)
-
A metaheuristic for crew scheduling in a pickup‐and‐delivery problem with time windows
Lucci, Mauro, (2021)
-
A metaheuristic for crew scheduling in a pickup-and-delivery problem with time windows
Lucci, Mauro, (2023)
- More ...