A hard integer program made easy by lexicography

DOI10.1007/S10107-011-0450-6MaRDI QIDQ715074zbMATH OpenOpenAlexFDO

Authors E. Balas, Matteo Fischetti, Arrigo Zanette

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

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

Recommendations

• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Can Pure Cutting Plane Algorithms Work?
• Solving \(0/1\) integer programs with enumeration cutting planes
• Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
• On the enumerative nature of Gomory's dual cutting plane method

Cites work

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

Cited in

(2)

• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Exact lexicographic scheduling and approximate rescheduling

Describes a project that uses

Uses Software

• CPLEX

This page was built for publication: A hard integer program made easy by lexicography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q715074)