Uniqueness in quadratic and hyperbolic 0-1 programming problems

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

Research output: Book/ReportReportAcademic

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 languageEnglish
Publishers.n.
Number of pages6
Publication statusPublished - 2013

Publication series

NamearXiv.org
Volume1312.0903 [math.CO]

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

Cite this