Critical extreme points of the 2-edge connected spanning subgraph polytope
- 10 November 2005
- journal article
- Published by Springer Nature in Mathematical Programming
- Vol. 105 (2-3) , 289-310
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Steiner 2-Edge Connected Subgraph Polytopes on Series-Parallel GraphsSIAM Journal on Discrete Mathematics, 1997
- k-edge connected polyhedra on series-parallel graphsOperations Research Letters, 1996
- The dominant of the 2-connected-Steiner-subgraph polytope for W4-free graphsDiscrete Applied Mathematics, 1996
- On two-connected subgraph polytopesDiscrete Mathematics, 1995
- The k-Edge-Connected Spanning Subgraph PolyhedronSIAM Journal on Discrete Mathematics, 1994
- An Integer Polytope Related to the Design of Survivable Communication NetworksSIAM Journal on Discrete Mathematics, 1993
- Linear‐time algorithms for the 2‐connected steiner subgraph problem on special classes of graphsNetworks, 1993
- Polyhedra of the Equivalent Subgraph Problem and Some Edge Connectivity ProblemsSIAM Journal on Discrete Mathematics, 1992
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Graph Theory with Applications1976