Pages that link to "Item:Q4887724"
From MaRDI portal
The following pages link to Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements (Q4887724):
Displaying 13 items.
- Branch-and-cut approaches for chance-constrained formulations of reliable network design problems (Q744205) (← links)
- Routing of uncertain traffic demands (Q833385) (← links)
- The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points. (Q1430376) (← links)
- A dynamic programming algorithm for the local access telecommunication network expansion problem (Q1590815) (← links)
- Stochastic survivable network design problems: theory and practice (Q1752199) (← links)
- Critical extreme points of the 2-edge connected spanning subgraph polytope (Q2583127) (← links)
- A branch-and-cut algorithm for the k-edge connected subgraph problem (Q3057129) (← links)
- A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation (Q3057179) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- A decomposition algorithm for the ring spur assignment problem (Q4921258) (← links)
- Network Design with Service Requirements: Scaling-up the Size of Solvable Problems (Q5058001) (← links)
- A Network Design Problem with Two-Edge Matching Failures (Q5247694) (← links)
- A branch‐and‐cut algorithm for the ring spur assignment problem (Q5326781) (← links)
