Incremental network design with shortest paths
Year of publication: |
2014
|
---|---|
Authors: | Baxter, Matthew ; Elgindy, Tarek ; Ernst, Andreas T. ; Kalinowski, Thomas ; Savelsbergh, Martin W. P. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 238.2014, 3 (1.11.), p. 675-684
|
Subject: | Network design | Multi-period | Heuristic | Approximation algorithm | Integer programming | Ganzzahlige Optimierung | Heuristik | Heuristics | Algorithmus | Algorithm | Operations Research | Operations research | Graphentheorie | Graph theory |
-
Exact and heuristic algorithms for the design of hub networks with multiple lines
Martins de Sá, Elisangela, (2015)
-
A new formulation for the Safe Set problem on graphs
Macambira, Ana Flavia Uzeda, (2019)
-
A branch-and-bound algorithm for the knapsack problem with conflict graph
Bettinelli, Andrea, (2017)
- More ...
-
Incremental network design with shortest paths
Baxter, Matthew, (2014)
-
Rail schedule optimisation in the Hunter Valley Coal Chain
Singh, Gaurav, (2015)
-
Incremental network design with maximum flows
Kalinowski, Thomas, (2015)
- More ...