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

Jon Lee (), Janny Leung () and Sven Vries ()
Additional contact information
Jon Lee: IBM T.J. Watson Research Center
Janny Leung: The Chinese University of Hong Kong
Sven Vries: Technische Universität München

Journal of Combinatorial Optimization, 2005, vol. 9, issue 1, No 5, 59-67

Abstract: 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 (search for similar items in EconPapers)
Date: 2005
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://link.springer.com/10.1007/s10878-005-5484-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:9:y:2005:i:1:d:10.1007_s10878-005-5484-3

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-005-5484-3

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().