Double-Pricing Dual and Feasible Start Algorithms for the Capacitated Transportation (Distribution) Problem
暂无分享,去创建一个
[1] Darwin Klingman,et al. Higher Order Tree Dual Approximation Methods for the Distribution Problem , 1972 .
[2] H. M. Wagner. The dual simplex algorithm for bounded variables , 1958 .
[3] D. R. Fulkerson,et al. An Out-of-Kilter Method for Minimal-Cost Flow Problems , 1960 .
[4] Michael Florian,et al. AN EXPERIMENTAL EVALUATION OF SOME METHODS OF SOLVING THE ASSIGNMENT PROBLEM , 1969 .
[5] R J Clasen. THE NUMERICAL SOLUTION OF NETWORK PROBLEMS USING THE OUT-OF-KILTER ALGORITHM , 1968 .
[6] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[7] Merrill M. Flood,et al. A transportation algorithm and code , 1961 .
[8] A. Charnes,et al. THE DUAL METHOD AND THE METHOD OF BALAS AND IVANESCU FOR THE TRANSPORTATION MODEL , 1963 .
[9] Jack B. Dennis,et al. A High-Speed Computer Technique for the Transportation Problem , 1958, JACM.
[10] Darwin Klingman,et al. Locating stepping-stone paths in distribution problems via the predecessor index method , 1970 .
[11] D. R. Fulkerson,et al. A primal‐dual algorithm for the capacitated Hitchcock problem , 1957 .
[12] C. E. Lemke,et al. The dual method of solving the linear programming problem , 1954 .
[13] A. Charnes. Optimality and Degeneracy in Linear Programming , 1952 .
[14] A. Charnes,et al. Management Models and Industrial Applications of Linear Programming , 1961 .
[15] Darwin Klingman,et al. The Augmented Predecessor Index Method for Locating Stepping-Stone Paths and Assigning Dual Prices in Distribution Problems , 1972 .