{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T20:45:13Z","timestamp":1743021913614,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031327254"},{"type":"electronic","value":"9783031327261"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-32726-1_26","type":"book-chapter","created":{"date-parts":[[2023,5,21]],"date-time":"2023-05-21T20:28:43Z","timestamp":1684700923000},"page":"363-377","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exploiting the\u00a0Polyhedral Geometry of\u00a0Stochastic Linear Bilevel Programming"],"prefix":"10.1007","author":[{"given":"Gonzalo","family":"Mu\u00f1oz","sequence":"first","affiliation":[]},{"given":"David","family":"Salas","sequence":"additional","affiliation":[]},{"given":"Anton","family":"Svensson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,22]]},"reference":[{"key":"26_CR1","unstructured":"Coral bilevel optimization problem library. https:\/\/coral.ise.lehigh.edu\/data-sets\/bilevel-instances\/ Accessed 3 Nov 2022"},{"key":"26_CR2","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C. M.: Nonlinear programming: theory and algorithms. John Wiley Sons (2013)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Beck, Y., Ljubi\u0107, I., Schmidt, M.: A survey on bilevel optimization under uncertainty. European J. Oper. Res., (2023) (In Press)","DOI":"10.1016\/j.ejor.2023.01.008"},{"issue":"1","key":"26_CR4","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1137\/141000671","volume":"59","author":"J Bezanson","year":"2017","unstructured":"Bezanson, J., Edelman, A., Karpinski, S., Shah, V.B.: Julia: A fresh approach to numerical computing. SIAM review 59(1), 65\u201398 (2017)","journal-title":"SIAM review"},{"key":"26_CR5","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/s10957-022-02037-8","volume":"194","author":"C Buchheim","year":"2022","unstructured":"Buchheim, C., Henke, D., Irmai, J.: The stochastic bilevel continuous knapsack problem with uncertain follower\u2019s objective. J. Optim. Theory. Appl. 194, 521\u2013542 (2022)","journal-title":"J. Optim. Theory. Appl."},{"key":"26_CR6","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/978-3-030-52119-6_17","volume-title":"Bilevel Optimization","author":"J Burtscheidt","year":"2020","unstructured":"Burtscheidt, J., Claus, M.: Bilevel Linear Optimization Under Uncertainty. In: Dempe, S., Zemkoho, A. (eds.) Bilevel Optimization. SOIA, vol. 161, pp. 485\u2013511. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52119-6_17"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.orl.2021.04.007","volume":"49","author":"M Claus","year":"2021","unstructured":"Claus, M.: On continuity in risk-averse bilevel stochastic linear programming with random lower level objective function. Oper. Res. Lett. 49(3), 412\u2013417 (2021)","journal-title":"Oper. Res. Lett."},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"542","DOI":"10.1016\/j.ejor.2021.12.004","volume":"299","author":"M Claus","year":"2022","unstructured":"Claus, M.: Existence of solutions for a class of bilevel stochastic linear programs. European J. Oper. Res. 299(2), 542\u2013549 (2022)","journal-title":"European J. Oper. Res."},{"key":"26_CR9","doi-asserted-by":"publisher","unstructured":"De Loera, J., Rambau, J., Santos, F.: Triangulations: structures for algorithms and applications, volume 25. Springer Science Business Media (2010) https:\/\/doi.org\/10.1007\/978-3-642-12971-1","DOI":"10.1007\/978-3-642-12971-1"},{"key":"26_CR10","doi-asserted-by":"publisher","unstructured":"Dempe, S.: Foundations of bilevel programming. Springer Science Business Media (2002) https:\/\/doi.org\/10.1007\/b101970","DOI":"10.1007\/b101970"},{"key":"26_CR11","doi-asserted-by":"publisher","unstructured":"Dempe, S., Kalashnikov, V., P\u00e9rez-Vald\u00e9s, G.A., Kalashnykova, N.: Bilevel programming problems. Energy Systems. Springer, Heidelberg, 2015. Theory, algorithms and applications to energy networks https:\/\/doi.org\/10.1007\/978-3-662-45827-3","DOI":"10.1007\/978-3-662-45827-3"},{"key":"26_CR12","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-52119-6","volume-title":"Bilevel Optimization","year":"2020","unstructured":"Dempe, S., Zemkoho, A. (eds.): SOIA, vol. 161. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52119-6"},{"key":"26_CR13","unstructured":"Forcier, M.: Multistage stochastic optimization and polyhedral geometry. PhD. Thesis, \u00c9cole de Ponts - ParisTech (2022)"},{"key":"26_CR14","unstructured":"Forcier, M., Gaubert, S., Lecl\u00e8re, V.: Exact quantization of multistage stochastic linear problems (2021) (preprint - arXiv:2107.09566)"},{"key":"26_CR15","doi-asserted-by":"crossref","unstructured":"Gawrilow, E., Joswig, M., polymake: a framework for analyzing convex polytopes. In Polytopes\u2013combinatorics and computation of DMV Sem (Oberwolfach, 1997), 29, pp. 43\u201373. Birkh\u00e4user, Basel, (2000)","DOI":"10.1007\/978-3-0348-8438-9_2"},{"key":"26_CR16","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual (2022)"},{"key":"26_CR17","doi-asserted-by":"publisher","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, J.-B.: Convex analysis and minimization algorithms I: Fundamentals, volume 305. Springer science business media (2013) https:\/\/doi.org\/10.1007\/978-3-662-02796-7","DOI":"10.1007\/978-3-662-02796-7"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Homem-de Mello, T., Bayraksan, G.: Monte Carlo sampling-based methods for stochastic optimization. Surv. Oper. Res. Manag. Sci., 19(1), 56\u201385 (2014)","DOI":"10.1016\/j.sorms.2014.05.001"},{"issue":"4","key":"26_CR19","first-page":"27","volume":"25","author":"SV Ivanov","year":"2018","unstructured":"Ivanov, S.V.: A bilevel programming problem with random parameters in the follower\u2019s objective function. Diskretn. Anal. Issled. Oper. 25(4), 27\u201345 (2018)","journal-title":"Diskretn. Anal. Issled. Oper."},{"key":"26_CR20","doi-asserted-by":"publisher","unstructured":"Khachiyan, L., Boros, E., Borys, K., Gurvich, V., Elbassioni, K.:Generating all vertices of a polyhedron is hard. In 20th Anniversary Volume, 1\u201317. Springer (2009) https:\/\/doi.org\/10.1007\/s00454-008-9050-5","DOI":"10.1007\/s00454-008-9050-5"},{"key":"26_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2021.100007","volume":"9","author":"T Kleinert","year":"2021","unstructured":"Kleinert, T., Labb\u00e9, M., Ljubi\u0107, I., Schmidt, M.: A survey on mixed-integer programming techniques in bilevel optimization. EURO J. Comput. Optim. 9, 100007 (2021)","journal-title":"EURO J. Comput. Optim."},{"key":"26_CR22","doi-asserted-by":"publisher","unstructured":"Klenke, A: Probability Theory: a Comprehensive Course. Springer (2014) https:\/\/doi.org\/10.1007\/978-1-4471-5361-0","DOI":"10.1007\/978-1-4471-5361-0"},{"key":"26_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03425-6","volume-title":"Introduction to quasi-Monte Carlo integration and applications","author":"G Leobacher","year":"2014","unstructured":"Leobacher, G., Pillichshammer, F.: Introduction to quasi-Monte Carlo integration and applications. Compact Textbooks in Mathematics. Birkh\u00e4user\/Springer, Cham (2014)"},{"issue":"2\u20133","key":"26_CR24","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s11228-008-0077-9","volume":"16","author":"S Lu","year":"2008","unstructured":"Lu, S., Robinson, S.M.: Normal fans of polyhedral convex sets: structures and connections. Set-Valued Anal. 16(2\u20133), 281\u2013305 (2008)","journal-title":"Set-Valued Anal."},{"issue":"1\u20132","key":"26_CR25","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/S0167-6377(98)00054-6","volume":"24","author":"W-K Mak","year":"1999","unstructured":"Mak, W.-K., Morton, D.P., Wood, R.K.: Monte Carlo bounding techniques for determining solution quality in stochastic programs. Oper. Res. Lett. 24(1\u20132), 47\u201356 (1999)","journal-title":"Oper. Res. Lett."},{"key":"26_CR26","doi-asserted-by":"publisher","unstructured":"Mallozzi, L., Morgan, J.: Hierarchical Systems with Weighted Reaction Set, pp. 271\u2013282. Springer, US, Boston, MA, (1996) https:\/\/doi.org\/10.1007\/978-1-4899-0289-4_19","DOI":"10.1007\/978-1-4899-0289-4_19"},{"key":"26_CR27","doi-asserted-by":"crossref","unstructured":"Mu\u00f1oz, G., Salas, D., Svensson, A.: Exploiting the polyhedral geometry of stochastic linear bilevel programming (2023). (preprint - arXiv:2211.02268. Former title: Linear bilevel programming with uncertain lower-level costs)","DOI":"10.1007\/978-3-031-32726-1_26"},{"issue":"3","key":"26_CR28","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF02711510","volume":"16","author":"J Rambau","year":"1996","unstructured":"Rambau, J., Ziegler, G.M.: Projections of polytopes and the generalized baues conjecture. Discrete Comput. Geom. 16(3), 215\u2013237 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"26_CR29","unstructured":"Salas, D., Svensson, A.: Existence of solutions for deterministic bilevel games under a general bayesian approach (2020) (preprint - arXiv:2010.05368)"},{"key":"26_CR30","doi-asserted-by":"crossref","unstructured":"Shapiro, A., Dentcheva, D., Ruszczy\u0144ski, A.: Lectures on stochastic programming\u2013modeling and theory, volume 28 of MOS-SIAM Series on Optimization. 3rd eds Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA; Mathematical Optimization Society, Philadelphia, PA, (2021)","DOI":"10.1137\/1.9781611976595"},{"key":"26_CR31","doi-asserted-by":"publisher","unstructured":"Stackelberg, V.H.: Marktform und Gleichgewitch. Springer (1934) https:\/\/doi.org\/10.1007\/978-3-642-12586-7","DOI":"10.1007\/978-3-642-12586-7"},{"key":"26_CR32","series-title":"Springer Optimization and Its Applications","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/978-3-030-52119-6_19","volume-title":"Bilevel Optimization","author":"S Zhou","year":"2020","unstructured":"Zhou, S., Zemkoho, A.B., Tin, A.: BOLIB: Bilevel Optimization LIBrary of Test Problems. In: Dempe, S., Zemkoho, A. (eds.) Bilevel Optimization. SOIA, vol. 161, pp. 563\u2013580. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52119-6_19"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-32726-1_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,13]],"date-time":"2023-12-13T14:02:59Z","timestamp":1702476179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-32726-1_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031327254","9783031327261"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-32726-1_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Madison, WI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/optimization.discovery.wisc.edu\/ipco-2023-madison\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}