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
Algorithmic graph theory
On the facial structure of the set covering polytope dimensional linear programming
Mathematical Programming: Series A and B
An exact algorithm for the maximum stable set problem
Computational Optimization and Applications
Software—Practice & Experience - Special issue on discrete algorithm engineering
New methods to color the vertices of a graph
Communications of the ACM
Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11-13, 1993
Register allocation via coloring
Computer Languages
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Solving a multicoloring problem with overlaps using integer programming
Discrete Applied Mathematics
Fundamental domains for integer programs with symmetries
COCOA'07 Proceedings of the 1st international conference on Combinatorial optimization and applications
Scheduling research grant proposal evaluation meetings and the range colouring problem
PATAT'06 Proceedings of the 6th international conference on Practice and theory of automated timetabling VI
Heuristic and exact algorithms for a min-max selective vehicle routing problem
Computers and Operations Research
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
Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
Journal of Symbolic Computation
A new DSATUR-based algorithm for exact vertex coloring
Computers and Operations Research
A one-to-one correspondence between colorings and stable sets
Operations Research Letters
An exact approach for the Vertex Coloring Problem
Discrete Optimization
A polyhedral study of the acyclic coloring problem
Discrete Applied Mathematics
Hi-index | 0.00 |
In this paper a Branch-and-Cut algorithm, based on a formulation previously introduced by us, is proposed for the Graph Coloring Problem. Since colors are indistinguishable in graph coloring, there may typically exist many different symmetrical colorings associated with a same number of colors. If solutions to an integer programming model of the problem exhibit that property, the Branch-and-Cut method tends to behave poorly even for small size graph coloring instances. Our model avoids, to certain extent, that bottleneck. Computational experience indicates that the results we obtain improve, in most cases, on those given by the well-known exact solution graph coloring algorithm Dsatur.