Characterization of facets of the hop constrained chain polytope via dynamic programming
From MaRDI portal
Recommendations
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- On the directed hop-constrained shortest path problem
- Notes on polyhedra associated with hop-constrained paths
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- A note on hop-constrained walk polytopes.
Cites work
- scientific article; zbMATH DE number 1517139 (Why is no real title available?)
- A branch and cut approach to the cardinality constrained circuit problem.
- A note on hop-constrained walk polytopes.
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Compact vs. exponential-size LP relaxations
- Facets of the \((s,t)-p\)-path polytope
- Facets of the \(p\)-cycle polytope
- Hop-constrained node survivable network design: An application to MPLS over WDM
- On a routing problem
- On cardinality constrained cycle and path polytopes
- On formulations and methods for the hop-constrained minimum spanning tree problem
- On the Linear Description of the k-cycle Polytope
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
- On the directed hop-constrained shortest path problem
- On the facets and diameter of thek-cycle polytope
- Polyhedral Characterization of Discrete Dynamic Programming
- Projection, lifting and extended formulation integer and combinatorial optimization
- The two-edge connected hop-constrained network design problem: Valid inequalities and branch-and-cut
- Two Edge-Disjoint Hop-Constrained Paths and Polyhedra
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Using separation algorithms to generate mixed integer model reformulations
Cited in
(2)
This page was built for publication: Characterization of facets of the hop constrained chain polytope via dynamic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741741)
