Complexity of the Discrete Time-Cost Tradeoff Problem for Project Networks (Q4367255): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1287/opre.45.2.302 / rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1287/opre.45.2.302 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2134435031 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1287/OPRE.45.2.302 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:30, 29 December 2024
scientific article; zbMATH DE number 1091537
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
