Robust Approach to Restricted Items Selection Problem

We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next,...

Full description

Saved in:
Bibliographic Details
Published inarXiv.org
Main Author Drwal, Maciej
Format Paper
LanguageEnglish
Published Ithaca Cornell University Library, arXiv.org 22.07.2019
Subjects
Algorithms
Parameter uncertainty
Polynomials
Robustness (mathematics)
Online AccessGet full text

Cover

More Information
Summary:We consider the robust version of items selection problem, in which the goal is to choose representatives from a family of sets, preserving constraints on the allowed items' combinations. We prove NP-hardness of the deterministic version, and establish polynomially solvable special cases. Next, we consider the robust version in which we aim at minimizing the maximum regret of the solution under interval parameter uncertainty. We show that this problem is hard for the second level of polynomial-time hierarchy. We develop an exact solution algorithm for the robust problem, based on cut generation, and present the results of computational experiments.
ISSN:2331-8422