A cutting plane algorithm for graph coloring

Authors:
Isabel Méndez-Díaz;Paula Zabala
Affiliations:
Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina;Departamento de Computación, FCEyN, Universidad de Buenos Aires, Argentina
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 4
Cited 10

A generalized implicit enumeration algorithm for graph coloring

Communications of the ACM - Lecture notes in computer science Vol. 174
Integer and combinatorial optimization

Integer and combinatorial optimization
The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization

Software—Practice & Experience - Special issue on discrete algorithm engineering
New methods to color the vertices of a graph

Communications of the ACM

Branch-cut-and-propagate for the maximum k-colorable subgraph problem with symmetry

CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Safe lower bounds for graph coloring

IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
A new DSATUR-based algorithm for exact vertex coloring

Computers and Operations Research
Note: Three new upper bounds on the chromatic number

Discrete Applied Mathematics
An exact approach for the Vertex Coloring Problem

Discrete Optimization
Graph coloring facets from all-different systems

CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
A polyhedral study of the acyclic coloring problem

Discrete Applied Mathematics
On optimal k-fold colorings of webs and antiwebs

Discrete Applied Mathematics
Stochastic Learning for SAT-Encoded Graph Coloring Problems

International Journal of Applied Metaheuristic Computing
A polyhedral approach for the equitable coloring problem

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

We present an approach based on integer programming formulations of the graph coloring problem. Our goal is to develop models that remove 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 0/1-polytope associated with one of these integer programming formulations. The theoretical results described here are used to design an efficient Cutting Plane algorithm.