A hard integer program made easy by lexicography

DOI10.1007/s10107-011-0450-6zbMath1254.90120OpenAlexW1969866417MaRDI QIDQ715074

Egon Balas, Arrigo Zanette, Matteo Fischetti

Publication date: 15 October 2012

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-011-0450-6

zbMATH Keywords

computational analysiscutting plane methodsdegeneracy in linear programmingGomory cutslexicographic dual simplex

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Extreme-point and pivoting methods (90C49)

Related Items

Exact lexicographic scheduling and approximate rescheduling

Uses Software

• CPLEX

Cites Work

• On the enumerative nature of Gomory's dual cutting plane method
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Minimizing Drum Latency Time