Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation

Abstract

In this note, we describe an efficient algorithm for separating a class of inequalities that includes the type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation. © 2005 Springer Science + Business Media, Inc.