Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.orl.2009.03.002 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1978031400 / rank | |||
Normal rank | |||
Revision as of 00:21, 20 March 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
