[1]

C. Berge and A. Ghouila-Houri,*Programming, Games, and Transportation Networks*, John Wiley and Sons, Inc., New York, NY, 1962.

[2]

D. Bertsekas and R. Gallager,*Data Networks*, Prentice-Hall, Englewood Cliffs, NJ, 1987.

[3]

G. Dantzig, “On the shortest route through a network,”*Mgmt. Sci.*
**6** (1960) 187–190.

[4]

N. Deo and C. Pang, “Shortest-path algorithms: Taxonomy and annotation,”*Networks*
**14** (1984) 275–323.

[5]

M. Desrochers, “A note on the partitioning shortest path algorithm,”*Oper. Res. Letters*
**6** (1987) 183–187.

[6]

R. Dial, “Algorithm 360: Shortest path forest with topological ordering,”*Commun. ACM*,**12** (1969) 632–633.

[7]

R. Dial, F. Glover, D. Karney, and D. Klingman,*A Computational Analysis of Alternative Algorithms and Labeling Techniques for Finding Shortest Path Trees*, CCS Report 291, Center for Cybernetic Studies, The University of Texas, Austin, TX 1977.

[8]

R. Dial, F. Glover, D. Karney, and D. Klingman, “A computational analysis of alternative algorithms and labeling techniques for finding shortest path trees,”*Networks*
**9** (1979) 215–250.

[9]

E. Dijkstra, “A note on two problems in connexion with graphs,”*Numerische Mathematik*
**1** (1959) 269–271.

[10]

J. Divoky, “Improvements for the Thresh X2 shortest path algorithm,”*Oper. Res. Letters*
**6** (1987) 227–232.

[11]

S. Dreyfus, “An appraisal of some shortest-path algorithms,”*Oper. Res.*
**17** (1969) 395–412.

[12]

S. Even,*Graph Algorithms*, Computer Science Press, Rockville, MD, 1979.

[13]

G. Gallo, and S. Pallottino, “Shortest path methods: A unifying approach,”*Math. Programming Study*
**26** (1986) 38–64.

[14]

G. Gallo, and S. Pallottino, “Shortest path algorithms,”*Ann. Oper. Res.*
**13** (1988) 3–79.

[15]

F. Glover, R. Glover, and D. Klingman, “Computational study of an improved shortest path algorithm,”*Networks*
**14** (1984) 25–36.

[16]

F. Glover, D. Klingman, N. Phillips, and R. Schneider, “New Polynomial Shortest Path Algorithms and Their Computational Attributes,”*Mgmt. Sci.*
**31** (1985) 1106–1128.

[17]

P. Hart, N. Nilsson, and B. Raphael, “A formal basis for the heuristic determination of minimum cost paths,”*IEEE Trans. of Systems Science and Cybernetics*,**SSC**-**4** (1968) 100–107.

[18]

T. Hu,*Combinatorial Algorithms*, Addison-Wesley, Reading, MA, (1982).

[19]

P. Jensen and J. Barnes,*Network Flow Programming*, John Wiley and Sons, Inc., New York, NY, 1980.

[20]

D. Klingman, J. Mote, and D. Whitman,*Improving Flow Management and Control Via Improving Shortest Path Analysis*, CCS Report 322, Center for Cybernetic Studies, The University of Texas, Austin, TX, 1978.

[21]

E. Lawler,*Combinatorial Optimization: Networks and Matroids*, Holt, Rinehart, and Winston, New York, NY, 1987.

[22]

T. Mohr and C. Pasche, “A parallel shortest path algorithm,”*Computing*
**40** (1988) 281–292.

[23]

T. Nicholson, “Finding the Shortest Route Between Two Points in a Network,”*The Computer J.*
**9** (1966) 275–280.

[24]

C. Papadimitriou, and K. Steiglitz,*Combinatorial Optimization: Algorithms and Complexity*, Prentice-Hall, Englewood Cliffs, NJ, 1987.

[25]

I. Pohl,*Bi-directional and Heuristic Search in Path Problems*, SLAC Report No. 104, Stanford, CA, 1969.

[26]

I. Pohl, “Bi-directional Search,”*Machine Intelligence*, B. Meltzer and D. Michie, eds.,**6** (1971) 127–140.

[27]

M. Quinn,*Designing Efficient Algorithms for Parallel Computers*, McGraw-Hill, New York, NY, 1984.

[28]

R. Rockafellar,*Network flows and monotropic optimization*, John Wiley and Sons, Inc., New York, NY, 1984.

[29]

R. Tarjan,*Data Structures and Network Algorithms*, Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.