The Library
Uniqueness in quadratic and hyperbolic 0–1 programming problems
Tools
Tools
Tools
Deineko, Vladimir G., Klinz, Bettina and Woeginger, Gerhard J. (2013) Uniqueness in quadratic and hyperbolic 0–1 programming problems. Operations Research Letters, Volume 41 (Number 6). pp. 633-635. doi:10.1016/j.orl.2013.08.013 ISSN 0167-6377.
Research output not available from this repository.
Request-a-Copy directly from author or use local Library Get it For Me service.
Official URL: http://dx.doi.org/10.1016/j.orl.2013.08.013
Abstract
We analyze the question of deciding whether a quadratic or a hyperbolic 0–1 programming instance has a unique optimal solution. Both uniqueness questions are known to be NP-hard, but are unlikely to be contained in the class NP. We precisely pinpoint their computational complexity by showing that they both are complete for the complexity class View the MathML source.
| Item Type: | Journal Article | ||||
|---|---|---|---|---|---|
| Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||
| Journal or Publication Title: | Operations Research Letters | ||||
| Publisher: | Elsevier BV | ||||
| ISSN: | 0167-6377 | ||||
| Official Date: | 2013 | ||||
| Dates: |
|
||||
| Volume: | Volume 41 | ||||
| Number: | Number 6 | ||||
| Page Range: | pp. 633-635 | ||||
| DOI: | 10.1016/j.orl.2013.08.013 | ||||
| Status: | Peer Reviewed | ||||
| Publication Status: | Published | ||||
| Access rights to Published version: | Restricted or Subscription Access |
Request changes or add full text files to a record
Repository staff actions (login required)
 |
View Item |
