On the complexity of project scheduling to minimize exposed time (Q2514874)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6396951
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the complexity of project scheduling to minimize exposed time |
scientific article; zbMATH DE number 6396951 |
Statements
On the complexity of project scheduling to minimize exposed time (English)
0 references
4 February 2015
0 references
complexity theory
0 references
project scheduling
0 references
secret project
0 references
NP-complete
0 references
polynomial algorithm
0 references
0.7650097608566284
0 references
0.7555791735649109
0 references
0.7542904615402222
0 references
0.7522560954093933
0 references
0.751324474811554
0 references
