Notes on polyhedra associated with hop-constrained paths

@article{Dahl1999NotesOP,
  title={Notes on polyhedra associated with hop-constrained paths},
  author={Geir Dahl},
  journal={Oper. Res. Lett.},
  year={1999},
  volume={25},
  pages={97-100}
}
We study the dominant of the convex hull of st-paths with at most k edges in a graph. A complete linear description is obtained for k ≤ 3 and a class of facet de ning inequalities for k ≥ 4 is given. 

From This Paper

Topics from this paper.
24 Citations
6 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 24 extracted citations

References

Publications referenced by this paper.
Showing 1-6 of 6 references

The k-walk polyhedron

  • C. R. Coullard, B. A. Gamble, J. Liu
  • Advances in optimization and approximation…
  • 1994
1 Excerpt

Network ows: theory

  • R. K. Ahuja, T. L. Magnanti, J. B. Orlin
  • algorithms, and applications. Prentice-Hall…
  • 1993

The k - walk polyhedron . InAdvances in optimization and approximation , Nonconvex Optim

  • J. Liu
  • 1993

Combinatorial optimization: networks and matroids

  • E. L. Lawler
  • Holt, Rinehart and Winston
  • 1976
1 Excerpt

Similar Papers

Loading similar papers…