On the directed hop-constrained shortest path problem
From MaRDI portal
Publication:1433652
DOI10.1016/S0167-6377(03)00026-9zbMath1056.90116OpenAlexW2006877095MaRDI QIDQ1433652
Publication date: 1 July 2004
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0167-6377(03)00026-9
Related Items (15)
Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation ⋮ Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem ⋮ Enhancing discretized formulations: the knapsack reformulation and the star reformulation ⋮ Container shipping service selection and cargo routing with transshipment limits ⋮ A polyhedral study of the diameter constrained minimum spanning tree problem ⋮ The \(k\) edge-disjoint 3-hop-constrained paths polytope ⋮ Optimal Network Design with End-to-End Service Requirements ⋮ A complete characterization of jump inequalities for the hop-constrained shortest path problem ⋮ On the \(k\) edge-disjoint 2-hop-constrained paths polytope ⋮ On cardinality constrained cycle and path polytopes ⋮ Facets of the \((s,t)-p\)-path polytope ⋮ A note on hop-constrained walk polytopes. ⋮ 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
Cites Work
- Notes on polyhedra associated with hop-constrained paths
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Using a Hop-Constrained Model to Generate Alternative Communication Network Design
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On the directed hop-constrained shortest path problem
