{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:45:24Z","timestamp":1761896724150,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T00:00:00Z","timestamp":1516579200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["1732364","1454548"],"award-info":[{"award-number":["1732364","1454548"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["1733001"],"award-info":[{"award-number":["1733001"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s10107-018-1231-2","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T12:24:43Z","timestamp":1516623883000},"page":"29-68","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On intersection of two mixing sets with applications to joint chance-constrained programs"],"prefix":"10.1007","volume":"175","author":[{"given":"Xiao","family":"Liu","sequence":"first","affiliation":[]},{"given":"Fatma","family":"K\u0131l\u0131n\u00e7-Karzan","sequence":"additional","affiliation":[]},{"given":"Simge","family":"K\u00fc\u00e7\u00fckyavuz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,1,22]]},"reference":[{"issue":"1","key":"1231_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-016-0979-5","volume":"157","author":"A Abdi","year":"2016","unstructured":"Abdi, A., Fukasawa, R.: On the mixing set with a knapsack constraint. Math. Program. 157(1), 191\u2013217 (2016)","journal-title":"Math. Program."},{"key":"1231_CR2","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s101070000154.","volume":"89","author":"A Atamt\u00fcrk","year":"2000","unstructured":"Atamt\u00fcrk, A., Nemhauser, G.L., Savelsbergh, M.W.P.: The mixed vertex packing problem. Math. Program. 89, 35\u201353 (2000)","journal-title":"Math. Program."},{"issue":"3","key":"1231_CR3","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1137\/130910312","volume":"56","author":"D Bienstock","year":"2014","unstructured":"Bienstock, D., Chertkov, M., Harnett, S.: Chance-constrained optimal power flow: Risk-aware network control under uncertainty. SIAM Rev. 56(3), 461\u2013495 (2014)","journal-title":"SIAM Rev."},{"issue":"3","key":"1231_CR4","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1016\/0377-2217(88)90159-2","volume":"34","author":"JR Birge","year":"1988","unstructured":"Birge, J.R., Louveaux, F.V.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Op. Res. 34(3), 384\u2013392 (1988)","journal-title":"Eur. J. Op. Res."},{"key":"1231_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/PL00011430","volume":"90","author":"O G\u00fcnl\u00fck","year":"2001","unstructured":"G\u00fcnl\u00fck, O., Pochet, Y.: Mixing mixed-integer inequalities. Math. Program. 90, 429\u2013457 (2001)","journal-title":"Math. Program."},{"key":"1231_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1007\/s10107-010-0385-3","volume":"132","author":"S K\u00fc\u00e7\u00fckyavuz","year":"2012","unstructured":"K\u00fc\u00e7\u00fckyavuz, S.: On mixing sets arising in chance-constrained programming. Math. Program. 132, 31\u201356 (2012)","journal-title":"Math. Program."},{"issue":"1\u20132","key":"1231_CR7","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1007\/s10479-017-2641-x","volume":"261","author":"X Liu","year":"2018","unstructured":"Liu, X., K\u00fc\u00e7\u00fckyavuz, S.: A polyhedral study of the static probabilistic lot-sizing problem. Ann. Oper. Res. 261(1\u20132), 233\u2013254 (2018)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1231_CR8","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-014-0832-7","volume":"157","author":"X Liu","year":"2016","unstructured":"Liu, X., K\u00fc\u00e7\u00fckyavuz, S., Luedtke, J.: Decomposition algorithms for two-stage chance-constrained programs. Math. Program. 157(1), 219\u2013243 (2016)","journal-title":"Math. Program."},{"key":"1231_CR9","unstructured":"Lubin, M., Bienstock, D., Vielma, J.: Two-sided linear chance constraints and extensions (2016). Optimization Online. \n                    http:\/\/www.optimization-online.org\/DB_FILE\/2016\/02\/5345.pdf"},{"key":"1231_CR10","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107-013-0684-6","volume":"146","author":"J Luedtke","year":"2013","unstructured":"Luedtke, J.: A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support. Math. Program. 146, 219\u2013244 (2013)","journal-title":"Math. Program."},{"issue":"2","key":"1231_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10107-008-0247-4","volume":"122","author":"J Luedtke","year":"2010","unstructured":"Luedtke, J., Ahmed, S., Nemhauser, G.: An integer programming approach for linear programs with probabilistic constraints. Math. Program. 122(2), 247\u2013272 (2010)","journal-title":"Math. Program."},{"key":"1231_CR12","doi-asserted-by":"crossref","unstructured":"Pr\u00e9kopa, A.: Probabilistic programming. In: Ruszczy\u0144ski, A., Shapiro, A. (eds.) Stochastic Programming, Handbooks in Operations Research and Management Science, vol.\u00a010, pp. 267\u2013351. Elsevier (2003)","DOI":"10.1016\/S0927-0507(03)10005-9"},{"issue":"3","key":"1231_CR13","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/j.orl.2012.01.007","volume":"40","author":"JP Vielma","year":"2012","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: Mixed integer linear programming formulations for probabilistic constraints. Op. Res. Lett. 40(3), 153\u2013158 (2012)","journal-title":"Op. Res. Lett."},{"key":"1231_CR14","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"LA Wolsey","year":"2010","unstructured":"Wolsey, L.A.: Mixing sets. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, P.J., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science. Wiley, Hoboken (2010)"},{"issue":"1\u20132","key":"1231_CR15","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10107-016-1103-6","volume":"166","author":"M Zhao","year":"2017","unstructured":"Zhao, M., Huang, K., Zeng, B.: A polyhedral study on chance constrained program with random right-hand side. Math. Program. 166(1\u20132), 19\u201364 (2017)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1231-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1231-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1231-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:35:50Z","timestamp":1589646950000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1231-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,22]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["1231"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1231-2","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"type":"print","value":"0025-5610"},{"type":"electronic","value":"1436-4646"}],"subject":[],"published":{"date-parts":[[2018,1,22]]},"assertion":[{"value":"22 January 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 January 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}