Integer programming formulations for the two 4-hop-constrained paths problem
From MaRDI portal
Publication:3428909
DOI10.1002/NET.20147zbMATH Open1180.90200OpenAlexW4241397890MaRDI QIDQ3428909FDOQ3428909
Authors: David Huygens, A. R. Mahjoub 
Publication date: 30 March 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20147
Recommendations
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
Cites Work
Cited In (11)
- Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- A note on hop-constrained walk polytopes.
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design
- Title not available (Why is that?)
- Distance transformation for network design problems
- Hop-level flow formulation for the survivable network design with hop constraints problem
- A computational study on integer programming formulations for hop-constrained survivable network design
- Length-bounded cuts: proper interval graphs and structural parameters
- Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
This page was built for publication: Integer programming formulations for the two 4-hop-constrained paths problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3428909)
