Name
Abstract | ||
|---|---|---|
•Robust recoverable and two-stage selection problems are considered.•Cost uncertainty is modelled using continuous and discrete budgeted uncertainty sets.•For continuous uncertainty, we proof polynomial solvability of our problems.•Efficient combinatorial algorithms for subproblems are discussed.•For discrete uncertainty, compact mixed-integer progamming formulations are derived. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1016/j.ejor.2017.08.013 | European Journal of Operational Research |
Keywords | DocType | Volume |
Combinatorial optimization,Robust optimization,Selection problem,Budgeted uncertainty,Two-stage robustness,Recoverable robustness | Journal | 265 |
Issue | ISSN | Citations |
2 | 0377-2217 | 4 |
PageRank | References | Authors |
0.41 | 16 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| André B. Chassein | 1 | 56 | 7.80 |
| Marc Goerigk | 2 | 72 | 14.77 |
| Adam Kasperski | 3 | 352 | 33.64 |
| Paweł Zieliński | 4 | 227 | 28.62 |