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