Complexity and in-approximability of a selection problem in robust optimization
Year of publication: |
2013
|
---|---|
Authors: | Deineko, Vladimir G. ; Woeginger, Gerhard J. |
Published in: |
4OR : a quarterly journal of operations research. - Berlin, Heidelberg : Springer, ZDB-ID 2127815-5. - Vol. 11.2013, 3, p. 249-252
|
Subject: | Combinatorial optimization | Computational complexity | Robust optimization | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Robustes Verfahren | Robust statistics |
-
Maximizing a class of utility functions over the vertices of a polytope
Atamtürk, Alper, (2017)
-
Min-sup-min robust combinatorial optimization with few recourse solutions
Arslan, Ayşe N., (2022)
-
Drwal, Maciej, (2016)
- More ...
-
The complexity of computing the Muirhead-Dalton distance
Deineko, Vladimir G., (2009)
-
A well-solvable special case of the bounded knapsack problem
Deineko, Vladimir G., (2011)
-
Unbounded knapsack problems with arithmetic weight sequences
Deineko, Vladimir G., (2011)
- More ...