Polynomial auction algorithms for shortest paths
暂无分享,去创建一个
Dimitri P. Bertsekas | Maria Grazia Scutellà | Stefano Pallottino | D. Bertsekas | S. Pallottino | M. Scutellá
[1] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[2] Amnon Naamad,et al. An O(EVlog²V) Algorithm for the Maximal Flow Problem , 1980, J. Comput. Syst. Sci..
[3] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[4] Dimitri P. Bertsekas,et al. A new algorithm for the assignment problem , 1981, Math. Program..
[5] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .
[6] Dimitri P. Bertsekas,et al. The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial , 1990 .
[7] Dimitri P. Bertsekas,et al. Linear network optimization - algorithms and codes , 1991 .
[8] Dimitri P. Bertsekas,et al. An Auction Algorithm for Shortest Paths , 1991, SIAM J. Optim..