Network design with vulnerability constraints and probabilistic edge reliability
From MaRDI portal
Publication:6599059
reliabilityinteger linear programmingnetwork designvulnerabilitysurvivabilitylength-bounded cutresilient length-bounded cut
Linear programming (90C05) Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Reliability, availability, maintenance, inspection in operations research (90B25) Integer programming (90C10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)
Recommendations
- Design of survivable networks with vulnerability constraints
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Branch-and-cut methods for the network design problem with vulnerability constraints
- On the hop-constrained survivable network design problem with reliable edges
- Network reliability design via joint probabilistic constraints
Cites work
- scientific article; zbMATH DE number 795223 (Why is no real title available?)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
- Branch-and-cut methods for the network design problem with vulnerability constraints
- Design of Survivable Networks: A survey
- Design of survivable networks
- Design of survivable networks with vulnerability constraints
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- Multicommodity flow models for spanning trees with hop constraints
- Network flows. Theory, algorithms, and applications.
- On formulations and methods for the hop-constrained minimum spanning tree problem
- Polyhedral results for two-connected networks with bounded rings
- Solving Steiner tree problems in graphs to optimality
- Solving the Two-Connected Network with Bounded Meshes Problem
- Telecommunications network design: Technology impacts and future directions
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
This page was built for publication: Network design with vulnerability constraints and probabilistic edge reliability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599059)
