A unified framework for primal-dual methods in minimum cost network flow problems
暂无分享,去创建一个
[1] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[2] Darwin Klingman,et al. NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems , 1974 .
[3] Thomas L. Magnanti,et al. Implementing primal-dual network flow algorithms , 1976 .
[4] Darwin Klingman,et al. The alternating basis algorithm for assignment problems , 1977, Math. Program..
[5] T. Stern,et al. A Class of Decentralized Routing Algorithms Using Relaxation , 1977, IEEE Trans. Commun..
[6] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[7] Richard V. Helgason,et al. Algorithms for network programming , 1980 .
[8] Kenneth Steiglitz,et al. Combinatorial Optimization: Algorithms and Complexity , 1981 .
[9] Nesa L'abbe Wu,et al. Linear programming and extensions , 1981 .
[10] Dimitri P. Bertsekas,et al. A new algorithm for the assignment problem , 1981, Math. Program..
[11] R. Rockafellar. MONOTROPIC PROGRAMMING: DESCENT ALGORITHMS AND DUALITY , 1981 .
[12] Leon F. McGinnis,et al. Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem , 1983, Oper. Res..
[13] D. Bertsekas,et al. Relaxation methods for minimum cost network flow problems , 1983 .