Complexity and in-approximability of a selection problem in robust optimization

V.G. Deineko, G.J. Woeginger

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)
1 Downloads (Pure)

Abstract

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). Keywords: Combinatorial optimization; Computational complexity; Robust optimization
Original languageEnglish
Pages (from-to)249-252
Number of pages4
Journal4OR : A Quarterly Journal of Operations Research
Volume11
Issue number3
DOIs
Publication statusPublished - 2013

Fingerprint

Dive into the research topics of 'Complexity and in-approximability of a selection problem in robust optimization'. Together they form a unique fingerprint.

Cite this