A complete characterization of jump inequalities for the hop-constrained shortest path problem
From MaRDI portal
Publication:528561
DOI10.1016/j.dam.2017.03.010zbMath1361.05038OpenAlexW2606584551MaRDI QIDQ528561
Publication date: 12 May 2017
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.03.010
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on hop-constrained walk polytopes.
- Characterization of facets of the hop constrained chain polytope via dynamic programming
- On cardinality constrained cycle and path polytopes
- Facets of the \((s,t)-p\)-path polytope
- Hop-constrained node survivable network design: An application to MPLS over WDM
- Linear programming: foundations and extensions
- On the directed hop-constrained shortest path problem
- Notes on polyhedra associated with hop-constrained paths
- A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On the Linear Description of the k-cycle Polytope
- Algorithms for finding paths with multiple constraints
- On the facets and diameter of thek-cycle polytope
- Polyhedral Characterization of Discrete Dynamic Programming
- The Fixed-Outdegree 1-Arborescence Polytope
- 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
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Shortest Path Problems with Resource Constraints
- Facets of the \(p\)-cycle polytope
- A branch and cut approach to the cardinality constrained circuit problem.
This page was built for publication: A complete characterization of jump inequalities for the hop-constrained shortest path problem
