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

Nir Halman Chung-Lun Li David Simchi-Levi Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. 91-103 2008 APPROX-RANDOM http://dx.doi.org/10.1007/978-3-540-85363-3_8 conf/approx/2008 db/conf/approx/approx2008.html#HalmanLS08