Uniqueness in quadratic and hyperbolic 0-1 programming problems

V.G. Deineko; B. Klinz; G.J. Woeginger

doi:10.1016/j.orl.2013.08.013

Uniqueness in quadratic and hyperbolic 0-1 programming problems

V.G. Deineko, B. Klinz, G.J. Woeginger

Research output: Contribution to journal › Article › Academic › peer-review

3 Citations (Scopus)

1 Downloads (Pure)

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 $\Delta_2 P$ .

Original language	English
Pages (from-to)	633-635
Journal	Operations Research Letters
Volume	41
Issue number	6
DOIs	https://doi.org/10.1016/j.orl.2013.08.013
Publication status	Published - 2013

Access to Document

10.1016/j.orl.2013.08.013

Cite this

@article{bb69d8e680864c809da8a19ccb467bdc,

title = "Uniqueness in quadratic and hyperbolic 0-1 programming problems",

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 $\Delta_2 P$ .",

author = "V.G. Deineko and B. Klinz and G.J. Woeginger",

year = "2013",

doi = "10.1016/j.orl.2013.08.013",

language = "English",

volume = "41",

pages = "633--635",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

T1 - Uniqueness in quadratic and hyperbolic 0-1 programming problems

AU - Deineko, V.G.

AU - Klinz, B.

AU - Woeginger, G.J.

PY - 2013

Y1 - 2013

N2 - 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 $\Delta_2 P$ .

AB - 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 $\Delta_2 P$ .

U2 - 10.1016/j.orl.2013.08.013

DO - 10.1016/j.orl.2013.08.013

M3 - Article

SN - 0167-6377

VL - 41

SP - 633

EP - 635

JO - Operations Research Letters

JF - Operations Research Letters

IS - 6

ER -

Uniqueness in quadratic and hyperbolic 0-1 programming problems

Abstract

Access to Document

Fingerprint

Cite this