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.008zbMATH Open1408.90049arXiv1406.4799OpenAlexW2088456596MaRDI QIDQ1785329FDOQ1785329


Authors: Martin Groß, Martin Skutella Edit this on Wikidata


Publication date: 28 September 2018

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

Abstract: Multi-commodity flows over time exhibit the non-intuitive property that letting flow wait can allow us to send flow faster overall. Fleischer and Skutella (IPCO~2002) show that the speed-up through storage is at most a factor of~2, and that there are instances where the speed-up is as large as a factor of~4/3. We close this gap by presenting a family of instances for which the speed-up factor through storage converges to~2.


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




Recommendations




Cites Work


Cited In (1)





This page was built for publication: A tight bound on the speed-up through storage for quickest multi-commodity flows

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