The following pages link to (Q4263710):
Displayed 6 items.
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- The 2-edge-connected subgraph polyhedron (Q2576774) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)
- On the dominant of the Steiner 2-edge connected subgraph polytope (Q5946813) (← links)