Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
JOURNAL OF COMBINATORIAL OPTIMIZATION. Bd. 9. H. 1. 2005 S. 59 - 67
Erscheinungsjahr: 2005
ISBN/ISSN: 1382-6905
Publikationstyp: Zeitschriftenaufsatz
Doi/URN: 10.1007/s10878-005-5484-3
| Geprüft | Bibliothek |
Inhaltszusammenfassung
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.
