David S. Kung
DAC 1998
We further develop the 0/1 ILP formulation of Lee for edge coloring where colors are encoded in binary. With respect to that formulation, our main contributions are (i) an efficient separation algorithm for general block inequalities, (ii) an efficient LP-based separation algorithm for stars (i.e., the all-different polytope), (iii) an introduction of matching inequalities, (iv) an introduction of switched path inequalities and their efficient separation, (v) a complete description for paths, and (vi) the promising computational results. © 2007 INFORMS.
David S. Kung
DAC 1998
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Leo Liberti, James Ostrowski
Journal of Global Optimization
Inbal Ronen, Elad Shahar, et al.
SIGIR 2009