A finitely converging cutting plane technique

DOI10.1016/0167-6377(85)90041-0zbMath0569.90065OpenAlexW2083129355WikidataQ59592721 ScholiaQ59592721MaRDI QIDQ1060961

James B. Orlin

Publication date: 1985

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1721.1/2073

zbMATH Keywords

finitely convergent cutting plane algorithmmixed integer linear programs

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11) Linear programming (90C05)

Related Items

Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective ⋮ A simple finite cutting plane algorithm for integer programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Edmonds polytopes and a hierarchy of combinatorial problems
• Outline of an algorithm for integer solutions to linear programs
• A finiteness proof for modified dantzig cuts in integer programming