Polyhedral techniques in combinatorial optimization I: Theory
- 1 March 1996
- journal article
- Published by Wiley in Statistica Neerlandica
- Vol. 50 (1), 3-26
- https://doi.org/10.1111/j.1467-9574.1996.tb01478.x
Abstract
No abstract availableKeywords
This publication has 38 references indexed in Scilit:
- A linear description of the discrete lot-sizing and scheduling problemEuropean Journal of Operational Research, 1994
- MINTO, a mixed INTeger optimizerOperations Research Letters, 1994
- On the complexity of cutting-plane proofsDiscrete Applied Mathematics, 1987
- Optimization of a 532-city symmetric traveling salesman problem by branch and cutOperations Research Letters, 1987
- Uncapacitated lot-sizing: The convex hull of solutionsPublished by Springer Science and Business Media LLC ,1984
- On total dual integralityLinear Algebra and its Applications, 1981
- Decomposition of regular matroidsJournal of Combinatorial Theory, Series B, 1980
- On the symmetric travelling salesman problem: Solution of a 120-city problemPublished by Springer Science and Business Media LLC ,1980
- Total dual integrality and integer polyhedraLinear Algebra and its Applications, 1979
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958