Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589)
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: Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks |
scientific article; zbMATH DE number 5595320
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks |
scientific article; zbMATH DE number 5595320 |
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
0 references
