An exact algorithm for the Partition Coloring Problem
Year of publication: |
April 2018
|
---|---|
Authors: | Furini, Fabio ; Malaguti, Enrico ; Santini, Alberto |
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. 92.2018, p. 170-181
|
Subject: | Vertex Coloring | Partitioning coloring | Selective coloring | Column generation | Branch-and-Price algorithm | Graphentheorie | Graph theory | Ganzzahlige Optimierung | Integer programming | Schwarze Menschen | Black people | USA | United States | Theorie | Theory |
-
Exact approaches for the orderly colored longest path problem : performance comparison
Carrabs, Francesco, (2019)
-
A wide branching strategy for the graph coloring problem
Morrison, David Robert, (2014)
-
Solving the maximum clique and vertex coloring problems on very large sparse networks
Verma, Anurag, (2015)
- More ...
-
A note on selective line-graphs and partition colorings
Cornaz, Denis, (2019)
-
The traveling salesman problem with pickups, deliveries, and draft limits
Malaguti, Enrico, (2018)
-
The min-Knapsack problem with compactness constraints and applications in statistics
Santini, Alberto, (2024)
- More ...