{0, 1/2}-Chvátal-Gomory cuts
Authors:
- 1 September 1996
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 74 (3) , 221-235
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The partition problemMathematical Programming, 1993
- Clique-Web Facets for Multicut PolytopesMathematics of Operations Research, 1992
- The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed GraphSIAM Journal on Discrete Mathematics, 1989
- Integer and Combinatorial Optimization1988
- Matrices with the edmonds—Johnson propertyCombinatorica, 1986
- Facets of the linear ordering polytopeMathematical Programming, 1985
- On the acyclic subgraph polytopeMathematical Programming, 1985
- A Cutting Plane Algorithm for the Linear Ordering ProblemOperations Research, 1984
- The ellipsoid method and its consequences in combinatorial optimizationCombinatorica, 1981
- Characterization of totally unimodular matricesProceedings of the American Mathematical Society, 1965