A Polynomial-Time Algorithm for the Universally Quickest Transshipment Problem in a Certain Class of Dynamic Networks with Uniform Path-Lengths

DOI10.1007/978-3-642-10631-6_81zbMath1273.90027OpenAlexW1596989240MaRDI QIDQ3652266

Naoyuki Kamiyama, Naoki Katoh

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_81

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)