A computational comparison of Gomory and knapsack cuts

DOI10.1016/0305-0548(87)90041-4MaRDI QIDQ580177zbMATH OpenOpenAlexFDO

Authors Larry Jenkins, Dave Peters

Publication date 1987

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

Full work available at URL https://doi.org/10.1016/0305-0548(87)90041-4

zbMATH Keywords

test problemsGomory cutting planesknapsack cuts

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Boolean programming (90C09)

Recommendations

• Cutting planes for integer programs with general integer variables
• \(k\)-cuts: a variation of Gomory mixed integer cuts from the LP tableau
• Gomory cuts revisited
• Combining and strengthening Gomory cuts
• Parametric-objective integer programming using knapsack facets and Gomory cutting planes

Cites work

• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 3495856 (Why is no real title available?)
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• Development of a Parametric Generating Procedure for Integer Programming Test Problems
• Facets of the knapsack polytope
• Integer Linear Programming: A Study in Computational Efficiency
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Solving Large-Scale Zero-One Linear Programming Problems

Cited in

(5)

• Parametric methods in integer linear programming
• Parametric-objective integer programming using knapsack facets and Gomory cutting planes
• Computing with multi-row gomory cuts
• An algorithm for multiparametric mixed-integer linear programming problems
• scientific article; zbMATH DE number 710068 (Why is no real title available?)

Describes a project that uses

Uses Software

• LINDO

This page was built for publication: A computational comparison of Gomory and knapsack cuts

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