Gal Badishi, Idit Keidar, et al.
IEEE TDSC
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.
Gal Badishi, Idit Keidar, et al.
IEEE TDSC
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Bowen Zhou, Bing Xiang, et al.
SSST 2008
Joel L. Wolf, Mark S. Squillante, et al.
IEEE Transactions on Knowledge and Data Engineering