Bismark Singh. Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs. Optimization Letters, 15(2):327-336, 2021. [doi]
@article{Singh21-2,
title = {Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs},
author = {Bismark Singh},
year = {2021},
doi = {10.1007/s11590-020-01592-1},
url = {https://doi.org/10.1007/s11590-020-01592-1},
researchr = {https://researchr.org/publication/Singh21-2},
cites = {0},
citedby = {0},
journal = {Optimization Letters},
volume = {15},
number = {2},
pages = {327-336},
}