The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
From MaRDI portal
Publication:3418127
DOI10.1002/net.20146zbMath1131.90065OpenAlexW4231512181MaRDI QIDQ3418127
Martine Labbé, David Huygens, Pierre Pesneau, Ali Ridha Mahjoub
Publication date: 2 February 2007
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20146
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items (20)
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 ⋮ On the hop-constrained survivable network design problem with reliable edges ⋮ A branch‐and‐cut algorithm for the ring spur assignment problem ⋮ Hop‐level flow formulation for the survivable network design with hop constraints problem ⋮ A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation ⋮ On the number of edges in a graph with many two-hop disjoint paths ⋮ A polyhedral study of the diameter constrained minimum spanning tree problem ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Unnamed Item ⋮ The separation problem of rounded capacity inequalities: some polynomial cases ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ Parameterized complexity of length-bounded cuts and multicuts ⋮ Characterization of facets of the hop constrained chain polytope via dynamic programming ⋮ Further contributions to network optimization ⋮ Hop-constrained node survivable network design: An application to MPLS over WDM ⋮ Integer programming formulations for the two 4-hop-constrained paths problem ⋮ The two-level diameter constrained spanning tree problem ⋮ Trade-offs among degree, diameter, and number of paths
Uses Software
Cites Work
This page was built for publication: The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
