ALGORITHMS FOR MINIMIZING TOTAL COST, BOTTLENECK TIME AND BOTTLENECK SHIPMENT IN TRANSPORTATION PROBLEMS
暂无分享,去创建一个
[1] Arthur M. Geoffrion,et al. Solving Bicriterion Mathematical Programs , 1967, Oper. Res..
[2] Wlodzimierz Szwarc,et al. Some remarks on the time transportation problem , 1971 .
[3] G. Thompson,et al. Alternate Formulations for Static Multi-Attribute Assignment Models , 1973 .
[4] Peter L. Hammer,et al. Time‐minimizing transportation problems , 1969 .
[5] Gerald L. Thompson,et al. Benefit-Cost Analysis of Coding Techniques for the Primal Transportation Algorithm , 1973, JACM.
[6] Peter L. Hammer. Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem” , 1971 .
[7] A. Charnes,et al. Static and Dynamic Assignment Models with Multiple Objectives, and Some Remarks on Organization Design , 1969 .
[8] George B. Dantzig,et al. Linear programming and extensions , 1965 .
[9] Robert Garfinkel,et al. The bottleneck transportation problem , 1971 .
[10] D. R. Fulkerson,et al. Flows in Networks. , 1964 .
[11] G. Thompson,et al. An operator theory of parametric programming for the transportation problem‐II , 1972 .