Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:53, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks |
scientific article |
Statements
Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (English)
0 references
14 August 2009
0 references
project management
0 references
time-cost tradeoff
0 references
approximation algorithms
0 references
