Parallel algorithms for solving aggregated shortest-path problems

Computers and Operations Research

Volumn 26, Issue 10-11, 1999, Pages 941-953

  Romeijn, H Edwin ^a   Smith, Robert L ^b  

^a ERASMUS UNIVERSITY   (Netherlands)

^b UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; DYNAMIC PROGRAMMING; ERRORS; INTELLIGENT VEHICLE HIGHWAY SYSTEMS; LARGE SCALE SYSTEMS; OPTIMIZATION;

HIERARCHICAL NETWORK DECOMPOSITION ALGORITHM; SHORTEST PATH PROBLEMS;

PARALLEL ALGORITHMS;

ALGORITHM; COMPUTER SYSTEM;

EID: 0033197901     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0305-0548(99)00029-5     Document Type: Article

References (10)

1. Dreyfus SE, Law AM. The Art and Theory of Dynamic Programming. New York: Academic Press, 1977.
2. Kaufman DE, Smith RL. Fastest paths in time-dependent networks for IVHS applications. IVHS Journal 1993;1(1):1-11.
3. Kaufman DE, Smith RL, Wunderlich KE. An iterative routing/assignment method for anticipatory real-time route guidance. IEEE VNIS Conference Proceedings, Dearborn, MI, 20-23 October, 1991:693-700.
4. Denardo EV. Dynamic Programming: Models and Applications. Englewood Cliffs, NJ: Prentice-Hall, 1982.
5. Bertsekas DP, Tsitsiklis JN. Parallel and Distributed Computation. Englewood Cliffs, NJ: Prentice-Hall, 1989.
6. Quinn MJ. Designing Efficient Algorithms for Parallel Computers. New York: McGraw-Hill, 1987.
7. Akl SG. The Design and Analysis of Parallel Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1989.
8. Bean JC, Birge JR, Smith RL. Aggregation in dynamic programming. Operations Research 1987;35:215-20.
9. Kernighan BW, Lin S. An efficient heuristic procedure for partitioning graphs. The Bell System Technical Journal 1970;49(2):291-307.
10. Feo TA, Khellaf M. A class of bounded approximation algorithms for graph partitioning. Networks 1990;20:181-95.