Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements

Reliability, availability, maintenance, inspection in operations research (90B25) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Communication networks in operations research (90B18)

Cited In (20)

Title not available (Why is that?)
A Network Design Problem with Two-Edge Matching Failures
Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
A branch-and-cut algorithm for the k-edge connected subgraph problem
A branch-and-cut-and-price algorithm for vertex-biconnectivity augmentation
A dynamic programming algorithm for the local access telecommunication network expansion problem
A branch‐and‐cut algorithm for the ring spur assignment problem
Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
Routing of uncertain traffic demands
A decomposition algorithm for the ring spur assignment problem
Design of survivable networks
Title not available (Why is that?)
Critical extreme points of the 2-edge connected spanning subgraph polytope
The \(k\)-edge connected subgraph problem. I: Polytopes and critical extreme points.
Network Design with Service Requirements: Scaling-up the Size of Solvable Problems
Graphs and Algorithms in Communication Networks on Seven League Boots
Stochastic survivable network design problems: theory and practice
An Integer Polytope Related to the Design of Survivable Communication Networks
On survivable network polyhedra
Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints

Recommendations

Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints 👍 👎
Design of survivable networks 👍 👎
Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints 👍 👎
Title not available (Why is that?) 👍 👎
Title not available (Why is that?) 👍 👎

This page was built for publication: Polyhedral and Computational Investigations for Designing Communication Networks with High Survivability Requirements

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887724)