On the hop-constrained survivable network design problem with reliable edges
From MaRDI portal
Publication:342080
DOI10.1016/J.COR.2015.05.009zbMATH Open1349.90158OpenAlexW1791125896MaRDI QIDQ342080FDOQ342080
Authors: Quentin Botton, Bernard Fortz, Luis Gouveia 
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2015.05.009
Recommendations
- Hop constrained network design problem with partial survivability
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
- Hop-level flow formulation for the survivable network design with hop constraints problem
- A formulation for a hop constrained survivable network design problem
- Hop-level flow formulation for the hop constrained survivable network design problem
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Cites Work
- Design of Survivable Networks: A survey
- The complexity of finding maximum disjoint paths with length constraints
- Variable Disaggregation in Network Flow Problems with Piecewise Linear Costs
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Title not available (Why is that?)
- A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems
- Combinatorial Benders' Cuts for Mixed-Integer Linear Programming
- An improved Benders decomposition applied to a multi-layer network design problem
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Failure disjoint paths
Cited In (14)
- Layered graph approaches for combinatorial optimization problems
- A new linear path pair availability constraint for network design
- Network design with vulnerability constraints and probabilistic edge reliability
- Chance-constrained multi-terminal network design problems
- A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints
- Hop constrained network design problem with partial survivability
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Hop-constrained node survivable network design: An application to MPLS over WDM
- A computational study on integer programming formulations for hop-constrained survivable network design
- On Fault-Tolerant Low-Diameter Clusters in Graphs
- Hop-level flow formulation for the hop constrained survivable network design problem
- A formulation for a hop constrained survivable network design problem
- Design of survivable networks with vulnerability constraints
- Integrated reinforcement and repair of interdependent infrastructure networks under disaster-related uncertainties
Uses Software
This page was built for publication: On the hop-constrained survivable network design problem with reliable edges
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q342080)
