Uniqueness in quadratic and hyperbolic 0-1 programming problems

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

Uniqueness in quadratic and hyperbolic 0-1 programming problems

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

Research output: Book/Report › Report › Academic

2 Citations (Scopus)

78 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 {\mbox{$\Delta_2$P}.

Original language	English
Publisher	s.n.
Number of pages	6
Publication status	Published - 2013

Publication series

Name	arXiv.org
Volume	1312.0903 [math.CO]

Access to Document

584409008902192Final published version, 90.1 KB

Fingerprint Dive into the research topics of 'Uniqueness in quadratic and hyperbolic 0-1 programming problems'. Together they form a unique fingerprint.

Cite this

@book{e797b02d1eb045308f09dad8f6dd0afa,

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

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

year = "2013",

language = "English",

series = "arXiv.org",

publisher = "s.n.",

}

TY - BOOK

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

M3 - Report

T3 - arXiv.org

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

PB - s.n.

ER -