Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
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.
Israel Cidon, Leonidas Georgiadis, et al.
IEEE/ACM Transactions on Networking
Daniel M. Bikel, Vittorio Castelli
ACL 2008
György E. Révész
Theoretical Computer Science
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990