Abstract
In this paper we present a study of the polytope associated to a classic linear integer programming formulation of the graph coloring problem. We determine some families of facets. This is the initial step for the development of a branch-and-cut algorithm to solve large instances of the graph coloring problem.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
K. Aardal, A. Hipolito, C. van Hoesel, B. Jansen, C. Roos and T. Terlaky, A branch-and-cut algorithm for the frequency assignment problem, Research Memorandum 96/011, Maastricht University (1996).
E. Balas, S. Ceria, G. Cornuéjols and G. Pataki, Polyhedral methods for the maximum clique problem, in: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D. Johnson and M. Trick (1996) pp. 11-27.
D. Brélaz, New methods to color the vertices of a graph, Communications of the ACM 22 (1979) 251-256.
T. Christof, A. Loebel and M. Stoer, PORTA-a polyhedron representation transformation algorithm, Version 1.3 (1997).
D. de Werra, Heuristics for graph coloring, Computing, Suppl. 7 (1990) 191-208.
F. Glover, M. Parker and J. Ryan, Coloring by tabu branch and bound, in: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D. Johnson and M. Trick (1996) pp. 285-308.
M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988).
A. Herz and D. de Werra, Using tabu search techniques for graph coloring, Computing 39 (1987) 345-351.
D. Johnson, The NP-completeness column: An ongoing guide, Journal of Algorithms 6 (1985) 434-451.
D. Johnson and M. Trick, (eds.), Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26 (1996).
R. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, eds. R. Miller and J. Thatcher (1972) pp. 85-104.
M. Kubale and B. Jackowski, A generalized implicit enumeration algorithm for graph coloring, Communications of the ACM 28(4) (1985) 412-418.
C. Mannino and A. Sassano, An exact algorithm for the maximum estable set problem, Computational Optimization and Applications 3 (1994) 243-258.
A. Mehrotra and M. Trick, A column generation approach for graph coloring, INFORMS Journal on Computing 8(4) (1996) 344-353.
G. Nemhauser and G. Sigismondi, A strong cutting plane/branch-and-bound algorithm for node packing, Journal of Operations Research Society 43(5) (1992) 443-457.
G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988).
M.W. Padberg, On the facial structure of Set Packing Polyhedral, Mathematical Programming 5 (1973) 199-215.
T.J. Sager and S. Lin, A pruning procedure for exact graph coloring, ORSA Journal on Computing 3(3) (1991) 226-230.
A. Sassano, On the facial structure of the Set Covering Polytope, Mathematical Programming 44 (1989) 181-202.
E. Sewell, An improved algorithm for exact graph coloring, in: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D. Johnson and M. Trick (1996) pp. 359-373.
L. Wolsey, Integer Programming (Wiley, New York, 1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Coll, P., Marenco, J., Méndez Díaz, I. et al. Facets of the Graph Coloring Polytope. Annals of Operations Research 116, 79–90 (2002). https://doi.org/10.1023/A:1021315911306
Issue Date:
DOI: https://doi.org/10.1023/A:1021315911306