The Library
Complexity and in-approximability of a selection problem in robust optimization
Tools
Tools
Tools
Deineko, Vladimir G. and Woeginger, Gerhard J. (2013) Complexity and in-approximability of a selection problem in robust optimization. 4OR, 11 (3). pp. 249-252. doi:10.1007/s10288-012-0227-7
Research output not available from this repository, contact author.
Official URL: http://dx.doi.org/10.1007/s10288-012-0227-7
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.
| Item Type: | Journal Article | ||||||
|---|---|---|---|---|---|---|---|
| Subjects: | Q Science > QA Mathematics | ||||||
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||||
| Library of Congress Subject Headings (LCSH): | Combinatorial optimization, Computational complexity, Robust optimization | ||||||
| Journal or Publication Title: | 4OR | ||||||
| Publisher: | Springer | ||||||
| ISSN: | 1619-4500 | ||||||
| Official Date: | September 2013 | ||||||
| Dates: |
|
||||||
| Volume: | 11 | ||||||
| Number: | 3 | ||||||
| Number of Pages: | 4 | ||||||
| Page Range: | pp. 249-252 | ||||||
| DOI: | 10.1007/s10288-012-0227-7 | ||||||
| Status: | Peer Reviewed | ||||||
| Publication Status: | Published | ||||||
| Access rights to Published version: | Restricted or Subscription Access | ||||||
| Funder: | University of Warwick, Engineering and Physical Sciences Research Council (EPSRC), Nederlandse Organisatie voor Wetenschappelijk Onderzoek [Netherlands Organisation for Scientific Research] (NWO) | ||||||
| Grant number: | EP/F017871 (EPSRC), 639.033.403 (NWO) |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
