Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.orl.2009.03.002 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.ORL.2009.03.002 / rank | |||
Normal rank | |||
Latest revision as of 04:34, 10 December 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
0 references
