A simple finite cutting plane algorithm for integer programs
From MaRDI portal
Publication:1939718
DOI10.1016/j.orl.2012.10.003zbMath1258.90052OpenAlexW2037684433MaRDI QIDQ1939718
Publication date: 5 March 2013
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2012.10.003
Related Items
Theoretical challenges towards cutting-plane selection ⋮ Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
Cites Work
- Page cuts for integer interval linear programming
- A finitely converging cutting plane technique
- Outline of an algorithm for integer solutions to linear programs
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- A finiteness proof for modified dantzig cuts in integer programming