Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (Q4367255)
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 Discrete Time-Cost Tradeoff Problem for Project Networks |
scientific article; zbMATH DE number 1091537
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks |
scientific article; zbMATH DE number 1091537 |
Statements
Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (English)
0 references
25 November 1997
0 references
time-cost tradeoff
0 references
project networks
0 references
exponential worst-case complexity
0 references
strongly NP-hard
0 references
0.8496820330619812
0 references
0.848373532295227
0 references
0.8474885821342468
0 references
0.830981433391571
0 references
0.8271298408508301
0 references
