An algorithm for solving the transportation problem when the shipping cost over each route is convex
作者:
E. M. L. Beale,
期刊:
Naval Research Logistics Quarterly
(WILEY Available online 1959)
卷期:
Volume 6,
issue 1
页码: 43-56
ISSN:0028-1441
年代: 1959
DOI:10.1002/nav.3800060106
出版商: Wiley Subscription Services, Inc., A Wiley Company
数据来源: WILEY
摘要:
AbstractAn algorithm is presented for solving the transportation problem when the shipping cost over each route is a convex function of the number of units shipped by this route.The algorithm can also be used when the shipping costs are linear, whether or not there are capacity restrictions on the number of units that may be shipped over each route. But it does not skem to be any better than other standard methods for these problems, such as those given by Ford and Fulkerson [6], [7].
点击下载:
PDF
(756KB)
返 回