A formulation for a hop constrained survivable network design problem
From MaRDI portal
Recommendations
- Hop-level flow formulation for the survivable network design with hop constraints problem
- Hop constrained network design problem with partial survivability
- Hop constrained Steiner trees with multiple root nodes
- Hop-level flow formulation for the hop constrained survivable network design problem
- On the hop-constrained survivable network design problem with reliable edges
Cites work
- Design of survivable networks
- Design of Survivable Networks: A survey
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Hop-level flow formulation for the hop constrained survivable network design problem
- Steiner problem in networks: A survey
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
Cited in
(14)- Hop-constrained node survivable network design: An application to MPLS over WDM
- Hop constrained network design problem with partial survivability
- Extended formulation for hop constrained distribution network configuration problems
- New formulations and solution procedures for the hop constrained network design problem.
- Models for optimal survivable routing with a minimum number of hops: comparing disaggregated with aggregated models
- Hop-level flow formulation for the hop constrained survivable network design problem
- On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints
- On the hop-constrained survivable network design problem with reliable edges
- Two node-disjoint hop-constrained survivable network design and polyhedra
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- 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
- Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
- A computational study on integer programming formulations for hop-constrained survivable network design
This page was built for publication: A formulation for a hop constrained survivable network design problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4987706)
