On a binary-encoded ILP coloring formulation

INFORMS Journal on Computing

Volumn 19, Issue 3, 2007, Pages 406-415

  Lee, Jon ^a   Margot, François ^b  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

All different; Binary encoding; Edge coloring; Integer programming

Indexed keywords

EID: 51849095709     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1060.0178     Document Type: Article

References (9)

1. Avis, D., K. Fukuda. 1996. Reverse search for enumeration. Discrete Appl, Math. 65 21-46.
2. Chetwynd, A. G., R. J. Wilson. 1983. The rise and fall of the critical graph conjecture. J. Graph Theory 7 153-157.
3. Coppersmith, D., J. Lee. 2005. Parsimonious binary-encoding in integer programming. Discrete Optim. 2 190-200.
4. Holyer, I. 1981. The NP-completcness of edge-coloring. SIAM J. Comput. 10 718-720.
5. Lee, J. 2002, All-different polytopes. J. Combin. Optim. 6 335-352.
6. Lee, J., F. Margot. 2004. More on a binary-encoded coloring formulation. D. Bienstock, G. Nemhauser, eds. Integer Programming and Combinatorial Optimization, Lecture Notes in Computer Science, Vol. 3064. Springer-Verlag, Berlin, Germany, 271-282.
7. Lee, J., J. Leung, S. de Vries. 2005. Separating typc-I odd-cycle inequalities for a binary encoded edge-coloring formulation. J. Combin. Optim. 9 59-67.
8. Vazirani, V. V. 1994. A theory of alternating paths and blossoms for proving correctness of the O(√VE) general graph maximum matching algorithm. Combinatorica 14 71-109.
9. Vizing, V. G. 1964. On an estimate of the chromatic class of a p-graph. Diskret. Analiz No. 3 25-30.