Uniqueness in quadratic and hyperbolic 0-1 programming problems
Combinatorics
2013-12-04 v1 Computational Complexity
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{P}.
Cite
@article{arxiv.1312.0903,
title = {Uniqueness in quadratic and hyperbolic 0-1 programming problems},
author = {Vladimir G. Deineko and Bettina Klinz and Gerhard J. Woeginger},
journal= {arXiv preprint arXiv:1312.0903},
year = {2013}
}
Comments
6 pages