In this note, we describe an efficient algorithm for separating a class of
inequalities that includes the type-1 odd-cycle inequalities for a binary-encoded
edge-coloring formulation.
By: Jonathan Lee, Janny Leung, Sven de Vries
Published in: Journal of Combinatorial Optimization, volume 9, (no 1), pages 59-67 in 2005
Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.
Questions about this service can be mailed to reports@us.ibm.com .