Uniqueness in quadratic and hyperbolic 0–1 programming problems

Vladimir Deineko; Bettina Klinz; Gerhard Johannes Wöginger

doi:10.1016/j.orl.2013.08.013

Uniqueness in quadratic and hyperbolic 0–1 programming problems

Vladimir Deineko, Bettina Klinz^*, Gerhard Johannes Wöginger

^*Korrespondierende/r Autor/-in für diese Arbeit

Institut für Diskrete Mathematik (5050)

Publikation: Beitrag in einer Fachzeitschrift › Artikel › Begutachtung

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 ∆2P

Originalsprache	englisch
Seiten (von - bis)	633-635
Fachzeitschrift	Operations Research Letters
Jahrgang	41
Ausgabenummer	6
DOIs	https://doi.org/10.1016/j.orl.2013.08.013
Publikationsstatus	Veröffentlicht - 2013

Fields of Expertise

Information, Communication & Computing

Treatment code (Nähere Zuordnung)

Basic - Fundamental (Grundlagenforschung)

Zugriff auf Dokument

10.1016/j.orl.2013.08.013

Dieses zitieren

@article{f38698977d224674b5240f06957552b0,

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 ∆2P",

author = "Vladimir Deineko and Bettina Klinz and W{\"o}ginger, {Gerhard Johannes}",

year = "2013",

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

language = "English",

volume = "41",

pages = "633--635",

journal = "Operations Research Letters",

publisher = "Elsevier B.V.",

number = "6",

}

TY - JOUR

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

AU - Deineko, Vladimir

AU - Klinz, Bettina

AU - Wöginger, Gerhard Johannes

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 ∆2P

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 ∆2P

U2 - 10.1016/j.orl.2013.08.013

DO - 10.1016/j.orl.2013.08.013

M3 - Article

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

Fields of Expertise

Treatment code (Nähere Zuordnung)

Zugriff auf Dokument

Fingerprint

Dieses zitieren