A finiteness proof for modified dantzig cuts in integer programming

DOI10.1002/nav.3800170307zbMath0215.59001OpenAlexW1983222810MaRDI QIDQ5619007

Nemhauser, George I., V. J. Jun. Bowmann

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)

Related Items

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

Cites Work

• Generalized Cuts in Diophantine Programming