An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note
From MaRDI portal
Publication:1867103
DOI10.1016/S0305-0548(02)00065-5zbMath1010.90076MaRDI QIDQ1867103
Cheng, T. C. Edwin, Mikhail Y. Kovalyov
Publication date: 2 April 2003
Published in: Computers \& Operations Research (Search for Journal in Brave)
90C60: Abstract computational complexity for mathematical programming problems
90C30: Nonlinear programming
90B35: Deterministic scheduling theory in operations research
Related Items
Complexity of buffer capacity allocation problems for production lines with unreliable machines, Multi-product lot-sizing and sequencing on a single imperfect machine, Lot-Sizing and Sequencing on a Single Imperfect Machine
Uses Software
Cites Work