Title of article
A Polyhedral Approach for Graph Coloring1
Author/Authors
Méndez Dيaz -، نويسنده , , Isabel and Zabala، نويسنده , , Paula، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
4
From page
178
To page
181
Abstract
We present an approach based on an integer programming formulation of the graph coloring problem. Our goal is to develop a model that removes some symmetrical solutions obtained by color permutations. We study the problem from a polyhedral point of view and determine some families of facets of the associated polytope. The theoretical results described here will be used to design an efficient Branch&Cut algorithm in a future work.
Keywords
graph coloring , integer programming , Facets of Polyhedra
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2001
Journal title
Electronic Notes in Discrete Mathematics
Record number
1453140
Link To Document