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

Submitted by kerrigan@mit.edu on

TitleFully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Network
Publication TypeJournal Article
Year of Publication2008
AuthorsHalman N., Li C.L, Simchi-Levi D.
JournalAccepted to Approx 2008 Program. Published in Lecture Notes in Computer Science. Springer Berlin
Volume5171/2008
Start Page91-103
Date Published2008

Type: 

Theory