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

DOI10.1007/s10107-010-0392-4zbMath1201.90135OpenAlexW1999589612MaRDI QIDQ607496

Arrigo Zanette, Egon Balas, Matteo Fischetti

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

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

Related Items

A hard integer program made easy by lexicography

Uses Software

• PAGP
• MIPLIB
• MIPLIB2003

Cites Work

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