Hop-level flow formulation for the survivable network design with hop constraints problem
From MaRDI portal
Publication:5326786
DOI10.1002/NET.21483zbMATH Open1269.90023OpenAlexW2012910071MaRDI QIDQ5326786FDOQ5326786
Authors: L. Simonetti, Eduardo Uchoa, A. R. 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
Recommendations
- Hop-level flow formulation for the hop constrained survivable network design problem
- A formulation for a hop constrained survivable network design problem
- Hop constrained network design problem with partial survivability
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- On the hop-constrained survivable network design problem with reliable edges
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
- 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
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Notes on polyhedra associated with hop-constrained paths
- Multicommodity flow models for spanning trees with hop constraints
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
Cited In (18)
- The two-level diameter constrained spanning tree problem
- Efficient methods for the distance-based critical node detection problem in complex networks
- Layered graph approaches for combinatorial optimization problems
- The minimum spanning \(k\)-core problem with bounded CVaR under probabilistic edge failures
- Extended formulation for hop constrained distribution network configuration problems
- Robust combinatorial optimization with variable cost uncertainty
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- 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
- New formulations and solution procedures for the hop constrained network design problem.
- Distance transformation for network design problems
- Hop constrained network design problem with partial survivability
- On the chance-constrained minimum spanning \(k\)-core problem
- On the hop-constrained survivable network design problem with reliable edges
- A computational study on integer programming formulations for hop-constrained survivable network design
- 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
This page was built for publication: Hop-level flow formulation for the survivable network design with hop constraints problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5326786)
