Single-commodity robust network design problem : complexity, instances and heuristics solutions
Year of publication: |
2014
|
---|---|
Authors: | Álvarez-Miranda, Eduardo ; Cacchiani, Valentina ; Lodi, Andrea ; Parriani, Tiziano ; Schmidt, Daniel R. |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 238.2014, 3 (1.11.), p. 711-723
|
Subject: | Robustness | Network design | Complexity | Heuristic | Proximity search | Heuristik | Heuristics | Unternehmensnetzwerk | Business network | Robustes Verfahren | Robust statistics | Theorie | Theory | Netzwerk | Network | Komplexe Systeme | Complex systems | Lieferkette | Supply chain | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung | Integer programming | Komplexitätsmanagement | Complexity management |
-
The complexity of computing a robust flow
Disser, Yann, (2020)
-
The complexity of the network design problem
Johnson, D. S., (1977)
-
Xiao, Zhongdong, (2012)
- More ...
-
Single-commodity robust network design problem: Complexity, instances and heuristic solutions
Álvarez-Miranda, Eduardo, (2014)
-
A note on computational aspects of the Steiner traveling salesman problem
Álvarez-Miranda, Eduardo, (2018)
-
On a class of interval data minimax regret CO problems
Candia-Véjar, Alfredo, (2008)
- More ...