Abstract
We show that a natural robust optimization variant of the knapsack problem is complete for the second level of the polynomial hierarchy.
Original language | English |
---|---|
Pages (from-to) | 191-196 |
Journal | Discrete Optimization |
Volume | 7 |
Issue number | 4 |
DOIs | |
Publication status | Published - 2010 |