The following pages link to (Q5465113):
Displayed 9 items.
- The \(k\) edge-disjoint 3-hop-constrained paths polytope (Q429666) (← links)
- Design of survivable IP-over-optical networks (Q863570) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- On survivable network polyhedra (Q1772416) (← links)
- Separation of partition inequalities with terminals (Q2386198) (← links)
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice (Q2638387) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Design of Survivable Networks: A survey (Q5318274) (← links)