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 | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem | Theorie | Theory | Netzwerk | Network | Unternehmensnetzwerk | Business network | Ganzzahlige Optimierung | Integer programming | Heuristik | Heuristics | Lieferkette | Supply chain |
-
Single-commodity robust network design problem : complexity, instances and heuristics solutions
Álvarez-Miranda, Eduardo, (2014)
-
A branch-and-price algorithm for solving the single-hub feeder network design problem
Hellsten, Erik Orm, (2022)
-
Network construction problems with due dates
Averbakh, Igor, (2015)
- More ...
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
A reclaimer scheduling problem arising in coal stockyard management
Angelelli, Enrico, (2016)
- More ...