An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note

T. C. Edwin Cheng, Mikhail Y. Kovalyov. An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Computers & OR, 29(14):2087-2091, 2002. [doi]

Abstract

Abstract is missing.