On the dominant of the Steiner 2-edge connected subgraph polytope
Author:
- 15 September 2001
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 112 (1-3) , 3-10
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph PolytopeLecture Notes in Computer Science, 1999
- 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
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity ConstraintsSIAM Journal on Optimization, 1992
- Polyhedral approaches to network survivability1991
- The traveling salesman problem on a graph and some related integer polyhedraMathematical Programming, 1985
- Topology of series-parallel networksJournal of Mathematical Analysis and Applications, 1965