On cutting-plane proofs in combinatorial optimization
- 1 March 1989
- journal article
- Published by Elsevier in Linear Algebra and its Applications
- Vol. 114-115, 455-499
- https://doi.org/10.1016/0024-3795(89)90476-x
Abstract
No abstract availableKeywords
This publication has 44 references indexed in Scilit:
- On the complexity of cutting-plane proofsDiscrete Applied Mathematics, 1987
- A class of h-perfect graphsDiscrete Mathematics, 1984
- On the structure of the monotone asymmetric travelling salesman polytope I: hypohamiltonian facetsDiscrete Mathematics, 1981
- Optimally ranking unrankable tournamentsPeriodica Mathematica Hungarica, 1980
- Subadditive lifting methods for partitioning and knapsack problemsJournal of Algorithms, 1980
- Polytope des independants d'un graphe serie-paralleleDiscrete Mathematics, 1979
- Optimal ranking of tournamentsNetworks, 1971
- On circuits and subgraphs of chromatic graphsMathematika, 1962
- Graph Theory and Probability. IICanadian Journal of Mathematics, 1961
- Outline of an algorithm for integer solutions to linear programsBulletin of the American Mathematical Society, 1958