{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:06:17Z","timestamp":1767337577725,"version":"3.37.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319597751"},{"type":"electronic","value":"9783319597768"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59776-8_16","type":"book-chapter","created":{"date-parts":[[2017,5,30]],"date-time":"2017-05-30T13:26:33Z","timestamp":1496150793000},"page":"202-210","source":"Crossref","is-referenced-by-count":41,"title":["Learning When to Use a Decomposition"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7263-7279","authenticated-orcid":false,"given":"Markus","family":"Kruber","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2635-0522","authenticated-orcid":false,"given":"Marco E.","family":"L\u00fcbbecke","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-4947","authenticated-orcid":false,"given":"Axel","family":"Parmentier","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,5,31]]},"reference":[{"issue":"1","key":"16_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1(1), 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"issue":"1\u20132","key":"16_CR2","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10107-014-0761-5","volume":"149","author":"M Bergner","year":"2015","unstructured":"Bergner, M., Caprara, A., Ceselli, A., Furini, F., L\u00fcbbecke, M.E., Malaguti, E., Traversi, E.: Automatic Dantzig-Wolfe reformulation of mixed integer programs. Math. Program. 149(1\u20132), 391\u2013424 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"16_CR3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/ijoc.1120.0521","volume":"25","author":"A Caprara","year":"2013","unstructured":"Caprara, A., Furini, F., Malaguti, E.: Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem. INFORMS J. Comput. 25(3), 560\u2013571 (2013)","journal-title":"INFORMS J. Comput."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/978-3-642-13193-6_21","volume-title":"Experimental Algorithms","author":"G Gamrath","year":"2010","unstructured":"Gamrath, G., L\u00fcbbecke, M.E.: Experiments with a generic Dantzig-Wolfe decomposition for integer programs. In: Festa, P. (ed.) SEA 2010. LNCS, vol. 6049, pp. 239\u2013252. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-13193-6_21"},{"key":"16_CR5","first-page":"299","volume":"2","author":"MG Genton","year":"2001","unstructured":"Genton, M.G.: Classes of kernels for machine learning: a statistics perspective. J. Mach. Learn. Res. 2, 299\u2013312 (2001)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Khalil, E., Le Bodic, P., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the 30th AAAI Conference on Artificial Intelligence (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"issue":"2","key":"16_CR7","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R.E., Danna, E., Gamrath, G., Gleixner, A.M., Heinz, S., Lodi, A., Mittelmann, H., Ralphs, T., Salvagnin, D., Steffy, D.E., Wolter, K.: MIPLIB 2010. Math. Program. Comput. 3(2), 103\u2013163 (2011)","journal-title":"Math. Program. Comput."},{"issue":"474","key":"16_CR8","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1198\/016214505000001230","volume":"101","author":"Y Lin","year":"2006","unstructured":"Lin, Y., Jeon, Y.: Random forests and adaptive nearest neighbors. J. Am. Stat. Assoc. 101(474), 578\u2013590 (2006)","journal-title":"J. Am. Stat. Assoc."},{"issue":"1","key":"16_CR9","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"A Marcos Alvarez","year":"2014","unstructured":"Marcos Alvarez, A., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2014)","journal-title":"INFORMS J. Comput."},{"key":"16_CR10","unstructured":"Marcos Alvarez, A., Wehenkel, L., Louveaux, Q.: Machine learning to balance the load in parallel branch-and-bound (2015)"},{"key":"16_CR11","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1007\/978-3-642-38171-3_31","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J Wang","year":"2013","unstructured":"Wang, J., Ralphs, T.: Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization. In: Gomes, C., Sellmann, M. (eds.) CPAIOR 2013. LNCS, vol. 7874, pp. 394\u2013402. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-38171-3_31"},{"key":"16_CR13","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-MIP: automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), July 2011"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59776-8_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,28]],"date-time":"2022-07-28T23:37:11Z","timestamp":1659051431000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59776-8_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319597751","9783319597768"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59776-8_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}