Integer programming formulations for the two 4-hop-constrained paths problem
From MaRDI portal
Publication:3428909
DOI10.1002/net.20147zbMath1180.90200OpenAlexW4241397890MaRDI QIDQ3428909
David Huygens, Ali Ridha 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
Related Items
Length-bounded cuts: proper interval graphs and structural parameters ⋮ Branch-and-price algorithm for the resilient multi-level hop-constrained network design ⋮ Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ Hop‐level flow formulation for the survivable network design with hop constraints problem ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Unnamed Item ⋮ Distance Transformation for Network Design Problems
Cites Work