On the directed hop-constrained shortest path problem

Operations Research Letters

Volumn 32, Issue 1, 2004, Pages 15-22

  Dahl, Geir ^a   Gouveia, Luis ^b  

^a UNIVERSITY OF OSLO   (Norway)

^b UNIVERSITY OF LISBON   (Portugal)

Author keywords

Hop constrained paths; Polyhedral characterizations; Valid inequalities

Indexed keywords

GRAPH THEORY; LINEAR PROGRAMMING; THEOREM PROVING;

HOP CONSTRAINED SHORTEST PATH PROBLEM;

OPERATIONS RESEARCH;

EID: 0142242243     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-6377(03)00026-9     Document Type: Article

References (9)

1. Balakrishnan A., Altinkemer K. Using a hop-constrained model to generate alternative communication network design. ORSA J. Comput. 4:1992;192-205.
2. Dahl G. Notes on polyhedra associated with hop-constrained paths. Oper. Res. Lett. 25:1999;97-100.
3. G. Dahl, L. Gouveia, On the directed hop-constrained shortest path problem, Working Paper 1-2002, Centro de Investigação Operacional, Faculdade de Ciências da Universidade de Lisboa, 2002.
4. Dahl G., Realfsen B. Curve approximation constrained shortest path problems. Networks. 36:2000;1-8.
5. Gouveia L. Using variable redefinition for computing lower bounds for minimum spanning and steiner trees with hop constraints. INFORMS J. Comput. 10:1998;180-188.
6. Lawler E.L. Combinatorial Optimization: Networks and Matroids. 1976;Holt, Rinehart and Winston, New York.
7. Nemhauser G.L., Wolsey L.A. Integer and Combinatorial Optimization. 1998;Wiley, New York.
8. J.T. Robacker, Min-max theorems on shortest chains and disjunct cuts of a network, Research Memorandum RM-1660, The Rand Corporation, Santa Monica, 1956.
9. Schrijver A. Theory of Linear and Integer Programming. 1986;Wiley, New York.