An Exact Algorithm for the Partition Coloring Problem

Abstract

We study the Partition Coloring Problem (PCP), a generalization of the Vertex Coloring Problem where the vertex set is partitioned. The PCP asks to select one vertex for each subset of the partition in such a way that the chromatic number of the induced graph is minimum. We propose a new Integer Linear Programming formulation with an exponential number of… (More)

Topics

7 Figures and Tables

Cite this paper

@inproceedings{Furini2017AnEA, title={An Exact Algorithm for the Partition Coloring Problem}, author={Fabio Furini and Enrico Malaguti and Alberto Santini}, year={2017} }