Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results

Discrete Optimization

Volumn 6, Issue 2, 2009, Pages 135-147

  Hansen, P ^a   Labbe M ^b   Schindl, D ^a  

^a GERAD   (Canada)

^b UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

Author keywords

Branch cut and price algorithm; Facets; Graph coloring; Stable sets

Indexed keywords

COMPUTATIONAL EFFICIENCY; FORESTRY; INTEGER PROGRAMMING; LINEAR PROGRAMMING; TREES (MATHEMATICS);

BRANCH-AND-PRICE ALGORITHMS; BRANCH-CUT-AND-PRICE ALGORITHM; COMPUTATIONAL EXPERIMENT; FACETS; GRAPH COLORINGS; LINEAR PROGRAMMING FORMULATION; OBJECTIVE FUNCTIONS; STABLE SETS;

GRAPH THEORY;

EID: 59849104234     PISSN: 15725286     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disopt.2008.10.004     Document Type: Article

References (16)

1. Balas E., and Ng S.M. On the set covering polytope: I. All the facets with coefficients in {0, 1, 2}. Mathematical Programming 43 (1989) 57-69
2. Barnhart C., Hane C.A., and Vance P.H. Using branch-and-price-and-cut to solve origin-destination integer multicommodity flow problems. Operations Research 48 2 (2000) 318-326
3. I. Blöchliger, A new heuristic for the graph coloring problem. Master's Thesis, École Polytechnique Fédérale de Lausanne, 2001
4. Caprara A., and Fischetti M. {0,frac(1, 2)}-Chvátal-Gomory cuts. Mathematical Programming 74 (1996) 221-235
5. Coll P., Marenco J., az I.M.D., and Zabala P. Facets of the graph coloring polytope. Annals of Operations Research 116 1-4 (2002) 79-90
6. Grötschel M., Lovàsz L., and Schrijver A. Geometric algorithms and combinatorial optimization (1993), Springer-Verlag, Berlin
7. Larsen M., Propp J., and Ullman D. The fractional chromatic number of Mycielski's graphs. Journal of Graph Theory 19 (1995) 411-416
8. Mehrotra A., and Trick M.A. A column generation approach for graph coloring. INFORMS, Journal on Computing 8 4 (1996) 344-354
9. Mycielski J. Sur le coloriage des graphes. Colloquium Mathematicum 3 (1955) 161-162 (in French)
10. Nemhauser G.L., and Park S. A polyhedral approach to edge coloring. Operations Research Letters 10 (1991) 315-322
11. Padberg M.W. On the facial structure of set packing polyhedra. Mathematical Programming 5 (1973) 199-215
12. Sassano A. On the facial structure of the set covering polytope. Mathematical Programming 44 (1989) 181-202
13. Scheinerman E., and Ullman D. Fractional graph theory: A rational approach to the theory of graphs (1997), Wiley Interscience Series in Discrete Mathematics, New York
14. D. Schindl, Some combinatorial optimization problems in graphs with applications in telecommunications and tomography. Ph.D. Thesis, École Polytechnique Fédérale de Lausanne, 2004
15. Schrijver A. Combinatorial optimization: Polyhedra and efficiency (2003), Springer, Berlin
16. 2 graph coloring problem. Journal of Heuristics 10 4 (2004) 407-413