Characterization of facets of the hop constrained chain polytope via dynamic programming
From MaRDI portal
Publication:741741
DOI10.1016/j.dam.2013.08.015zbMath1303.90117OpenAlexW2012203419MaRDI QIDQ741741
Martin Grötschel, Rüdiger Stephan
Publication date: 12 September 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.015
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A note on hop-constrained walk polytopes.
- Projection, lifting and extended formulation integer and combinatorial optimization
- 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
- Using separation algorithms to generate mixed integer model reformulations
- On the directed hop-constrained shortest path problem
- Compact vs. exponential-size LP relaxations
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On the Linear Description of the k-cycle Polytope
- On a routing problem
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- On the facets and diameter of thek-cycle polytope
- Polyhedral Characterization of Discrete Dynamic Programming
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Facets of the \(p\)-cycle polytope
- A branch and cut approach to the cardinality constrained circuit problem.
