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
Changed an Item |
Changed an Item |
||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AMPL / rank | |||
Normal rank | |||
Revision as of 20:08, 29 February 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
