Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem (Q1673705)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem |
scientific article; zbMATH DE number 6936000
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Estimation of the absolute error and polynomial solvability for a classical NP-hard scheduling problem |
scientific article; zbMATH DE number 6936000 |
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
0.8127517104148865
0 references
0.8040587306022644
0 references
0.8015711903572083
0 references
0.7998029589653015
0 references
0.7909849882125854
0 references
