The k-Edge-Connected Spanning Subgraph Polyhedron
- 1 May 1994
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Discrete Mathematics
- Vol. 7 (2) , 245-259
- https://doi.org/10.1137/s0895480191222665
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity ConstraintsSIAM Journal on Discrete Mathematics, 1990
- On the Structure of Minimum-Weight k-Connected Spanning NetworksSIAM Journal on Discrete Mathematics, 1990
- Minimum-weight two-connected spanning networksMathematical Programming, 1990
- Four problems on graphs with excluded minorsMathematical Programming, 1989
- Chapter V Polyhedral combinatoricsPublished by Elsevier ,1989
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985