论文信息 - A note on hop-constrained walk polytopes

A note on hop-constrained walk polytopes

A hop-constrained walk is a walk with at most H arcs. The cases H=<3 have been addressed previously. Here, we consider the case H=4. We present an extended formulation for 4-walks and use the projection theorem of Balas and Pulleyblank to derive a complete linear description of the 4-walk polytope.

Luís Gouveia | Geir Dahl | Njål Foldnes

[1] Geir Dahl,et al. On the directed hop-constrained shortest path problem , 2004, Oper. Res. Lett..

[2] Egon Balas,et al. The perfectly matchable subgraph polytope of a bipartite graph , 1983, Networks.

[3] Geir Dahl,et al. Notes on polyhedra associated with hop-constrained paths , 1999, Oper. Res. Lett..

[4] Luís Gouveia,et al. Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints , 1998, INFORMS J. Comput..