The robust multiple-choice multidimensional knapsack problem
Year of publication: |
2019
|
---|---|
Authors: | Caserta, Marco ; Voß, Stefan |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 86.2019, p. 16-27
|
Subject: | Robust optimization | Knapsack problems | Mixed-integer programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Portfolio-Management | Portfolio selection | Robustes Verfahren | Robust statistics |
-
Submodularity in conic quadratic mixed 0-1 optimization
Atamtürk, Alper, (2020)
-
The recoverable robust two-level network design problem
Álvarez-Miranda, Eduardo, (2015)
-
Radius of robust feasibility for mixed-integer problems
Liers, Frauke, (2022)
- More ...
-
Die Kunst des Stapelns : eine Einführung in das Blocksortierproblem
Schwarze, Silvia, (2010)
-
A hybrid algorithm for the multi level capacitated lot sizing problem with setup carry-over
Caserta, Marco, (2009)
-
A mathematical formulation and complexity considerations for the blocks relocation problem
Caserta, Marco, (2012)
- More ...