The mixed cutting plane algorithm for all-integer programming

DOI10.1016/0305-0548(86)90026-2MaRDI QIDQ1092815zbMATH OpenOpenAlexFDO

Authors 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

computational resultscutting planeLP-relaxationlinear integer programmingall-integer simplex algorithmGomory fractional cuts

Mathematics Subject Classification ID

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

Recommendations

• A primal-dual cutting-plane algorithm for all-integer programming
• A simple finite cutting plane algorithm for integer programs
• scientific article; zbMATH DE number 3908170
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• scientific article; zbMATH DE number 1953199

Cites work

• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• A bounded dual (all-integer) integer programming algorithm with an objective cut
• A new PEC algorithm for the numerical solution of ordinary differential equations
• A surrogate cutting plane algorithm for all-integer programming
• An advanced dual algorithm with constraint relaxation for all-integer programming
• An advanced start algorithm for all-integer programming
• Outline of an algorithm for integer solutions to linear programs
• The Criss-Cross Method for Solving Linear Programming Problems

Cited in

(21)

• A bounded dual (all-integer) integer programming algorithm with an objective cut
• Face dimensions of general-purpose cutting planes for mixed-integer linear programs
• An intelligent algorithm for mixed-integer programming models
• scientific article; zbMATH DE number 1953199 (Why is no real title available?)
• Isometric cylinder method for strict mixed-integer linear programming
• Solving \(0/1\) integer programs with enumeration cutting planes
• A primal-dual cutting-plane algorithm for all-integer programming
• An advanced start algorithm for all-integer programming
• An application of the Hermite normal form in integer programming
• An implicit branch-and-bound algorithm for mixed-integer linear programming
• scientific article; zbMATH DE number 3894836 (Why is no real title available?)
• scientific article; zbMATH DE number 2206808 (Why is no real title available?)
• scientific article; zbMATH DE number 3856824 (Why is no real title available?)
• A simple finite cutting plane algorithm for integer programs
• One modification of Gomory's algorithm
• Commission strategy of the auction house
• Cutting plane algorithms for the inverse mixed integer linear programming problem
• Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
• A surrogate cutting plane algorithm for all-integer programming
• An interior point cutting plane heuristic for mixed integer programming
• Computational Experience with an Interior Point Cutting Plane Algorithm

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

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