<?xml version="1.0" encoding="utf-8"?>
<?xml-stylesheet type="text/xsl" href="style/detail_T.xsl"?>
<bibitem type="J">   <ARLID>0501589</ARLID> <utime>20240103221607.0</utime><mtime>20190215235959.9</mtime>   <SCOPUS>85056150669</SCOPUS> <WOS>000563054500006</WOS>  <DOI>10.1007/s10479-018-3091-9</DOI>           <title language="eng" primary="1">Solving joint chance constrained problems using regularization and Benders’ decomposition</title>  <specification> <page_count>27 s.</page_count> <media_type>P</media_type> </specification>   <serial><ARLID>cav_un_epca*0250807</ARLID><ISSN>0254-5330</ISSN><title>Annals of Operations Research</title><part_num/><part_title/><volume_id>292</volume_id><volume>2 (2020)</volume><page_num>683-709</page_num><publisher><place/><name>Springer</name><year/></publisher></serial>    <keyword>Stochastic programming</keyword>   <keyword>Chance constrained programming</keyword>   <keyword>Optimality conditions</keyword>   <keyword>Regularization</keyword>   <keyword>Benders' decomposition</keyword>   <keyword>Gas networks</keyword>    <author primary="1"> <ARLID>cav_un_auth*0309054</ARLID> <name1>Adam</name1> <name2>Lukáš</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept language="eng">Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department language="eng">MTR</department> <full_dept>Department of Decision Making Theory</full_dept> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0280972</ARLID> <name1>Branda</name1> <name2>Martin</name2> <institution>UTIA-B</institution> <full_dept language="cz">Matematická teorie rozhodování</full_dept> <full_dept>Department of Decision Making Theory</full_dept> <department language="cz">MTR</department> <department>MTR</department> <full_dept>Department of Decision Making Theory</full_dept> <country>CZ</country> <fullinstit>Ústav teorie informace a automatizace AV ČR, v. v. i.</fullinstit> </author> <author primary="0"> <ARLID>cav_un_auth*0372396</ARLID> <name1>Heitsch</name1> <name2>H.</name2> <country>DE</country> </author> <author primary="0"> <ARLID>cav_un_auth*0015558</ARLID> <name1>Henrion</name1> <name2>R.</name2> <country>DE</country> </author>   <source> <url>http://library.utia.cas.cz/separaty/2019/MTR/adam-0501589.pdf</url> </source> <source> <url>https://link.springer.com/article/10.1007/s10479-018-3091-9</url>  </source>        <cas_special> <project> <project_id>GA18-04145S</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0373104</ARLID> </project> <project> <project_id>GA18-05631S</project_id> <agency>GA ČR</agency> <country>CZ</country> <ARLID>cav_un_auth*0373105</ARLID> </project>  <abstract language="eng" primary="1">We consider stochastic programs with joint chance constraints with discrete random distribution. We reformulate the problem by adding auxiliary variables. Since the resulting problem has a non-regular feasible set, we regularize it by increasing the feasible set. We solve the regularized problem by iteratively solving a master problem while adding Benders’ cuts from a slave problem. Since the number of variables of the slave problem equals to the number of scenarios, we express its solution in a closed form. We show convergence properties of the solutions. On a gas network design problem, we perform a numerical study by increasing the number of scenarios and compare our solution with a solution obtained by solving the same problem with the continuous distribution.</abstract>     <result_subspec>WOS</result_subspec> <RIV>BA</RIV> <FORD0>10000</FORD0> <FORD1>10100</FORD1> <FORD2>10101</FORD2>    <reportyear>2021</reportyear>      <num_of_auth>4</num_of_auth>  <inst_support> RVO:67985556 </inst_support>  <permalink>http://hdl.handle.net/11104/0294165</permalink>  <cooperation> <ARLID>cav_un_auth*0372394</ARLID> <name>Southern University of Science and Technology</name> <country>CN</country> </cooperation> <cooperation> <ARLID>cav_un_auth*0295067</ARLID> <name>Univerzita Karlova v Praze</name> <institution>UK</institution> <country>CZ</country> </cooperation> <cooperation> <ARLID>cav_un_auth*0305285</ARLID> <name>Weierstraß-Institut für Angewandte Analysis und Stochastik</name> <country>DE</country> </cooperation>  <confidential>S</confidential>  <unknown tag="mrcbC86"> 2 Article Operations Research Management Science </unknown> <unknown tag="mrcbC91"> C </unknown>         <unknown tag="mrcbT16-e">OPERATIONSRESEARCH&amp;MANAGEMENTSCIENCE</unknown> <unknown tag="mrcbT16-f">4.161</unknown> <unknown tag="mrcbT16-g">1.247</unknown> <unknown tag="mrcbT16-h">5.4</unknown> <unknown tag="mrcbT16-i">0.01217</unknown> <unknown tag="mrcbT16-j">0.835</unknown> <unknown tag="mrcbT16-k">12669</unknown> <unknown tag="mrcbT16-q">132</unknown> <unknown tag="mrcbT16-s">1.068</unknown> <unknown tag="mrcbT16-y">43.88</unknown> <unknown tag="mrcbT16-x">3.33</unknown> <unknown tag="mrcbT16-3">3295</unknown> <unknown tag="mrcbT16-4">Q1</unknown> <unknown tag="mrcbT16-5">3.816</unknown> <unknown tag="mrcbT16-6">651</unknown> <unknown tag="mrcbT16-7">Q1</unknown> <unknown tag="mrcbT16-B">39.133</unknown> <unknown tag="mrcbT16-C">75.6</unknown> <unknown tag="mrcbT16-D">Q3</unknown> <unknown tag="mrcbT16-E">Q2</unknown> <unknown tag="mrcbT16-M">0.98</unknown> <unknown tag="mrcbT16-N">Q2</unknown> <unknown tag="mrcbT16-P">75.595</unknown> <arlyear>2020</arlyear>       <unknown tag="mrcbU14"> 85056150669 SCOPUS </unknown> <unknown tag="mrcbU24"> PUBMED </unknown> <unknown tag="mrcbU34"> 000563054500006 WOS </unknown> <unknown tag="mrcbU63"> cav_un_epca*0250807 Annals of Operations Research 0254-5330 1572-9338 Roč. 292 č. 2 2020 683 709 Springer </unknown> </cas_special> </bibitem>