Fully polynomial time approximation schemes for stochastic dynamic programs

Nir Halman, Diego Klabjan, Chung-Lun Li, James B. Orlin, David Simchi-Levi. Fully polynomial time approximation schemes for stochastic dynamic programs. In Shang-Hua Teng, editor, Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008. pages 700-709, SIAM, 2008. [doi]

@inproceedings{HalmanKLOS08,
  title = {Fully polynomial time approximation schemes for stochastic dynamic programs},
  author = {Nir Halman and Diego Klabjan and Chung-Lun Li and James B. Orlin and David Simchi-Levi},
  year = {2008},
  doi = {10.1145/1347082.1347159},
  url = {http://doi.acm.org/10.1145/1347082.1347159},
  researchr = {https://researchr.org/publication/HalmanKLOS08},
  cites = {0},
  citedby = {0},
  pages = {700-709},
  booktitle = {Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008, San Francisco, California, USA, January 20-22, 2008},
  editor = {Shang-Hua Teng},
  publisher = {SIAM},
}