Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron

DOI10.1007/S10878-007-9134-9MaRDI QIDQ839668zbMATH OpenOpenAlexFDO

Authors F. Bendali, J. Mailfert

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

zbMATH Keywords

\(k\)-edge connectivityforbidden minorshalf integralitylinear relaxationpolyhedron

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• Critical extreme points of the 2-edge connected spanning subgraph polytope
• scientific article; zbMATH DE number 1342128
• On the linear relaxation of the 2-node connected subgraph polytope
• The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
• On two-connected subgraph polytopes

Cites work

• k-edge connected polyhedra on series-parallel graphs
• Design of survivable networks
• Design of Survivable Networks: A survey
• scientific article; zbMATH DE number 176255 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• On perfectly two-edge connected graphs
• The 2-edge-connected subgraph polyhedron
• The k-Edge-Connected Spanning Subgraph Polyhedron
• The traveling salesman problem in graphs with some excluded minors
• The traveling salesman problem on a graph and some related integer polyhedra
• Topology of series-parallel networks

Cited in

(1)

• scientific article; zbMATH DE number 1342128 (Why is no real title available?)

This page was built for publication: Half integer extreme points in the linear relaxation of the 2-edge-connected subgraph polyhedron

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q839668)