A cutting plane algorithm for graph coloring

Discrete Applied Mathematics

Volumn 156, Issue 2, 2008, Pages 159-179

  Méndez Díaz, Isabel ^a   Zabala, Paula ^a  

^a UNIVERSIDAD DE BUENOS AIRES   (Argentina)

Author keywords

Cutting plane algorithms; Facets of polyhedra; Graph coloring; Integer programming

Indexed keywords

COMPUTER PROGRAMMING; GRAPH THEORY; INTEGER PROGRAMMING; PROBLEM SOLVING;

CUTTING PLANE ALGORITHMS; FACETS OF POLYHEDRA; GRAPH COLORING;

ALGORITHMS;

EID: 37049026884     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.dam.2006.07.010     Document Type: Article

References (15)

1. R. Borndörfer, Aspects of set packing, partitioning and covering, Ph.D. Dissertation, Technischen Universitat Berlin, 1999.
2. Brélaz D. New methods to color the vertices of a graph. Comm. ACM 22 (1979) 251-256
3. P. Coll, J. Marenco, I. Méndez-Díaz, P. Zabala, An integer programming model for the graph coloring problem, in: Annals of X CLAIO, Mexico, 2000.
4. CPLEX Linear Optimization 8.1 with Mixed Integer & Barrier Solvers, ILOG, 1997-1998.
5. Grötschel M., Lovász L., and Schrijver A. Geometric Algorithms and Combinatorial Optimization (1988), Springer, Berlin
6. Junger M., and Thienel S. The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization. Software Practice and Experience 30 11 (2000) 1325-1352
7. Karp R. Reducibility among combinatorial problems. In: Miller R., and Thatcher J. (Eds). Complexity of Computer Computations (1972) 85-104
8. Kubale M., and Jackowski B. A generalized implicit enumeration algorithm for graph coloring. Comm. ACM 28 4 (1985) 412-418
9. Mehrotra A., and Trick M. A column generation approach for graph coloring. INFORMS J. Comput. 8 4 (1996) 344-353
10. I. Méndez-Díaz, P. Zabala, A Polyhedral Approach for Graph Coloring, Electronic Notes in Discrete Mathematics, vol. 7, 2001.
11. Nemhauser G.L., and Wolsey L. Integer and Combinatorial Optimization (1988), Wiley, New York
12. Padberg M.W. On the facial structure of set packing polyhedral. Math. Programming 5 (1973) 199-215
13. Sager T.J., and Lin S. A pruning procedure for exact graph coloring. ORSA J. Comput. 3 3 (1991) 226-230
14. Sewell E.C. An improved algorithm for exact graph coloring. In: Johnson D., and Trick M. (Eds). DIMACS (1996)
15. Wolsey L. Integer a Programming (1998), Wiley, New York