Uniqueness in quadratic and hyperbolic 0-1 programming problems

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

Research output: Contribution to journalArticleAcademicpeer-review

3 Citations (Scopus)
1 Downloads (Pure)


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 languageEnglish
Pages (from-to)633-635
JournalOperations Research Letters
Issue number6
Publication statusPublished - 2013


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

Cite this