A GRASP metaheuristic for the robust mapping and routing of dataflow process networks on manycore architectures
Year of publication: |
2015
|
---|---|
Authors: | Stan, Oana ; Sirdey, Renaud ; Carlier, Jacques ; Nace, Dritan |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 13.2015, 3, p. 309-334
|
Subject: | Placement and routing | Chance-constrained programs | Manycore | Robust optimization | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Theorie | Theory | Heuristik | Heuristics |
-
Branch-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
Pessoa, Artur, (2021)
-
Subramanyam, Anirudh, (2020)
-
Solving the bi-objective robust vehicle routing problem with uncertain costs and demands
Solano-Charris, Elyn L., (2016)
- More ...
-
Two-stage hybrid flow shop with precedence constraints and parallel machines at second stage
Carpov, Sergiu, (2012)
-
Approximate solution of a resource-constrained scheduling problem
Sirdey, Renaud, (2009)
-
Approximate solution of a resource-constrained scheduling problem
Sirdey, Renaud, (2009)
- More ...