Complexity of the Project Sequencing Problem (Q3325432)
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: Complexity of the Project Sequencing Problem |
scientific article; zbMATH DE number 3856796
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the Project Sequencing Problem |
scientific article; zbMATH DE number 3856796 |
Statements
Complexity of the Project Sequencing Problem (English)
0 references
1983
0 references
NP-completeness
0 references
polynomial time algorithm
0 references
computational complexity
0 references
project sequencing
0 references
0.7777962684631348
0 references
0.7717589139938354
0 references
0.7634374499320984
0 references
0.7520723342895508
0 references
0.7474801540374756
0 references
