{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:39:34Z","timestamp":1743017974967,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031606014"},{"type":"electronic","value":"9783031605994"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-60599-4_4","type":"book-chapter","created":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:09Z","timestamp":1716800529000},"page":"56-73","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probabilistic Lookahead Strong Branching via\u00a0a\u00a0Stochastic Abstract Branching Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0964-9802","authenticated-orcid":false,"given":"Gioni","family":"Mexi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0726-7173","authenticated-orcid":false,"given":"Somayeh","family":"Shamsi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6284-3033","authenticated-orcid":false,"given":"Mathieu","family":"Besan\u00e7on","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0842-9533","authenticated-orcid":false,"given":"Pierre","family":"Le Bodic","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,25]]},"reference":[{"key":"4_CR1","unstructured":"Achterberg, T.: Constraint integer programming. Ph.D. thesis, Technische Universitat Berlin (2007)"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-642-01929-6_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T., Berthold, T.: Hybrid branching. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 309\u2013311. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_23"},{"issue":"1","key":"4_CR3","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., Martin, A.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20132","key":"4_CR4","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10107-020-01556-4","volume":"190","author":"D Anderson","year":"2021","unstructured":"Anderson, D., Le Bodic, P., Morgan, K.: Further results on an abstract model for branching and its application to mixed integer programming. Math. Program. 190(1\u20132), 811\u2013841 (2021)","journal-title":"Math. Program."},{"key":"4_CR5","unstructured":"Applegate, D., Bixby, R., Cook, W., Chv\u00e1tal, V.: On the solution of traveling salesman problems (1998)"},{"key":"4_CR6","unstructured":"Bartoszy\u0144ski, R., Govindarajulu, Z.: The secretary problem with interview cost. Sankhy\u0101: Indian J. Stat. Ser. B 11\u201328 (1978)"},{"key":"4_CR7","doi-asserted-by":"publisher","unstructured":"Besancon, M., et al.: Distributions.jl: definition and modeling of probability distributions in the JuliaStats ecosystem. J. Stat. Softw. 98(16), 1-30 (2021). https:\/\/doi.org\/10.18637\/jss.v098.i16","DOI":"10.18637\/jss.v098.i16"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3585516","volume":"49","author":"K Bestuzheva","year":"2023","unstructured":"Bestuzheva, K., et al.: Enabling research through the SCIP optimization suite 8.0. ACM Trans. Math. Softw. 49(2), 1\u201321 (2023)","journal-title":"ACM Trans. Math. Softw."},{"key":"4_CR9","unstructured":"Beyhaghi, H., Cai, L.: Pandora\u2019s problem with nonobligatory inspection: optimal structure and a PTAS"},{"issue":"1","key":"4_CR10","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"MR Bussieck","year":"2003","unstructured":"Bussieck, M.R., Drud, A.S., Meeraus, A.: MINLPLib\u2019a collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"key":"4_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming Models","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming Models. Springer, Cham (2014)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Dey, S.S., Dubey, Y., Molinaro, M., Shah, P.: A theoretical and computational analysis of full strong-branching. Math. Program. 1\u201334 (2023)","DOI":"10.1007\/s10107-023-01977-x"},{"key":"4_CR13","unstructured":"Gamrath, G., et\u00a0al.: The SCIP optimization suite 7.0 (2020)"},{"issue":"3\u20134","key":"4_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s13675-020-00130-z","volume":"8","author":"G Gamrath","year":"2020","unstructured":"Gamrath, G., Berthold, T., Salvagnin, D.: An exploratory computational analysis of dual degeneracy in mixed-integer programming. EURO J. Comput. Optim. 8(3\u20134), 241\u2013261 (2020)","journal-title":"EURO J. Comput. Optim."},{"issue":"3","key":"4_CR15","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1214\/aop\/1176996090","volume":"4","author":"J Gianini","year":"1976","unstructured":"Gianini, J., Samuels, S.M.: The infinite secretary problem. Ann. Probab. 4(3), 418\u2013432 (1976)","journal-title":"Ann. Probab."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021)","journal-title":"Math. Program. Comput."},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/978-3-319-18008-3_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"G Hendel","year":"2015","unstructured":"Hendel, G.: Enhancing MIP branching decisions by using the sample variance of pseudo costs. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 199\u2013214. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_14"},{"key":"4_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejco.2022.100031","volume":"10","author":"T Koch","year":"2022","unstructured":"Koch, T., Berthold, T., Pedersen, J., Vanaret, C.: Progress in mathematical programming solvers from 2001 to 2020. EURO J. Comput. Optim. 10, 100031 (2022)","journal-title":"EURO J. Comput. Optim."},{"issue":"1\u20132","key":"4_CR19","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/s10107-016-1101-8","volume":"166","author":"P Le Bodic","year":"2017","unstructured":"Le Bodic, P., Nemhauser, G.: An abstract model for branching and its application to mixed integer programming. Math. Program. 166(1\u20132), 369\u2013405 (2017)","journal-title":"Math. Program."},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Lodi, A., Tramontani, A.: Performance variability in mixed-integer programming. In: Theory Driven by Influential Applications, pp. 1\u201312. INFORMS (2013)","DOI":"10.1287\/educ.2013.0112"},{"key":"4_CR21","unstructured":"Turner, M., Berthold, T., Besan\u00e7on, M., Koch, T.: Branching via cutting plane selection: improving hybrid branching. arXiv preprint arXiv:2306.06050 (2023)"},{"key":"4_CR22","unstructured":"Vigerske, S.: MINLPLib: a library of mixed-integer and continuous nonlinear programming instances (2018). https:\/\/www.minlplib.org. Accessed Dec 2023"},{"issue":"3","key":"4_CR23","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1080\/10556788.2017.1335312","volume":"33","author":"S Vigerske","year":"2018","unstructured":"Vigerske, S., Gleixner, A.: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework. Optim. Methods Softw. 33(3), 563\u2013593 (2018)","journal-title":"Optim. Methods Softw."},{"key":"4_CR24","doi-asserted-by":"crossref","unstructured":"Weitzman, M.: Optimal Search for the Best Alternative, vol. 78. Department of Energy (1978)","DOI":"10.2172\/6795538"}],"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-031-60599-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,27]],"date-time":"2024-05-27T09:02:27Z","timestamp":1716800547000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-60599-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031606014","9783031605994"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-60599-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"25 May 2024","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 the Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Uppsala","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sweden","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2024","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}