Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron
From MaRDI portal
Publication:839668
DOI10.1007/s10878-007-9134-9zbMath1170.90502OpenAlexW2162859517MaRDI QIDQ839668
Publication date: 2 September 2009
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-007-9134-9
Cites Work
- Unnamed Item
- Unnamed Item
- The traveling salesman problem in graphs with some excluded minors
- Design of survivable networks
- On perfectly two-edge connected graphs
- Topology of series-parallel networks
- \(k\)-edge connected polyhedra on series-parallel graphs
- The 2-edge-connected subgraph polyhedron
- The traveling salesman problem on a graph and some related integer polyhedra
- The k-Edge-Connected Spanning Subgraph Polyhedron
- Design of Survivable Networks: A survey