The mixed cutting plane algorithm for all-integer programming

DOI10.1016/0305-0548(86)90026-2zbMath0627.90070OpenAlexW2045076853MaRDI QIDQ1092815

Larry M. Austin, Bharat C. Ruparel

Publication date: 1986

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0305-0548(86)90026-2

zbMATH Keywords

cutting planecomputational resultsLP-relaxationlinear integer programmingall-integer simplex algorithmGomory fractional cuts

Mathematics Subject Classification ID

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

Related Items (2)

An intelligent algorithm for mixed-integer programming models ⋮ An implicit branch-and-bound algorithm for mixed-integer linear programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An advanced start algorithm for all-integer programming
• A surrogate cutting plane algorithm for all-integer programming
• A new PEC algorithm for the numerical solution of ordinary differential equations
• The Criss-Cross Method for Solving Linear Programming Problems
• Outline of an algorithm for integer solutions to linear programs
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• An advanced dual algorithm with constraint relaxation for all-integer programming

This page was built for publication: The mixed cutting plane algorithm for all-integer programming