{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:10:54Z","timestamp":1780344654725,"version":"3.54.1"},"publisher-location":"Cham","reference-count":42,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030782290","type":"print"},{"value":"9783030782306","type":"electronic"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-78230-6_19","type":"book-chapter","created":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:06:15Z","timestamp":1623884775000},"page":"299-314","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Between Steps: Intermediate Relaxations Between Big-M and Convex Hull Formulations"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-5745","authenticated-orcid":false,"given":"Jan","family":"Kronqvist","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5612-5417","authenticated-orcid":false,"given":"Ruth","family":"Misener","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2848-2809","authenticated-orcid":false,"given":"Calvin","family":"Tsay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"issue":"1","key":"19_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-020-01474-5","volume":"183","author":"R Anderson","year":"2020","unstructured":"Anderson, R., Huchette, J., Ma, W., Tjandraatmadja, C., Vielma, J.P.: Strong mixed-integer programming formulations for trained neural networks. Math. Program. 183(1), 3\u201339 (2020). https:\/\/doi.org\/10.1007\/s10107-020-01474-5","journal-title":"Math. Program."},{"issue":"3","key":"19_CR2","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/0606047","volume":"6","author":"E Balas","year":"1985","unstructured":"Balas, E.: Disjunctive programming and a hierarchy of relaxations for discrete optimization problems. SIAM J. Algebraic Discrete Methods 6(3), 466\u2013486 (1985)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"6","key":"19_CR3","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0167-6377(88)90058-2","volume":"7","author":"E Balas","year":"1988","unstructured":"Balas, E.: On the convex hull of the union of certain polyhedra. Oper. Res. Lett. 7(6), 279\u2013283 (1988)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"19_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discrete Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discrete Appl. Math."},{"key":"19_CR5","doi-asserted-by":"publisher","unstructured":"Balas, E.: Disjunctive Programming. Springer International Publishing (2018). https:\/\/doi.org\/10.1007\/978-3-030-00148-3","DOI":"10.1007\/978-3-030-00148-3"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Ben-Tal, A., Nemirovski, A.: Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications, vol. 2. Siam (2001)","DOI":"10.1137\/1.9780898718829"},{"issue":"1","key":"19_CR7","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-015-0891-4","volume":"151","author":"P Bonami","year":"2015","unstructured":"Bonami, P., Lodi, A., Tramontani, A., Wiese, S.: On mathematical programming with indicator constraints. Math. Program. 151(1), 191\u2013223 (2015)","journal-title":"Math. Program."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Botoeva, E., Kouvaros, P., Kronqvist, J., Lomuscio, A., Misener, R.: Efficient verification of ReLU-based neural networks via dependency analysis. In: AAAI-20 Proceedings, pp. 3291\u20133299 (2020)","DOI":"10.1609\/aaai.v34i04.5729"},{"issue":"3","key":"19_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s101070050106","volume":"86","author":"S Ceria","year":"1999","unstructured":"Ceria, S., Soares, J.: Convex programming for disjunctive convex optimization. Math. Program. 86(3), 595\u2013614 (1999). https:\/\/doi.org\/10.1007\/s101070050106","journal-title":"Math. Program."},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer programming, volume 271 of graduate texts in mathematics (2014)","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"2","key":"19_CR11","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s10107-007-0101-0","volume":"114","author":"M Conforti","year":"2008","unstructured":"Conforti, M., Wolsey, L.A.: Compact formulations as a union of polyhedra. Math. Program. 114(2), 277\u2013289 (2008). https:\/\/doi.org\/10.1007\/s10107-007-0101-0","journal-title":"Math. Program."},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/s10601-018-9285-6","volume":"23","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Jo, J.: Deep neural networks and mixed integer linear optimization. Constraints 23(3), 296\u2013309 (2018). https:\/\/doi.org\/10.1007\/s10601-018-9285-6","journal-title":"Constraints"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"106580","DOI":"10.1016\/j.compchemeng.2019.106580","volume":"131","author":"B Grimstad","year":"2019","unstructured":"Grimstad, B., Andersson, H.: ReLU networks as surrogate models in mixed-integer linear programs. Comput. Chem. Eng. 131, 106580 (2019)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"19_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1025154322278","volume":"26","author":"IE Grossmann","year":"2003","unstructured":"Grossmann, I.E., Lee, S.: Generalized convex disjunctive programming: nonlinear convex hull relaxation. Comput. Optim. Appl. 26(1), 83\u2013100 (2003). https:\/\/doi.org\/10.1023\/A:1025154322278","journal-title":"Comput. Optim. Appl."},{"issue":"1\u20132","key":"19_CR15","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s10107-010-0360-z","volume":"124","author":"O G\u00fcnl\u00fck","year":"2010","unstructured":"G\u00fcnl\u00fck, O., Linderoth, J.: Perspective reformulations of mixed integer nonlinear programs with indicator variables. Math. Program. 124(1\u20132), 183\u2013205 (2010)","journal-title":"Math. Program."},{"issue":"2","key":"19_CR16","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/07070526X","volume":"20","author":"JW Helton","year":"2009","unstructured":"Helton, J.W., Nie, J.: Sufficient and necessary conditions for semidefinite representability of convex hulls and sets. SIAM J. Optim 20(2), 759\u2013791 (2009)","journal-title":"SIAM J. Optim"},{"issue":"2","key":"19_CR17","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1007\/s10589-011-9424-0","volume":"52","author":"H Hijazi","year":"2012","unstructured":"Hijazi, H., Bonami, P., Cornu\u00e9jols, G., Ouorou, A.: Mixed-integer nonlinear programs featuring \u201con\/off\u201d constraints. Comput. Optim. Appl. 52(2), 537\u2013558 (2012). https:\/\/doi.org\/10.1007\/s10589-011-9424-0","journal-title":"Comput. Optim. Appl."},{"issue":"4","key":"19_CR18","doi-asserted-by":"publisher","first-page":"519","DOI":"10.1007\/s11036-005-1564-y","volume":"10","author":"CF Huang","year":"2005","unstructured":"Huang, C.F., Tseng, Y.C.: The coverage problem in a wireless sensor network. Mob. Netw. Appl. 10(4), 519\u2013528 (2005)","journal-title":"Mob. Netw. Appl."},{"issue":"1","key":"19_CR19","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/0377-2217(88)90013-6","volume":"36","author":"RG Jeroslow","year":"1988","unstructured":"Jeroslow, R.G.: A simplification for some disjunctive formulations. Eur. J. Oper. Res. 36(1), 116\u2013121 (1988)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0121015","volume-title":"Mathematical Programming at Oberwolfach II","author":"RG Jeroslow","year":"1984","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modelling with integer variables. In: Korte, B., Ritter, K. (eds.) Mathematical Programming at Oberwolfach II, pp. 167\u2013184. Springer, Berlin (1984). https:\/\/doi.org\/10.1007\/BFb0121015"},{"key":"19_CR21","doi-asserted-by":"publisher","unstructured":"Kronqvist, J., Misener, R.: A disjunctive cut strengthening technique for convex MINLP. Optim. Eng. 1\u201331 (2020). https:\/\/doi.org\/10.1007\/s11081-020-09551-6","DOI":"10.1007\/s11081-020-09551-6"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/3-540-45535-3_23","volume-title":"Integer Programming and Combinatorial Optimization","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: An explicit exact SDP relaxation for nonlinear 0-1 programs. In: Aardal, K., Gerards, B. (eds.) IPCO 2001. LNCS, vol. 2081, pp. 293\u2013303. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45535-3_23"},{"key":"19_CR23","unstructured":"LeCun, Y., Cortes, C., Burges, C.: Mnist handwritten digit database. ATT Labs (2010). http:\/\/yann.lecun.com\/exdb\/mnist2"},{"issue":"14","key":"19_CR24","doi-asserted-by":"publisher","first-page":"1515","DOI":"10.1287\/mnsc.24.14.1515","volume":"24","author":"J Liittschwager","year":"1978","unstructured":"Liittschwager, J., Wang, C.: Integer programming solution of a classification problem. Manage. Sci. 24(14), 1515\u20131525 (1978)","journal-title":"Manage. Sci."},{"issue":"2","key":"19_CR25","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1137\/0801013","volume":"1","author":"L Lov\u00e1sz","year":"1991","unstructured":"Lov\u00e1sz, L., Schrijver, A.: Cones of matrices and set-functions and 0\u20131 optimization. SIAM J. Optim. 1(2), 166\u2013190 (1991)","journal-title":"SIAM J. Optim."},{"key":"19_CR26","unstructured":"MacQueen, J., et al.: Some methods for classification and analysis of multivariate observations. In: Proceedings of the fifth Berkeley symposium on mathematical statistics and probability. vol. 1, pp. 281\u2013297. Oakland, CA, USA (1967)"},{"key":"19_CR27","first-page":"207","volume":"10029","author":"PFR Mariescu-Istodor","year":"2016","unstructured":"Mariescu-Istodor, P.F.R., Zhong, C.: XNN graph LNCS 10029, 207\u2013217 (2016)","journal-title":"XNN graph LNCS"},{"issue":"1","key":"19_CR28","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s13675-017-0088-0","volume":"6","author":"DJ Papageorgiou","year":"2018","unstructured":"Papageorgiou, D.J., Trespalacios, F.: Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming. EURO J. Comput. Optim. 6(1), 55\u201383 (2018)","journal-title":"EURO J. Comput. Optim."},{"key":"19_CR29","unstructured":"Paszke, A., et al.: Pytorch: An imperative style, high-performance deep learning library. In: Advances in Neural Information Processing Systems, pp. 8026\u20138037 (2019)"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1018990909155","volume":"74","author":"PA Rubin","year":"1997","unstructured":"Rubin, P.A.: Solving mixed integer classification problems by decomposition. Ann. Oper. Res. 74, 51\u201364 (1997). https:\/\/doi.org\/10.1023\/A:1018990909155","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1016\/j.ejor.2011.10.002","volume":"218","author":"JP Ruiz","year":"2012","unstructured":"Ruiz, J.P., Grossmann, I.E.: A hierarchy of relaxations for nonlinear convex generalized disjunctive programming. Eur. J. Oper. Res. 218(1), 38\u201347 (2012)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"19_CR32","doi-asserted-by":"publisher","first-page":"866","DOI":"10.1016\/j.ejor.2005.04.048","volume":"173","author":"B Sa\u011flam","year":"2006","unstructured":"Sa\u011flam, B., Salman, F.S., Say\u0131n, S., T\u00fcrkay, M.: A mixed-integer programming approach to the clustering problem with an application in customer segmentation. Eur. J. Oper. Res. 173(3), 866\u2013879 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"7","key":"19_CR33","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.compchemeng.2006.08.002","volume":"31","author":"NW Sawaya","year":"2007","unstructured":"Sawaya, N.W., Grossmann, I.E.: Computational implementation of non-linear convex hull reformulation. Comput. Chem. Eng. 31(7), 856\u2013866 (2007)","journal-title":"Comput. Chem. Eng."},{"key":"19_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-030-58942-4_27","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"T Serra","year":"2020","unstructured":"Serra, T., Kumar, A., Ramalingam, S.: Lossless compression of deep neural networks. In: Hebrard, E., Musliu, N. (eds.) CPAIOR 2020. LNCS, vol. 12296, pp. 417\u2013430. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58942-4_27"},{"issue":"3","key":"19_CR35","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Discrete Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Discrete Math."},{"issue":"3","key":"19_CR36","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/s101070050103","volume":"86","author":"RA Stubbs","year":"1999","unstructured":"Stubbs, R.A., Mehrotra, S.: A branch-and-cut method for 0\u20131 mixed convex programming. Math. Program. 86(3), 515\u2013532 (1999)","journal-title":"Math. Program."},{"issue":"1","key":"19_CR37","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1287\/ijoc.2014.0610","volume":"27","author":"F Trespalacios","year":"2015","unstructured":"Trespalacios, F., Grossmann, I.E.: Algorithmic approach for improved mixed-integer reformulations of convex generalized disjunctive programs. INFORMS J. Comput. 27(1), 59\u201374 (2015)","journal-title":"INFORMS J. Comput."},{"key":"19_CR38","unstructured":"Tsay, C., Kronqvist, J., Thebelt, A., Misener, R.: Partition-based formulations for mixed-integer optimization of trained relu neural networks. arXiv preprint arXiv:2102.04373 (2021)"},{"issue":"1","key":"19_CR39","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. SIAM Rev. 57(1), 3\u201357 (2015)","journal-title":"SIAM Rev."},{"issue":"1\u20132","key":"19_CR40","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10107-018-1258-4","volume":"177","author":"JP Vielma","year":"2019","unstructured":"Vielma, J.P.: Small and strong formulations for unions of convex sets from the cayley embedding. Math. Program. 177(1\u20132), 21\u201353 (2019)","journal-title":"Math. Program."},{"issue":"2","key":"19_CR41","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"1\u20132","key":"19_CR42","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1\u20132), 49\u201372 (2011)","journal-title":"Math. Program."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-78230-6_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,16]],"date-time":"2021-06-16T23:13:54Z","timestamp":1623885234000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-78230-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030782290","9783030782306"],"references-count":42,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-78230-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 June 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vienna","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 July 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cpaior2021.dbai.tuwien.ac.at\/","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":"75","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":"30","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":"40% - 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":"6","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held online.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}