A computational comparison of Gomory and knapsack cuts

DOI10.1016/0305-0548(87)90041-4zbMATH Open0625.90060OpenAlexW2008736679MaRDI QIDQ580177FDOQ580177

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

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

zbMATH Keywords

test problemsGomory cutting planesknapsack cuts

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Solving Large-Scale Zero-One Linear Programming Problems
• Facets of the knapsack polytope
• Title not available (Why is that?)
• Title not available (Why is that?)
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Development of a Parametric Generating Procedure for Integer Programming Test Problems
• Integer Linear Programming: A Study in Computational Efficiency

Cited In (5)

• An algorithm for multiparametric mixed-integer linear programming problems
• Parametric methods in integer linear programming
• Computing with multi-row gomory cuts
• Parametric-objective integer programming using knapsack facets and Gomory cutting planes
• Title not available (Why is that?)

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)