{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:50:37Z","timestamp":1761648637373,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-19212-9_18","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"275-291","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Learning MILP Resolution Outcomes Before Reaching Time-Limit"],"prefix":"10.1007","author":[{"given":"Martina","family":"Fischetti","sequence":"first","affiliation":[]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[]},{"given":"Giulia","family":"Zarpellon","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-29210-1_12","volume-title":"Operations Research Proceedings 2011","author":"T Achterberg","year":"2012","unstructured":"Achterberg, T., Berthold, T., Hendel, G.: Rounding and propagation heuristics for mixed integer programming. In: Klatte, D., L\u00fcthi, H.J., Schmedders, K. (eds.) Operations Research Proceedings 2011, pp. 71\u201376. Springer, Heidelberg (2012). \n                    https:\/\/doi.org\/10.1007\/978-3-642-29210-1_12"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"449","DOI":"10.1007\/978-3-642-38189-8_18","volume-title":"Facets of Combinatorial Optimization","author":"T Achterberg","year":"2013","unstructured":"Achterberg, T., Wunderling, R.: Mixed integer programming: analyzing 12 years of progress. In: J\u00fcnger, M., Reinelt, G. (eds.) Facets of Combinatorial Optimization, pp. 449\u2013481. Springer, Heidelberg (2013). \n                    https:\/\/doi.org\/10.1007\/978-3-642-38189-8_18"},{"key":"18_CR3","doi-asserted-by":"publisher","unstructured":"Belov, G., Esler, S., Fernando, D., Bodic, P.L., Nemhauser, G.L.: Estimating the size of search trees by sampling with domain knowledge. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, pp. 473\u2013479 (2017). \n                    https:\/\/doi.org\/10.24963\/ijcai.2017\/67","DOI":"10.24963\/ijcai.2017\/67"},{"key":"18_CR4","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon (2018). Preprint: \n                    arXiv:1811.06128"},{"issue":"3","key":"18_CR5","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1080\/10556788.2017.1392519","volume":"33","author":"T Berthold","year":"2017","unstructured":"Berthold, T., Hendel, G., Koch, T.: From feasibility to improvement to proof: three phases of solving mixed-integer programs. Optim. Methods Softw. 33(3), 499\u2013517 (2017). \n                    https:\/\/doi.org\/10.1080\/10556788.2017.1392519","journal-title":"Optim. Methods Softw."},{"key":"18_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-319-93031-2_43","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"P Bonami","year":"2018","unstructured":"Bonami, P., Lodi, A., Zarpellon, G.: Learning a classification of mixed-integer quadratic programming problems. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 595\u2013604. Springer, Cham (2018). \n                    https:\/\/doi.org\/10.1007\/978-3-319-93031-2_43"},{"issue":"1","key":"18_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001). \n                    https:\/\/doi.org\/10.1023\/A:1010933404324","journal-title":"Mach. Learn."},{"issue":"1","key":"18_CR8","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/ijoc.1040.0107","volume":"18","author":"G Cornu\u00e9jols","year":"2006","unstructured":"Cornu\u00e9jols, G., Karamanov, M., Li, Y.: Early estimates of the size of branch-and-bound trees. INFORMS J. Comput. 18(1), 86\u201396 (2006). \n                    https:\/\/doi.org\/10.1287\/ijoc.1040.0107","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1023\/A:1022627411411","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995). \n                    https:\/\/doi.org\/10.1023\/A:1022627411411","journal-title":"Mach. Learn."},{"key":"18_CR10","unstructured":"CPLEX. \n                    http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/index.html\n                    \n                  . Accessed 2018"},{"key":"18_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-47887-6_41","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"M Deshpande","year":"2002","unstructured":"Deshpande, M., Karypis, G.: Evaluation of techniques for classifying biological sequences. In: Chen, M.-S., Yu, P.S., Liu, B. (eds.) PAKDD 2002. LNCS (LNAI), vol. 2336, pp. 417\u2013431. Springer, Heidelberg (2002). \n                    https:\/\/doi.org\/10.1007\/3-540-47887-6_41"},{"key":"18_CR12","series-title":"Springer Proceedings in Mathematics & Statistics","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/978-3-319-67308-0_21","volume-title":"Optimization and Decision Science: Methodologies and Applications","author":"M Fischetti","year":"2017","unstructured":"Fischetti, M., Fraccaro, M.: Using OR + AI to predict the optimal production of offshore wind parks: a preliminary study. In: Sforza, A., Sterle, C. (eds.) Optimization and Decision Science: Methodologies and Applications. Springer Proceedings in Mathematics & Statistics, vol. 217, pp. 203\u2013211. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-67308-0_21"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10994-006-6226-1","volume":"63","author":"P Geurts","year":"2006","unstructured":"Geurts, P., Ernst, D., Wehenkel, L.: Extremely randomized trees. Mach. Learn. 63(1), 3\u201342 (2006). \n                    https:\/\/doi.org\/10.1007\/s10994-006-6226-1","journal-title":"Mach. Learn."},{"key":"18_CR14","unstructured":"Gomory, R.: An algorithm for the mixed integer problem. Technical report RM-2597, The Rand Corporation (1960)"},{"key":"18_CR15","volume-title":"Deep Learning","author":"I Goodfellow","year":"2016","unstructured":"Goodfellow, I., Bengio, Y., Courville, A.: Deep Learning. MIT Press, Cambridge (2016). \n                    http:\/\/www.deeplearningbook.org"},{"key":"18_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-642-13520-0_23","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"F Hutter","year":"2010","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol. 6140, pp. 186\u2013202. Springer, Heidelberg (2010). \n                    https:\/\/doi.org\/10.1007\/978-3-642-13520-0_23"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014). \n                    https:\/\/doi.org\/10.1016\/j.artint.2013.10.003","journal-title":"Artif. Intell."},{"key":"18_CR18","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Nemhauser, G., Ahmed, S., Shao, Y.: Learning to run heuristics in tree search. In: 26th International Joint Conference on Artificial Intelligence (IJCAI) (2017)","DOI":"10.24963\/ijcai.2017\/92"},{"issue":"1","key":"18_CR19","first-page":"18","volume":"18","author":"E Klotz","year":"2013","unstructured":"Klotz, E., Newman, A.M.: Practical guidelines for solving difficult mixed integer linear programs. Surv. Oper. Res. Manag. Sci. 18(1), 18\u201332 (2013)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"129","key":"18_CR20","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1090\/S0025-5718-1975-0373371-6","volume":"29","author":"DE Knuth","year":"1975","unstructured":"Knuth, D.E.: Estimating the efficiency of backtrack programs. Math. Comput. 29(129), 122\u2013136 (1975)","journal-title":"Math. Comput."},{"issue":"2","key":"18_CR21","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., et al.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011). \n                    https:\/\/doi.org\/10.1007\/s12532-011-0025-9","journal-title":"Math. Program. Comput."},{"key":"18_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/978-3-319-59776-8_16","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Kruber","year":"2017","unstructured":"Kruber, M., L\u00fcbbecke, M.E., Parmentier, A.: Learning when to use a decomposition. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 202\u2013210. Springer, Cham (2017). \n                    https:\/\/doi.org\/10.1007\/978-3-319-59776-8_16"},{"key":"18_CR23","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"A Land","year":"1960","unstructured":"Land, A., Doig, A.: An automatic method of solving discrete programming problems. Econometrica 28, 497\u2013520 (1960)","journal-title":"Econometrica"},{"issue":"3","key":"18_CR24","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1145\/322510.322526","volume":"2","author":"T Lane","year":"1999","unstructured":"Lane, T., Brodley, C.E.: Temporal sequence learning and data reduction for anomaly detection. ACM Trans. Inf. Syst. Secur. 2(3), 295\u2013331 (1999). \n                    https:\/\/doi.org\/10.1145\/322510.322526","journal-title":"ACM Trans. Inf. Syst. Secur."},{"key":"18_CR25","unstructured":"Larsen, E., Lachapelle, S., Bengio, Y., Frejinger, E., Lacoste-Julien, S., Lodi, A.: Predicting solution summaries to integer linear programs under imperfect information with machine learning (2018). Preprint: \n                    arXiv:1807.11876"},{"key":"18_CR26","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/978-3-540-68279-0_16","volume-title":"50 Years of Integer Programming 1958\u20132008","author":"A Lodi","year":"2009","unstructured":"Lodi, A.: Mixed integer programming computation. In: J\u00fcnger, M., et al. (eds.) 50 Years of Integer Programming 1958\u20132008, pp. 619\u2013645. Springer, Heidelberg (2009). \n                    https:\/\/doi.org\/10.1007\/978-3-540-68279-0_16"},{"key":"18_CR27","doi-asserted-by":"publisher","unstructured":"Lodi, A., Tramontani, A.: Performance variability in mixed-integer programming, Chap. 1, pp. 1\u201312. INFORMS (2013). \n                    https:\/\/doi.org\/10.1287\/educ.2013.0112","DOI":"10.1287\/educ.2013.0112"},{"issue":"2","key":"18_CR28","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi, A., Zarpellon, G.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). \n                    https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"18_CR29","doi-asserted-by":"publisher","unstructured":"Louppe, G.: Understanding random forests: from theory to practice. Ph.D. thesis, October 2014. \n                    https:\/\/doi.org\/10.13140\/2.1.1570.5928","DOI":"10.13140\/2.1.1570.5928"},{"key":"18_CR30","unstructured":"Mittelmann, H.D.: MILPlib (2018). \n                    http:\/\/plato.asu.edu\/ftp\/milp\/\n                    \n                  . Accessed 2018"},{"key":"18_CR31","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"18_CR32","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/505282.505283","volume":"34","author":"F Sebastiani","year":"2002","unstructured":"Sebastiani, F.: Machine learning in automated text categorization. ACM Comput. Surv. 34(1), 1\u201347 (2002). \n                    https:\/\/doi.org\/10.1145\/505282.505283","journal-title":"ACM Comput. Surv."},{"issue":"1","key":"18_CR33","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/1882471.1882478","volume":"12","author":"Z Xing","year":"2010","unstructured":"Xing, Z., Pei, J., Keogh, E.: A brief survey on sequence classification. ACM SIGKDD Explor. Newsl. 12(1), 40\u201348 (2010). \n                    https:\/\/doi.org\/10.1145\/1882471.1882478","journal-title":"ACM SIGKDD Explor. Newsl."}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T19:11:24Z","timestamp":1558984284000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"28 April 2019","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":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"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"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}