On the cut polyhedron
- 28 February 2004
- journal article
- research article
- Published by Elsevier in Discrete Mathematics
- Vol. 277 (1-3) , 279-285
Abstract
No abstract availableKeywords
All Related Versions
This publication has 10 references indexed in Scilit:
- Small Min-Cut PolyhedraMathematics of Operations Research, 1999
- Computing Edge-Connectivity in Multigraphs and Capacitated GraphsSIAM Journal on Discrete Mathematics, 1992
- On cycle cones and polyhedraLinear Algebra and its Applications, 1989
- Lot-size models with backlogging: Strong reformulations and cutting planesMathematical Programming, 1988
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Odd Minimum Cut-Sets and b-MatchingsMathematics of Operations Research, 1982
- On maximal independent sets of vertices in claw-free graphsJournal of Combinatorial Theory, Series B, 1980
- On the width—length inequalityMathematical Programming, 1979
- The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐BondsNetworks, 1975
- Matching, Euler tours and the Chinese postmanMathematical Programming, 1973