Network design with vulnerability constraints and probabilistic edge reliability
DOI10.1002/NET.22222zbMATH Open1546.90044MaRDI QIDQ6599059FDOQ6599059
Authors: Okan Arslan, G. Laporte 
Publication date: 5 September 2024
Published in: Networks (Search for Journal in Brave)
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
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)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Solving Steiner tree problems in graphs to optimality
- Title not available (Why is that?)
- Design of Survivable Networks: A survey
- Design of survivable networks
- Solving the Two-Connected Network with Bounded Meshes Problem
- On formulations and methods for the hop-constrained minimum spanning tree problem
- Two-edge connected subgraphs with bounded rings: Polyhedral results and branch-and-cut
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- A branch-and-cut algorithm for the \(k\)-edge connected subgraph problem
- Multicommodity flow models for spanning trees with hop constraints
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Telecommunications network design: Technology impacts and future directions
- Design of survivable networks with vulnerability constraints
- Polyhedral results for two-connected networks with bounded rings
- Branch-and-cut methods for the network design problem with vulnerability constraints
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
Cited In (1)
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)
