Integer programming formulations for the two 4-hop-constrained paths problem

DOI10.1002/NET.20147MaRDI QIDQ3428909zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

edge-disjoint pathshop-constraintnode-disjoint pathssurvivable network

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27)

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

• Graph theory with applications
• The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut

Cited in

(11)

• Length-bounded cuts: proper interval graphs and structural parameters
• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• The k edge-disjoint 3-hop-constrained paths polytope
• Integer programming formulations for thek-edge-connected 3-hop-constrained network design problem
• Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
• Distance transformation for network design problems
• Hop-level flow formulation for the survivable network design with hop constraints problem
• scientific article; zbMATH DE number 7765394 (Why is no real title available?)
• A computational study on integer programming formulations for hop-constrained survivable network design
• A note on hop-constrained walk polytopes.

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)