Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers

DOI10.1002/NET.3230020304zbMATH Open0244.90014OpenAlexW2090407060MaRDI QIDQ5656578FDOQ5656578

William W. White

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230020304

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Title not available (Why is that?)

Cited In (8)

• The DT-polynomial approach to discrete time-varying network flow problems
• A general system theory approach to rail freight car fleet sizing
• Dynamic fleet management as a logistics queueing network
• Dynamic Container Deployment: Two-Stage Robust Model, Complexity, and Computational Results
• A survey of dynamic network flows
• A simulated annealing approach for the multi-periodic rail-car fleet sizing problem
• A path-based capacitated network flow model for empty railcar distribution
• Dynamic control of multicommodity fleet management problems

This page was built for publication: Dynamic transshipment networks: An algorithm and its application to the distribution of empty containers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5656578)