Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks

Submitted by kerrigan@mit.edu on

TitleFully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks
Publication TypeJournal Article
Year of Publication2009
AuthorsHalman N., Li C.L, Simchi-Levi D.
JournalOperations Research Letters
Volume37
Start Page239-244
Date Published2009

Type: 

Theory