Tighter reformulations using classical Dawson and Sankoff bounds for approximating two-stage chance-constrained programs
Crossref DOI link: https://doi.org/10.1007/s11590-020-01592-1
Published Online: 2020-05-25
Published Print: 2021-03
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Singh, Bismark http://orcid.org/0000-0002-6943-657X
Funding for this research was provided by:
Friedrich-Alexander-Universität Erlangen-Nürnberg
Text and Data Mining valid from 2020-05-25
Version of Record valid from 2020-05-25
Article History
Received: 13 August 2019
Accepted: 13 May 2020
First Online: 25 May 2020