On the enumerative nature of Gomory’s dual cutting plane method
- 30 July 2010
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 125 (2) , 325-351
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- MIR closures of polyhedral setsMathematical Programming, 2008
- Optimizing over the first Chvátal closureMathematical Programming, 2006
- Optimizing over the split closureMathematical Programming, 2006
- MIPLIB 2003Operations Research Letters, 2006
- Chvátal closures for mixed integer programming problemsMathematical Programming, 1990
- Integer and Combinatorial Optimization1988
- PAGP, A Partitioning Algorithm for (Linear) Goal Programming ProblemsACM Transactions on Mathematical Software, 1980
- Edmonds polytopes and a hierarchy of combinatorial problemsDiscrete Mathematics, 1973
- Duality Theory of Linear Programs: A Constructive Approach with ApplicationsSIAM Review, 1969
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958