A decomposable transshipment algorithm for a multiperiod transportation problem

DOI10.1002/nav.3800160406zbMath0194.19804OpenAlexW2119984032MaRDI QIDQ5589733

Nemhauser, George I., Mandell Bellmore, W. D. Eklof

Publication date: 1969

Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/nav.3800160406

zbMATH Keywords

operations research

Related Items (2)

Multi‐commodities transportation schedules over time ⋮ The dynamic transportation problem: A survey

Cites Work

• An Appraisal of Some Shortest-Path Algorithms

This page was built for publication: A decomposable transshipment algorithm for a multiperiod transportation problem