Time-varying shortest path problems with constraints

Networks

Volumn 29, Issue 3, 1997, Pages 141-150

  Cai, X ^a   Kloks, T ^b   Wong, C K ^a,c  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039918015     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(sici)1097-0037(199705)29:3<141::aid-net2>3.0.co;2-h     Document Type: Article

References (9)

1. R. K. Ahuja, T. L. Magnanti, and J. B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, Englewood Cliffs, NJ (1993).
2. Y. P. Aneja and K. P. K. Nair, The constrained shortest path problem. Naval Res. Logist. Qt. 25 (1978) 549-555.
3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Introduction to Algorithms, MIT Press, Cambridge, MA (1990).
4. E. W. Dijkstra, A note on two problems in connection with graphs. Numer. Math. 1 (1959) 269-271.
5. G. Y. Handler and I. Zang, A dual algorithm for the constrained shortest path problem. Networks 10 (1980) 293-310.
6. M. M. D. Hassan, Network reduction for the acyclic constrained shortest path problem. Eur. J. Oper. Res. 63 (1992) 121-132.
7. H. C. Joksch, The shortest route problem with constraints. J. Math. Anal. Appl. 14 (1966) 191-197.
8. C. C. Skiscim and B. L. Golden, Solving k-shortest and constrained shortest path problems efficiently. Ann. Oper. Res. 20 (1989) 249-282.
9. C. Witzgall and A. J. Goldman, Most profitable routing before maintenance. Bull. Oper. Res. Soc. Am. (1965) B82.