Hop‐level flow formulation for the survivable network design with hop constraints problem
From MaRDI portal
Publication:5326786
DOI10.1002/net.21483zbMath1269.90023OpenAlexW2012910071MaRDI QIDQ5326786
Luidi Simonetti, Eduardo Uchoa, Ali Ridha Mahjoub
Publication date: 6 August 2013
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.21483
Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)
Related Items
Layered graph approaches for combinatorial optimization problems ⋮ Robust combinatorial optimization with variable cost uncertainty ⋮ The Minimum Spanning k-Core Problem with Bounded CVaR Under Probabilistic Edge Failures ⋮ Branch-and-cut methods for the network design problem with vulnerability constraints ⋮ Efficient methods for the distance-based critical node detection problem in complex networks ⋮ A comparison of node‐based and arc‐based hop‐indexed formulations for the Steiner tree problem with hop constraints ⋮ Design of survivable networks with vulnerability constraints ⋮ On the chance-constrained minimum spanning \(k\)-core problem ⋮ Distance Transformation for Network Design Problems ⋮ The two-level diameter constrained spanning tree problem
Cites Work
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- Multicommodity flow models for spanning trees with hop constraints
- Notes on polyhedra associated with hop-constrained paths
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Integer programming formulations for the two 4-hop-constrained paths problem
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- The complexity of finding maximum disjoint paths with length constraints
- Design of Survivable Networks: A survey
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
