A tight bound on the speed-up through storage for quickest multi-commodity flows
From MaRDI portal
Publication:1785329
DOI10.1016/j.orl.2014.12.008zbMath1408.90049arXiv1406.4799OpenAlexW2088456596MaRDI QIDQ1785329
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
Programming involving graphs or networks (90C35) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)
Related Items
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