On the asymmetric representatives formulation for the vertex coloring problem

Discrete Applied Mathematics

Volumn 156, Issue 7, 2008, Pages 1097-1111

  Campêlo, Manoel ^a   Campos, Victor A ^a   Corrêa, Ricardo C ^a  

^a FEDERAL UNIVERSITY OF CEARÁ   (Brazil)

Author keywords

Chromatic number; Combinatorial problems; Facets of polyhedra; Graph coloring

Indexed keywords

COMBINATORIAL OPTIMIZATION; INTEGER PROGRAMMING; NUMBER THEORY; PROBLEM SOLVING;

CHROMATIC NUMBER; FACETS OF POLYHEDRA; GRAPH COLORING; INDEPENDENT SETS FORMULATION;

GRAPH THEORY;

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

References (9)

1. Campêlo M., Corrêa R., and Frota Y. Cliques, holes and the vertex coloring polytope. Inform. Process. Lett. 89 (2004) 159-164
2. Carraghan R., and Pardalos P. An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9 (1990) 375-382
3. Coll P., Marenco J., Díaz I., and Zabala P. Facets of the graph coloring polytope. Ann. Oper. Res. 116 1-4 (2002) 79-90
4. I. Díaz, P. Zabala, A polyhedral approach for graph coloring, in: Proceedings of the Brazilian Symposium on Graphs, Algorithms and Combinatorics-GRACO 2001, Electronic Notes in Discrete Mathematics, vol. 7, 2001.
5. R. Figueiredo, V. Barbosa, N. Maculan, C. Souza, New 0-1 integer formulations of the graph coloring problem, in: Proceedings of CLAIO 2002, Chile, 2002.
6. P. Hansen, M. Labbé, D. Schindl, Set covering and packing formulations of graph coloring: algorithms and first polyhedral results, Technical Report G-2005-76, GERAD, Université de Montréal, September 2005.
7. Mehrotra A., and Trick M. A column generation approach for graph coloring. INFORMS J. Comput. 8 4 (1996) 344-354
8. M. Poggi de Aragão, E. Uchôa, Integer program reformulation for robust branch-and-cut-and-price algorithms, in: Mathematical Program in Rio: a Conference in Honour of Nelson Maculan, 2003, pp. 56-61.
9. Wolsey L. Integer Programming (1998), Wiley, New York