Notes on polyhedra associated with hop-constrained paths
From MaRDI portal
(Redirected from Publication:1807932)
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
(16)- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- Hop-level flow formulation for the survivable network design with hop constraints problem
- A polyhedral study of the diameter constrained minimum spanning tree problem
- scientific article; zbMATH DE number 3962623 (Why is no real title available?)
- A note on hop-constrained walk polytopes.
- On the directed hop-constrained shortest path problem
- Characterization of facets of the hop constrained chain polytope via dynamic programming
- The \(k\) edge-disjoint 3-hop-constrained paths polytope
- Facets of the \((s,t)-p\)-path polytope
- scientific article; zbMATH DE number 776078 (Why is no real title available?)
- Composition of graphs and the hop-constrained path problem
- On the path avoiding forbidden pairs polytope
- On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
- A complete characterization of jump inequalities for the hop-constrained shortest path problem
- Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem
- On the \(k\) edge-disjoint 2-hop-constrained paths polytope
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)
