On the enumerative nature of Gomory's dual cutting plane method

DOI10.1007/S10107-010-0392-4MaRDI QIDQ607496zbMATH OpenOpenAlexFDO

Authors E. Balas, Matteo Fischetti, Arrigo Zanette

Publication date 22 November 2010

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10107-010-0392-4

zbMATH Keywords

computational analysiscutting plane methodsdegeneracy in linear programmingGomory cutslexicographic dual simplex

Mathematics Subject Classification ID

Linear programming (90C05) Integer programming (90C10) Extreme-point and pivoting methods (90C49)

Recommendations

• Can Pure Cutting Plane Algorithms Work?
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• Primal cutting plane algorithms revisited
• Fenchel Cutting Planes for Integer Programs
• Gomory cuts revisited

Cites work

• A review of goal programming and its applications
• An upper bound on the number of cuts needed in Gomory's method of integer forms
• Chvátal closures for mixed integer programming problems
• Duality Theory of Linear Programs: A Constructive Approach with Applications
• Edmonds polytopes and a hierarchy of combinatorial problems
• scientific article; zbMATH DE number 3373541 (Why is no real title available?)
• Integer Programming and Pricing
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• MIR closures of polyhedral sets
• Modern multidimensional scaling. Theory and applications.
• Optimizing over the first Chvátal closure
• Optimizing over the split closure
• Outline of an algorithm for integer solutions to linear programs
• PAGP, A Partitioning Algorithm for (Linear) Goal Programming Problems

Cited in

(11)

• Primal cutting plane algorithms revisited
• On counting lattice points and Chvátal-Gomory cutting planes
• Can Pure Cutting Plane Algorithms Work?
• scientific article; zbMATH DE number 1882403 (Why is no real title available?)
• scientific article; zbMATH DE number 805039 (Why is no real title available?)
• Construction and selection for Gomory cutting plane
• Commission strategy of the auction house
• Lexicography and degeneracy: Can a pure cutting plane algorithm work?
• An abstract model for branch and cut
• \(\mathcal{V}\)-polyhedral disjunctive cuts
• A hard integer program made easy by lexicography

Describes a project that uses

Uses Software

• PAGP
• MIPLIB
• MIPLIB2003

This page was built for publication: On the enumerative nature of Gomory's dual cutting plane method

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