论文信息 - Notes on polyhedra associated with hop-constrained paths - 字舞流文

Notes on polyhedra associated with hop-constrained paths

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= =4 is given.

Geir Dahl | G. Dahl

[1] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[2] Collette R. Coullard,et al. THE K-WALK POLYHEDRON , 1994 .

[3] Ravindra K. Ahuja,et al. Network Flows: Theory, Algorithms, and Applications , 1993 .

[4] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[5] 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..

[6] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .