Notes on polyhedra associated with hop-constrained paths
From MaRDI portal
Publication:1807932
DOI10.1016/S0167-6377(99)00025-5zbMATH Open0973.90065WikidataQ127309433 ScholiaQ127309433MaRDI QIDQ1807932FDOQ1807932
Authors: Geir Dahl 
Publication date: 24 November 1999
Published in: Operations Research Letters (Search for Journal in Brave)
Recommendations
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On the directed hop-constrained shortest path problem
- Characterization of facets of the hop constrained chain polytope via dynamic programming
Cites Work
Cited In (14)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow
- Title not available (Why is that?)
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- A note on hop-constrained walk polytopes.
- Hop‐level flow formulation for the survivable network design with hop constraints problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- On the path avoiding forbidden pairs polytope
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- Facets of the \((s,t)-p\)-path polytope
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On the directed hop-constrained shortest path problem
- Title not available (Why is that?)
- A polyhedral study of the diameter constrained minimum spanning tree problem
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
This page was built for publication: Notes on polyhedra associated with hop-constrained paths
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1807932)
