A new path-based cutting plane approach for the discrete time-cost tradeoff problem (Q993703)
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: A new path-based cutting plane approach for the discrete time-cost tradeoff problem |
scientific article; zbMATH DE number 5788817
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new path-based cutting plane approach for the discrete time-cost tradeoff problem |
scientific article; zbMATH DE number 5788817 |
Statements
A new path-based cutting plane approach for the discrete time-cost tradeoff problem (English)
0 references
20 September 2010
0 references
discrete time-cost tradeoff problem
0 references
project scheduling
0 references
cutting plane
0 references
0 references
0 references
0 references
0.8706127405166626
0 references
0.868935763835907
0 references
0.8675457239151001
0 references
0.859193742275238
0 references
0.8524456024169922
0 references
