二次和双曲0-1规划问题的唯一性
Uniqueness in quadratic and hyperbolic 0-1 programming problems
摘要:
我们分析的问题,决定是否二次或双曲0-1规划实例有一个唯一的最优解。这两个唯一性问题都是NP难的,但不太可能包含在NP类中。通过证明它们对于复杂性类{ \mbox{$Δ_2$P}}都是完备的,我们精确地指出了它们的计算复杂性。
英文摘要:
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{$Δ_2$P}.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。