An algorithm for solving the transportation problem when the shipping cost over each route is convex

E. M. L. Beale

Naval Research Logistics Quarterly, 1959, vol. 6, issue 1, 43-56

Abstract: An 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].

Date: 1959
References: Add references at CitEc
Citations:

Downloads: (external link)
https://doi.org/10.1002/nav.3800060106

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:navlog:v:6:y:1959:i:1:p:43-56

Access Statistics for this article

More articles in Naval Research Logistics Quarterly from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().