Notes on polyhedra associated with hop-constrained paths

DOI10.1016/S0167-6377(99)00025-5zbMath0973.90065WikidataQ127309433 ScholiaQ127309433MaRDI QIDQ1807932

Geir Dahl

Publication date: 24 November 1999

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

polyhedrahop-constrained paths

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (10)

Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem ⋮ Hop‐level flow formulation for the survivable network design with hop constraints problem ⋮ A polyhedral study of the diameter constrained minimum spanning tree problem ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow ⋮ Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs ⋮ On the directed hop-constrained shortest path problem ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ On the \(k\) edge-disjoint 2-hop-constrained paths polytope ⋮ A note on hop-constrained walk polytopes.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Notes on polyhedra associated with hop-constrained paths