论文信息 - Parallel Shortest Path Auction Algorithms - 字舞流文

Parallel Shortest Path Auction Algorithms

Dimitri P. Bertsekas | Lazaros Polymenakos | D. Bertsekas | L. Polymenakos

[1] T. A. J. Nicholson,et al. Finding the Shortest Route between Two Points in a Network , 1966, Comput. J..

[2] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .

[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .

[4] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[5] Giorgio Gallo,et al. Shortest path algorithms , 1988 .

[6] John N. Tsitsiklis,et al. Parallel and distributed computation , 1989 .

[7] Lazaros Polymenakos. Analysis of parallel asynchronous schemes for the auction shortest path algorithm , 1991 .

[8] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .

[9] Dimitri P. Bertsekas,et al. An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..

[10] Dimitri P. Bertsekas,et al. Parallel synchronous and asynchronous implementations of the auction algorithm , 1991, Parallel Comput..

[11] Dimitri P. Bertsekas,et al. Polynomial auction algorithms for shortest paths , 1995, Comput. Optim. Appl..