Selected Publications
Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs. SIAM Journal on Discrete Mathematics. 28(4)
.
2014. .
2012.
A Fully Polynomial Time Approximation Scheme for Single-item Stochastic Lot-sizing Problems with Discrete Demand. Mathematics of Operations Research. 34
.
2009. Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Networks. Operations Research Letters. 37
.
2009. Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programming Problems. ACM-SIAM SODA 2008 Program.
.
2008. Fully Polynomial Time Approximation Schemes for Time-Cost Tradeoff Problems in Series-Parallel Project Network. Accepted to Approx 2008 Program. Published in Lecture Notes in Computer Science. Springer Berlin. 5171/2008
.
2008.