Title
An exact algorithm for the Partition Coloring Problem.
Abstract
•A generalization of the Vertex Coloring Problem where the vertex set is partitioned.•A vertex for each subset of the partition has to be colored.•A new Integer Linear Programming formulation with an exponential number of variables.•A Branch-and-Price algorithm initialized via a metaheuristic algorithm.•Computational experiments.
Year
DOI
Venue
2018
10.1016/j.cor.2017.12.019
Computers & Operations Research
Keywords
Field
DocType
Vertex Coloring,Partitioning coloring,Selective coloring,Column generation,Branch-and-Price algorithm
Graph,Discrete mathematics,Mathematical optimization,Exponential function,Chromatic scale,Vertex (geometry),Exact algorithm,Partition (number theory),Mathematics,Metaheuristic,Coloring problem
Journal
Volume
ISSN
Citations 
92
0305-0548
3
PageRank 
References 
Authors
0.39
18
3
Name
Order
Citations
PageRank
Fabio Furini110416.85
Enrico Malaguti231221.69
Alberto Santini373.18