On the asymmetric representatives formulation for the vertex coloring problem
Authors:
- Manoel CampêloMCManoel Campêlo
- Victor A. CamposVCVictor A. Campos
- Ricardo C. CorrêaRCRicardo C. Corrêa
- 1 April 2008
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 156 (7) , 1097-1111
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Cliques, holes and the vertex coloring polytopeInformation Processing Letters, 2004
- Facets of the Graph Coloring PolytopeAnnals of Operations Research, 2002
- A Polyhedral Approach for Graph Coloring1Electronic Notes in Discrete Mathematics, 2001
- A Column Generation Approach for Graph ColoringINFORMS Journal on Computing, 1996
- An exact algorithm for the maximum clique problemOperations Research Letters, 1990