A tight bound on the speed-up through storage for quickest multi-commodity flows

DOI10.1016/j.orl.2014.12.008zbMath1408.90049arXiv1406.4799OpenAlexW2088456596MaRDI QIDQ1785329

Martin Skutella, Martin Groß

Publication date: 28 September 2018

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

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

zbMATH Keywords

storagemulti-commodityquickest flowflow over timedynamic flowwaiting

Mathematics Subject Classification ID

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

Related Items

Macroscopic evacuation plans for natural disasters. A lexicographical approach for duration and safety criteria: \(\mathrm{Lex}((Q|S)\mathrm{Flow})\)

Cites Work

• Unnamed Item
• Multicommodity flows over time: Efficient algorithms and complexity
• An Introduction to Network Flows over Time
• Universal Packet Routing with Arbitrary Bandwidths and Transit Times
• Traffic Networks and Flows over Time
• The quickest flow problem
• Constructing Maximal Dynamic Flows from Static Flows
• Quickest Flows Over Time