The Library
Pinpointing the complexity of the interval min-max regret knapsack problem
Tools
Tools
Tools
Deineko, Vladimir G. and Woeginger, Gerhard J.. (2010) Pinpointing the complexity of the interval min-max regret knapsack problem. Discrete Optimization, Vol.7 (No.4). pp. 191-196. ISSN 1572-5286
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1016/j.disopt.2010.03.008
Abstract
We show that a natural robust optimization variant of the knapsack problem is complete for the second level of the polynomial hierarchy.
| Item Type: | Journal Article |
|---|---|
| Subjects: | H Social Sciences > HD Industries. Land use. Labor > HD28 Management. Industrial Management Q Science > QA Mathematics |
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
| Journal or Publication Title: | Discrete Optimization |
| Publisher: | Elsevier Science BV |
| ISSN: | 1572-5286 |
| Date: | November 2010 |
| Volume: | Vol.7 |
| Number: | No.4 |
| Number of Pages: | 6 |
| Page Range: | pp. 191-196 |
| Identification Number: | 10.1016/j.disopt.2010.03.008 |
| Status: | Peer Reviewed |
| Publication Status: | Published |
| Access rights to Published version: | Restricted or Subscription Access |
| Funder: | University of Warwick. Centre for Discrete Mathematics and Its Applications (DI-MAP), Engineering and Physical Sciences Research Council (EPSRC), Netherlands Organization for Scientific Research, BSIK, DIAMANT |
| Grant number: | EP/F017871 (EPSRC), 639.033.403, 03018 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/5276 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
