Decomposition approaches for recoverable robust optimization problems
| Year of publication: |
2016
|
|---|---|
| Authors: | Akker, J. M. van den ; Bouman, P. C. ; Hoogeveen, J. A. ; Tönissen, D. D. |
| Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 251.2016, 3 (16.6.), p. 739-750
|
| Subject: | Recoverable robustness | Column generation | Branch-and-price | Knapsack | Shortest path | Mathematische Optimierung | Mathematical programming | Dekompositionsverfahren | Decomposition method | Theorie | Theory | Robustes Verfahren | Robust statistics | Ganzzahlige Optimierung | Integer programming |
-
Solving robust bin-packing problems with a branch-and-price approach
Schepler, Xavier, (2022)
-
Tönissen, D. D., (2017)
-
Formulations and algorithms for the recoverable -robust knapsack problem
Büsing, Christina, (2019)
- More ...
-
Tönissen, D. D., (2017)
-
A local search algorithm for train unit shunting with service scheduling
Broek, Roel van den, (2022)
-
Minimizing total weighted tardiness on a single machine with release dates and equal-length jobs
Akker, J. M. van den, (2010)
- More ...