Finite-Domain Cuts for Graph Coloring

Abstract

We explore the idea of obtaining valid inequalities from a finite-domain formulation of a problem, rather than a 0-1 formulation. A finite-domain model represents discrete choices with variables that have several possible values, as is frequently done in constraint programming. We apply the idea to graph coloring and identify facet-defining cuts that, when… (More)

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Bergman2012FiniteDomainCF, title={Finite-Domain Cuts for Graph Coloring}, author={David Bergman and John N. Hooker}, year={2012} }