A computational comparison of Gomory and knapsack cuts

DOI10.1016/0305-0548(87)90041-4zbMath0625.90060OpenAlexW2008736679MaRDI QIDQ580177

Dave Peters, Larry Jenkins

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)

Related Items (2)

Parametric methods in integer linear programming ⋮ An algorithm for multiparametric mixed-integer linear programming problems

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving Large-Scale Zero-One Linear Programming Problems
• Integer Programming Post-Optimal Analysis with Cutting Planes
• Facets of the knapsack polytope
• Development of a Parametric Generating Procedure for Integer Programming Test Problems
• Integer Linear Programming: A Study in Computational Efficiency

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