{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T08:58:49Z","timestamp":1765357129266,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031069000"},{"type":"electronic","value":"9783031069017"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-06901-7_20","type":"book-chapter","created":{"date-parts":[[2022,5,27]],"date-time":"2022-05-27T00:22:30Z","timestamp":1653610950000},"page":"262-276","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["SOCP-Based Disjunctive Cuts for\u00a0a\u00a0Class of\u00a0Integer Nonlinear Bilevel Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1643-6066","authenticated-orcid":false,"given":"Elisabeth","family":"Gaar","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8190-1091","authenticated-orcid":false,"given":"Jon","family":"Lee","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4834-6284","authenticated-orcid":false,"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1439-8702","authenticated-orcid":false,"given":"Markus","family":"Sinnl","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1081-4182","authenticated-orcid":false,"given":"K\u00fcbra","family":"Tan\u0131nm\u0131\u015f","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,27]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1016\/j.cor.2018.05.005","volume":"106","author":"J Agor","year":"2019","unstructured":"Agor, J., \u00d6zalt\u0131n, O.Y.: Feature selection for classification models via bilevel optimization. Comput. Oper. Res. 106, 156\u2013168 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11590-006-0024-3","volume":"1","author":"C Audet","year":"2007","unstructured":"Audet, C., Haddad, J., Savard, G.: Disjunctive cuts for continuous linear bilevel programming. Optim. Lett. 1(3), 259\u2013267 (2007). https:\/\/doi.org\/10.1007\/s11590-006-0024-3","journal-title":"Optim. Lett."},{"key":"20_CR3","doi-asserted-by":"crossref","unstructured":"Balas, E.: Disjunctive programming. In: Hammer, P.L., Johnson, E.L., Korte, B.H. (eds.) Annals of Discrete Mathematics 5: Discrete Optimization, pp. 3\u201351. North Holland (1979)","DOI":"10.1016\/S0167-5060(08)70342-X"},{"key":"20_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-00148-3","volume-title":"Disjunctive Programming","author":"E Balas","year":"2018","unstructured":"Balas, E.: Disjunctive Programming. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00148-3"},{"key":"20_CR5","first-page":"1441","volume-title":"Wiley Encyclopedia of Operations Research and Management Science","author":"P Belotti","year":"2011","unstructured":"Belotti, P., Liberti, L., Lodi, A., Nannicini, G., Tramontani, A., et al.: Disjunctive inequalities: applications and extensions. In: Cochran, J.J., Cox, L.A., Keskinocak, P., Kharoufeh, J.P., Smith, J.C. (eds.) Wiley Encyclopedia of Operations Research and Management Science, vol. 2, pp. 1441\u20131450. Wiley, Hoboken (2011)"},{"issue":"3","key":"20_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1016\/j.orl.2009.01.007","volume":"37","author":"L Brotcorne","year":"2009","unstructured":"Brotcorne, L., Hanafi, S., Mansi, R.: A dynamic programming algorithm for the bilevel knapsack problem. Oper. Res. Lett. 37(3), 215\u2013218 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"20_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.disopt.2012.09.001","volume":"10","author":"L Brotcorne","year":"2013","unstructured":"Brotcorne, L., Hanafi, S., Mansi, R.: One-level reformulation of the bilevel knapsack problem using dynamic programming. Discrete Optim. 10(1), 1\u201310 (2013)","journal-title":"Discrete Optim."},{"key":"20_CR8","doi-asserted-by":"crossref","unstructured":"Byeon, G., Van Hentenryck, P.: Benders subproblem decomposition for bilevel problems with convex follower. INFORMS J. Comput. (2022)","DOI":"10.1287\/ijoc.2021.1128"},{"key":"20_CR9","unstructured":"Cerulli, M.: Bilevel optimization and applications. Ph.D. Thesis. \u00c9cole Polytechnique, Paris (2021)"},{"key":"20_CR10","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.): Bilevel Optimization. SOIA, vol. 161. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52119-6"},{"key":"20_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-319-33461-5_7","volume-title":"Integer Programming and Combinatorial Optimization","author":"M Fischetti","year":"2016","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: Intersection cuts for bilevel optimization. In: Louveaux, Q., Skutella, M. (eds.) IPCO 2016. LNCS, vol. 9682, pp. 77\u201388. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33461-5_7"},{"issue":"6","key":"20_CR12","doi-asserted-by":"publisher","first-page":"1615","DOI":"10.1287\/opre.2017.1650","volume":"65","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: A new general-purpose algorithm for mixed-integer bilevel linear programs. Oper. Res. 65(6), 1615\u20131637 (2017)","journal-title":"Oper. Res."},{"issue":"1","key":"20_CR13","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10107-017-1189-5","volume":"172","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Ljubi\u0107, I., Monaci, M., Sinnl, M.: On the use of intersection cuts for bilevel optimization. Math. Program. 172(1), 77\u2013103 (2018). https:\/\/doi.org\/10.1007\/s10107-017-1189-5","journal-title":"Math. Program."},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/s10107-009-0300-y","volume":"128","author":"M Fischetti","year":"2011","unstructured":"Fischetti, M., Lodi, A., Tramontani, A.: On the separation of disjunctive cuts. Math. Program. 128(1), 205\u2013230 (2011). https:\/\/doi.org\/10.1007\/s10107-009-0300-y","journal-title":"Math. Program."},{"issue":"1","key":"20_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.ejor.2019.12.028","volume":"284","author":"P Fontaine","year":"2020","unstructured":"Fontaine, P., Crainic, T.G., Gendreau, M., Minner, S.: Population-based risk equilibration for the multimode hazmat transport network design problem. Eur. J. Oper. Res. 284(1), 188\u2013200 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102353","volume":"102","author":"J Gonz\u00e1lez-D\u00edaz","year":"2021","unstructured":"Gonz\u00e1lez-D\u00edaz, J., Gonz\u00e1lez-Rodr\u00edguez, B., Leal, M., Puerto, J.: Global optimization for bilevel portfolio design: economic insights from the Dow Jones index. Omega 102, 102353 (2021)","journal-title":"Omega"},{"key":"20_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.omega.2020.102327","volume":"102","author":"V Grimm","year":"2021","unstructured":"Grimm, V., Orlinskaya, G., Schewe, L., Schmidt, M., Z\u00f6ttl, G.: Optimal design of retailer-prosumer electricity tariffs using bilevel optimization. Omega 102, 102327 (2021)","journal-title":"Omega"},{"issue":"1","key":"20_CR18","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10898-006-9001-8","volume":"36","author":"JJ J\u00fadice","year":"2006","unstructured":"J\u00fadice, J.J., Sherali, H.D., Ribeiro, I.M., Faustino, A.M.: A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints. J. Global Optim. 36(1), 89\u2013114 (2006). https:\/\/doi.org\/10.1007\/s10898-006-9001-8","journal-title":"J. Global Optim."},{"key":"20_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/978-3-319-07557-0_29","volume-title":"Integer Programming and Combinatorial Optimization","author":"F K\u0131l\u0131n\u00e7-Karzan","year":"2014","unstructured":"K\u0131l\u0131n\u00e7-Karzan, F., Y\u0131ld\u0131z, S.: Two-term disjunctions on the second-order cone. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 345\u2013356. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07557-0_29"},{"issue":"2","key":"20_CR20","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s10107-020-01601-2","volume":"188","author":"T Kleinert","year":"2021","unstructured":"Kleinert, T., Grimm, V., Schmidt, M.: Outer approximation for global optimization of mixed-integer quadratic bilevel problems. Math. Program. 188(2), 461\u2013521 (2021). https:\/\/doi.org\/10.1007\/s10107-020-01601-2","journal-title":"Math. Program."},{"key":"20_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."},{"issue":"3","key":"20_CR22","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10898-013-0121-7","volume":"60","author":"PM Kleniati","year":"2014","unstructured":"Kleniati, P.M., Adjiman, C.S.: Branch and sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part II: convergence analysis and numerical results. J. Global Optim. 60(3), 459\u2013481 (2014). https:\/\/doi.org\/10.1007\/s10898-013-0121-7","journal-title":"J. Global Optim."},{"key":"20_CR23","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/j.compchemeng.2014.06.004","volume":"72","author":"PM Kleniati","year":"2015","unstructured":"Kleniati, P.M., Adjiman, C.S.: A generalization of the branch-and-sandwich algorithm: from continuous to mixed-integer nonlinear bilevel problems. Comput. Chem. Eng. 72, 373\u2013386 (2015)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"20_CR24","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/s10898-013-0121-7","volume":"60","author":"PM Kleniati","year":"2014","unstructured":"Kleniati, P.M., Adjiman, C.S.: Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. Part I: theoretical development. J. Global Optim. 60(3), 425\u2013458 (2014). https:\/\/doi.org\/10.1007\/s10898-013-0121-7","journal-title":"J. Global Optim."},{"issue":"1","key":"20_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/s10479-015-2016-0","volume":"240","author":"M Labb\u00e9","year":"2015","unstructured":"Labb\u00e9, M., Violin, A.: Bilevel programming and price setting problems. Ann. Oper. Res. 240(1), 141\u2013169 (2015). https:\/\/doi.org\/10.1007\/s10479-015-2016-0","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"20_CR26","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1007\/s10107-013-0700-x","volume":"146","author":"A Lodi","year":"2014","unstructured":"Lodi, A., Ralphs, T.K., Woeginger, G.J.: Bilevel programming and the separation problem. Math. Program. 146(1), 437\u2013458 (2014). https:\/\/doi.org\/10.1007\/s10107-013-0700-x","journal-title":"Math. Program."},{"issue":"3","key":"20_CR27","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/BF00121269","volume":"8","author":"P Loridan","year":"1996","unstructured":"Loridan, P., Morgan, J.: Weak via strong stackelberg problem: new results. J. Global Optim. 8(3), 263\u2013287 (1996). https:\/\/doi.org\/10.1007\/BF00121269","journal-title":"J. Global Optim."},{"issue":"3","key":"20_CR28","doi-asserted-by":"publisher","first-page":"768","DOI":"10.1287\/opre.2017.1589","volume":"65","author":"L Lozano","year":"2017","unstructured":"Lozano, L., Smith, J.C.: A value-function-based exact approach for the bilevel mixed-integer programming problem. Oper. Res. 65(3), 768\u2013786 (2017)","journal-title":"Oper. Res."},{"issue":"4","key":"20_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/s10898-007-9260-z","volume":"42","author":"A Mitsos","year":"2008","unstructured":"Mitsos, A., Lemonidis, P., Barton, P.I.: Global solution of bilevel programs with a nonconvex inner program. J. Global Optim. 42(4), 475\u2013513 (2008). https:\/\/doi.org\/10.1007\/s10898-007-9260-z","journal-title":"J. Global Optim."},{"key":"20_CR30","unstructured":"MOSEK ApS: MOSEK Fusion API for C++ manual. Version 9.2. (2021). http:\/\/docs.mosek.com\/9.2\/toolbox\/index.html"},{"key":"20_CR31","doi-asserted-by":"publisher","unstructured":"Plein, F., Th\u00fcrauf, J., Labb\u00e9, M., Schmidt, M.: Bilevel optimization approaches to decide the feasibility of bookings in the European gas market. Math. Method. Oper. Res. (2021). https:\/\/doi.org\/10.1007\/s00186-021-00752-y","DOI":"10.1007\/s00186-021-00752-y"},{"key":"20_CR32","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10107-010-0371-9","volume":"124","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: extended formulations. Math. Program. 124, 383\u2013411 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0371-9","journal-title":"Math. Program."},{"key":"20_CR33","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","volume":"130","author":"A Saxena","year":"2010","unstructured":"Saxena, A., Bonami, P., Lee, J.: Convex relaxations of non-convex mixed integer quadratically constrained programs: projected formulations. Math. Program. 130, 359\u2013413 (2010). https:\/\/doi.org\/10.1007\/s10107-010-0340-3","journal-title":"Math. Program."},{"issue":"3","key":"20_CR34","doi-asserted-by":"publisher","first-page":"797","DOI":"10.1016\/j.ejor.2019.06.024","volume":"283","author":"JC Smith","year":"2020","unstructured":"Smith, J.C., Song, Y.: A survey of network interdiction models and algorithms. Eur. J. Oper. Res. 283(3), 797\u2013811 (2020)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"20_CR35","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/s12532-020-00183-6","volume":"12","author":"S Tahernejad","year":"2020","unstructured":"Tahernejad, S., Ralphs, T.K., DeNegre, S.T.: A branch-and-cut algorithm for mixed integer bilevel linear optimization problems and its implementation. Math. Program. Comput. 12(4), 529\u2013568 (2020). https:\/\/doi.org\/10.1007\/s12532-020-00183-6","journal-title":"Math. Program. Comput."},{"issue":"3","key":"20_CR36","doi-asserted-by":"publisher","first-page":"1403","DOI":"10.1137\/15M1051592","volume":"27","author":"L Wang","year":"2017","unstructured":"Wang, L., Xu, P.: The watermelon algorithm for the bilevel integer linear programming problem. SIAM J. Optimiz. 27(3), 1403\u20131430 (2017)","journal-title":"SIAM J. Optimiz."},{"key":"20_CR37","unstructured":"Weninger, D., Orlinskaya, G., Merkert, M.: An exact projection-based algorithm for bilevel mixed-integer problems with nonlinearities (2020). http:\/\/www.optimization-online.org\/DB_HTML\/2020\/12\/8153.html"},{"key":"20_CR38","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/j.cor.2013.07.016","volume":"41","author":"P Xu","year":"2014","unstructured":"Xu, P., Wang, L.: An exact algorithm for the bilevel mixed integer linear programming problem under three simplifying assumptions. Comput. Oper. Res. 41, 309\u2013318 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"20_CR39","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10898-018-0679-1","volume":"73","author":"D Yue","year":"2018","unstructured":"Yue, D., Gao, J., Zeng, B., You, F.: A projection-based reformulation and decomposition algorithm for global optimization of a class of mixed integer bilevel linear programs. J. Global Optim. 73(1), 27\u201357 (2018). https:\/\/doi.org\/10.1007\/s10898-018-0679-1","journal-title":"J. Global Optim."},{"issue":"1","key":"20_CR40","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s10479-018-2970-4","volume":"298","author":"GL Zenarosa","year":"2021","unstructured":"Zenarosa, G.L., Prokopyev, O.A., Pasiliao, E.L.: On exact solution approaches for bilevel quadratic 0\u20131 knapsack problem. Ann. Oper. Res. 298(1), 555\u2013572 (2021). https:\/\/doi.org\/10.1007\/s10479-018-2970-4","journal-title":"Ann. Oper. Res."}],"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-06901-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T23:04:10Z","timestamp":1653951850000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-06901-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031069000","9783031069017"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-06901-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"27 May 2022","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":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.ipco2022.com\/home","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":"93","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":"35% - 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":"33","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)"}}]}}