Volume 9, Number 1, 59-67, DOI: 10.1007/s10878-005-5484-3

Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation

Jon Lee, Janny Leung and Sven de Vries

View Related Documents

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.

Keywords  edge coloring - integer program - binary encoding - odd cycle - separation

Fulltext Preview

Image of the first page of the fulltext document