Proves NP-hardness of deterministic restricted items selection, shows the robust max-regret version is hard for the second level of the polynomial hierarchy, and gives an exact cut-generation algorithm with computational experiments.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DM 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Robust Approach to Restricted Items Selection Problem
Proves NP-hardness of deterministic restricted items selection, shows the robust max-regret version is hard for the second level of the polynomial hierarchy, and gives an exact cut-generation algorithm with computational experiments.