On equivalent reformulations for absolute value equations
Computational Optimization and Applications
Complexity of uniqueness and local search in quadratic 0-1 programming
Operations Research Letters
On complexity of unconstrained hyperbolic 0-1 programming problems
Operations Research Letters
| Hi-index | 0.00 |
We show that the problem of deciding whether an instance of the traveling salesman problem has a uniquely optimal solution is complete for Δ2P.