Incremental network design with maximum flows
Year of publication: |
2015
|
---|---|
Authors: | Kalinowski, Thomas ; Matsypura, Dmytro ; Savelsbergh, Martin W. P. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 242.2015, 1 (1.4.), p. 51-62
|
Subject: | Network design | Approximation algorithms | Scheduling | Theorie | Theory | Scheduling-Verfahren | Scheduling problem | Algorithmus | Algorithm | Unternehmensnetzwerk | Business network | Netzwerk | Network | Lieferkette | Supply chain |
-
Water distribution network design optimisation with respect to reliability
Janssens, Jochen, (2016)
-
Quasi-polynomial algorithms for submodular tree orienteering and directed network design problems
Ghuge, Rohan, (2022)
-
Single-commodity robust network design problem : complexity, instances and heuristics solutions
Álvarez-Miranda, Eduardo, (2014)
- More ...
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
Scheduling reclaimers serving a stock pad at a coal terminal
Kalinowski, Thomas, (2017)
- More ...