Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (Q1673705)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem |
scientific article |
Statements
Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (English)
0 references
13 September 2018
0 references
approximate solution
0 references
