Notes on polyhedra associated with hop-constrained paths

Operations Research Letters

Volumn 25, Issue 2, 1999, Pages 97-100

  Dahl, Geir ^a  

^a UNIVERSITY OF OSLO   (Norway)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; CRITICAL PATH ANALYSIS; GRAPH THEORY; THEOREM PROVING;

CONVEX HULLS; HOP-CONSTRAINED PATHS;

OPERATIONS RESEARCH;

EID: 0032680970     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(99)00025-5     Document Type: Article

References (6)

1. R.K. Ahuja, T.L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
2. C.R. Coullard, B.A. Gamble, J. Liu, The k -walk polyhedron, in: Du, Ding-Zhu et al. (Eds.), Advances in Optimization and Approximation, Nonconvex Optim. Appl., vol. 1, Kluwer Academic Publishers, Dordrecht, 1994, p. 9-29.
3. L. Gouveia, Using variable redefinition for computing minimum spanning and Steiner trees with hop constraints. Faculdade de Ciéncias da Universidade de Lisboa, Centro de investigação operacional, Lisboa, Portugal. Report 2, 1996.
4. M. Grötschel, L. Lovász, A. Schrijver, Geometric Algorithms and Combinatorial Optimization, Springer, Berlin, 1988.
5. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, Rinehart & Winston, New York, 1976.
6. G. Nemhauser, L.A. Wolsey, Integer and Combinatorial Optimization, Wiley, New York, 1988.