Complexity and in-approximability of a selection problem in robust optimization
- 196 Downloads
We establish strong NP-hardness and in-approximability of the so-called representatives selection problem, a tool selection problem in the area of robust optimization. Our results answer a recent question of Dolgui and Kovalev (4OR Q J Oper Res 10:181–192, 2012).
KeywordsCombinatorial optimization Computational complexity Robust optimization
Mathematics Subject Classification03D15 62F35
Vladimir Deineko acknowledges support by Warwick University’s Centre for Discrete Mathematics and Its Applications (DIMAP) and by EPSRC fund EP/F017871. Gerhard Woeginger acknowledges support by the Netherlands Organization for Scientific Research (NWO), grant 639.033.403, and by DIAMANT (an NWO mathematics cluster).
- Aissi H, Bazgan C, Vanderpooten D (2009) Minmax and minmax regret versions of combinatorial optimization problems: a survey. Eur J Oper Res 197:427–438Google Scholar
- Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, San FranciscoGoogle Scholar