A tight bound on the speed-up through storage for quickest multi-commodity flows
Year of publication: |
2015
|
---|---|
Authors: | Groß, Martin ; Skutella, Martin |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 1, p. 93-95
|
Subject: | Dynamic flow | Flow over time | Quickest flow | Multi-commodity | Storage | Waiting | Suchtheorie | Search theory | Scheduling-Verfahren | Scheduling problem | Warteschlangentheorie | Queueing theory | USA | United States | Theorie | Theory |
-
A branch and price algorithm to solve the quickest multicommodity k-splittable flow problem
Melchiori, Anna, (2020)
-
A matheuristic approach for the Quickest Multicommodity k-Splittable Flow Problem
Melchiori, Anna, (2018)
-
Staffing and scheduling under nonstationary demand for service : a literature review
Defraeye, Mieke, (2016)
- More ...
-
On the complexity of instationary gas flows
Groß, Martin, (2018)
-
Intrafirm trade with ASEAN countries by Japanese and US multinational corporations
Groß, Martin, (1986)
-
The competitive strength of European, Japanese and US suppliers on ASEAN markets
Hiemenz, Ulrich, (1987)
- More ...