A finiteness proof for modified dantzig cuts in integer programming

DOI10.1002/NAV.3800170307MaRDI QIDQ5619007zbMATH OpenOpenAlexFDO

Authors V. J. Jun. Bowmann, G. L. Nemhauser

Publication date 1970

Published in Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/nav.3800170307

Mathematics Subject Classification ID

Integer programming (90C10)

Cites work

• Generalized Cuts in Diophantine Programming

Cited in

(7)

• A finitely converging cutting plane technique
• A simple finite cutting plane algorithm for integer programs
• Conflict analysis in mixed integer programming
• Optimal cutting planes from the group relaxations
• Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective
• Page cuts for integer interval linear programming
• George Dantzig's contributions to integer programming

This page was built for publication: A finiteness proof for modified dantzig cuts in integer programming

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