Shortest path problems with time constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1113, Issue , 1996, Pages 255-266

  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

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DEPARTURE TIME; POSITIVE INTEGERS; PSEUDO-POLYNOMIAL TIME COMPLEXITY; SHORTEST PATH; SHORTEST PATH PROBLEM; TIME CONSTRAINTS; TRAVERSE TIME; WAITING TIME;

DIRECTED GRAPHS;

EID: 84901768537     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61550-4_153     Document Type: Conference Paper

References (6)

1. Ahuja, R. K., T. L. Magnanti and J. B. Orlin, Network flows: theory, algorithms, and applications, Prentice Hall, Englewood Cliffs, New Jersey. (1993)
2. Cormen, T. H., C. E. Leiserson and R. L. Rivest, Introduction to algorithms, The MIT press, Cambridge, Massachusetts. (1990)
3. Dijkstra, E. W., A note on two problems in connection with graphs, Numer. Math., 1, (1959), pp. 269-271.
4. Handler, G. Y. and I. Zang, A dual algorithm for the constrained shortest path problem, Networks, 10, (1980), pp. 293-310.
5. Hassan, M. M. D., Network reduction for the acyclic constrained shortest path problem, European Journal of Operational Research, 63, (1992), pp. 121-132.
6. Skiscim, C. C. and B. L. Golden, Solving k-shortest and constrained shortest path problems efficiently, Annals of Operations Research, 20, (1989), pp. 249-282.