Time minimizing transportation problems
暂无分享，去创建一个
A procedure for time minimization in a transportation problem is developed and consists of a finite number of interactions and is based on moving from a basic feasible solution to another till the last solution is arrived at. A numerical example is given in support of the theory.
[1] Robert Garfinkel,et al. The bottleneck transportation problem , 1971 .
[2] Peter L. Hammer. Communication on “the bottleneck transportation problem” and “some remarks on the time transportation problem” , 1971 .
[3] Peter L. Hammer,et al. Time‐minimizing transportation problems , 1969 .
[4] Wlodzimierz Szwarc,et al. Some remarks on the time transportation problem , 1971 .
[5] George B. Dantzig,et al. Linear programming and extensions , 1965 .