An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (Q1867103): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0305-0548(02)00065-5 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2138886673 / rank | |||
Normal rank | |||
Latest revision as of 10:08, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note |
scientific article |
Statements
An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note (English)
0 references
2 April 2003
0 references
unconstrained optimization
0 references
computational complexity
0 references
scheduling
0 references
