A note on hop-constrained walk polytopes.

DOI10.1016/J.ORL.2003.10.008MaRDI QIDQ703241zbMATH OpenOpenAlexFDO

Authors Geir Dahl, Njål Foldnes, Luis Gouveia

Publication date 11 January 2005

Published in Operations Research Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.orl.2003.10.008

zbMATH Keywords

Complete descriptionExtended formulationHop-constraintsWalk

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 776078
• Notes on polyhedra associated with hop-constrained paths
• On the directed hop-constrained shortest path problem
• Characterization of facets of the hop constrained chain polytope via dynamic programming
• Integer programming formulations for the two 4-hop-constrained paths problem

Cites work

• Notes on polyhedra associated with hop-constrained paths
• On the directed hop-constrained shortest path problem
• The perfectly matchable subgraph polytope of a bipartite graph
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints

Cited in

(6)

• Max flow and min cut with bounded-length paths: complexity, algorithms, and approximation
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation
• Characterization of facets of the hop constrained chain polytope via dynamic programming
• The \(k\) edge-disjoint 3-hop-constrained paths polytope
• scientific article; zbMATH DE number 776078 (Why is no real title available?)
• A complete characterization of jump inequalities for the hop-constrained shortest path problem

This page was built for publication: A note on hop-constrained walk polytopes.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q703241)