A note on the quickest minimum cost transshipment problem

DOI10.1016/j.orl.2023.03.005zbMath1525.90074arXiv2209.05558OpenAlexW4323669864MaRDI QIDQ6106530

No author found.

Publication date: 3 July 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.05558

zbMATH Keywords

complexitytransportation problemtransshipmentflow over time

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• A survey of dynamic network flows
• The Quickest Transshipment Problem
• An Introduction to Network Flows over Time
• Minimum-cost dynamic flows: The series-parallel case
• Cancel-and-tighten algorithm for quickest flow problems
• Minimum cost dynamic flows: The series-parallel case
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time

This page was built for publication: A note on the quickest minimum cost transshipment problem