The following pages link to On survivable network polyhedra (Q1772416):
Displaying 5 items.
- A branch-and-cut algorithm for two-level survivable network design problems (Q342262) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Survivability in hierarchical telecommunications networks (Q2892145) (← links)
- Survivability in Hierarchical Telecommunications Networks Under Dual Homing (Q2967611) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
