An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: A technical note
- Edwin Tai Chiu Cheng
- , Mikhail Y. Kovalyov
Research output: Journal article publication › Journal article › Academic research › peer-review
8
Link opens in a new tab
Citations
(Scopus)