The following pages link to On survivable network polyhedra (Q1772416):
Displaying 17 items.
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- Survivable networks, linear programming relaxations and the parsimonious property (Q689117) (← links)
- Properties of optimal survivable paths in a graph (Q814315) (← links)
- The \(k\)-path tree matroid and its applications to survivable network design (Q951105) (← links)
- A polyhedral approach to multicommodity survivable network design (Q1338830) (← links)
- Topological design of survivable mesh-based transport networks (Q1599302) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Separation of partition inequalities for the \((1,2)\)-survivable network design problem (Q1866009) (← links)
- A cutting plane algorithm for computing \(k\)-edge survivability of a network (Q1877897) (← links)
- Steiner \(k\)-edge connected subgraph polyhedra (Q1977866) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- On the Steiner 2-edge connected subgraph polytope (Q3598034) (← links)
- Low-connectivity network design on series-parallel graphs (Q4474292) (← links)
- A directed cycle-based column-and-cut generation method for capacitated survivable network design (Q4474304) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- Design of survivable networks with low connectivity requirements (Q6659118) (← links)
