Complexity and in-approximability of a selection problem in robust optimization |
| |
| Authors: | Vladimir G Deineko Gerhard J Woeginger |
| |
| Institution: | 1. Warwick Business School, The University of Warwick, Coventry, CV4 7AL, UK
2. Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands
|
| |
| 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: | |
| 本文献已被 SpringerLink 等数据库收录！ |
|
