Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
From MaRDI portal
Publication:5656578
DOI10.1002/net.3230020304zbMath0244.90014OpenAlexW2090407060MaRDI QIDQ5656578
Publication date: 1972
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230020304
Related Items
Dynamic fleet management as a logistics queueing network ⋮ A path-based capacitated network flow model for empty railcar distribution ⋮ Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results ⋮ A survey of dynamic network flows ⋮ A general system theory approach to rail freight car fleet sizing ⋮ The DT-polynomial approach to discrete time-varying network flow problems ⋮ A simulated annealing approach for the multi-periodic rail-car fleet sizing problem ⋮ Dynamic control of multicommodity fleet management problems
Cites Work
This page was built for publication: Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers
