A note on hop-constrained walk polytopes.

DOI10.1016/J.ORL.2003.10.008zbMATH Open1052.05033OpenAlexW2049236593MaRDI QIDQ703241FDOQ703241

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

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

zbMATH Keywords

Complete descriptionExtended formulationHop-constraintsWalk

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

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
• Characterization of facets of the hop constrained chain polytope via dynamic programming
• Title not available (Why is that?)
• The \(k\) edge-disjoint 3-hop-constrained paths polytope
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation
• 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)