A decomposable transshipment algorithm for a multiperiod transportation problem

M. Bellmore, W. D. Eklof and G. L. Nemhauser

Naval Research Logistics Quarterly, 1969, vol. 16, issue 4, 517-524

Abstract: A dynamic version of the transportation (Hitchcock) problem occurs when there are demands at each of n sinks for T periods which can be fulfilled by shipments from m sources. A requirement in period t2 can be satisfied by a shipment in the same period (a linear shipping cost is incurred) or by a shipment in period t1

Date: 1969
References: Add references at CitEc
Citations:

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

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:16:y:1969:i:4:p:517-524

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 ().