{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:07:31Z","timestamp":1767337651661,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T00:00:00Z","timestamp":1538006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Regione Lombardia - Fondazione Cariplo","award":["2015-0717 (project REDNEAT)"],"award-info":[{"award-number":["2015-0717 (project REDNEAT)"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10479-018-3067-9","type":"journal-article","created":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T09:53:01Z","timestamp":1538041981000},"page":"501-526","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Random sampling and machine learning to understand good decompositions"],"prefix":"10.1007","volume":"284","author":[{"given":"S.","family":"Basso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0983-2706","authenticated-orcid":false,"given":"A.","family":"Ceselli","sequence":"additional","affiliation":[]},{"given":"A.","family":"Tettamanzi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"issue":"4","key":"3067_CR1","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1002\/wics.101","volume":"2","author":"H Abdi","year":"2010","unstructured":"Abdi, H., & Williams, L. J. (2010). Principal component analysis. Wiley Interdisciplinary Reviews: Computational Statistics, 2(4), 433\u2013459.","journal-title":"Wiley Interdisciplinary Reviews: Computational Statistics"},{"issue":"1","key":"3067_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T. (2009). SCIP: solving constraint integer programs. Mathematical Programming Computation, 1(1), 1\u201341.","journal-title":"Mathematical Programming Computation"},{"issue":"4","key":"3067_CR3","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.orl.2005.07.009","volume":"34","author":"T Achterberg","year":"2006","unstructured":"Achterberg, T., Koch, T., & Martin, A. (2006). MIPLIB 2003. Operations Research Letters, 34(4), 361\u2013372.","journal-title":"Operations Research Letters"},{"key":"3067_CR4","doi-asserted-by":"crossref","unstructured":"Basso, S., & Ceselli, A. (2017). Asynchronous column generation. In Proceedings of the ninteenth workshop on algorithm engineering and experiments (ALENEX) (pp. 197\u2013206).","DOI":"10.1137\/1.9781611974768.16"},{"key":"3067_CR5","unstructured":"Basso, S., Ceselli, S., & Tettamanzi, A. (2018). Understanding good decompositions: An exploratory data analysis. Technical report, Universit\u00e0 degli Studi di Milano. \nhttp:\/\/hdl.handle.net\/2434\/487931\n\n."},{"issue":"1\u20132","key":"3067_CR6","doi-asserted-by":"publisher","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., Malaguti, E., et al. (2015). Automatic Dantzig\u2013Wolfe reformulation of mixed integer programs. Mathematical Programming A, 149(1\u20132), 391\u2013424.","journal-title":"Mathematical Programming A"},{"key":"3067_CR7","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10479-008-0452-9","volume":"179","author":"A Bettinelli","year":"2010","unstructured":"Bettinelli, A., Ceselli, A., & Righini, G. (2010). A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint. Annals of Operations Research, 179, 221\u2013241.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3067_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10479-008-0424-0","volume":"174","author":"JP Brooks","year":"2010","unstructured":"Brooks, J. P., & Lee, E. K. (2010). Analysis of the consistency of a mixed integer programming-based multi-category constrained discriminant model. Annals of Operations Research, 174(1), 147\u2013168.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"3067_CR9","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/A:1009715923555","volume":"2","author":"C Burges","year":"1998","unstructured":"Burges, C. (1998). A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery, 2(2), 121\u2013167.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"3067_CR10","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10479-008-0375-5","volume":"167","author":"A Ceselli","year":"2009","unstructured":"Ceselli, A., Liberatore, F., & Righini, G. (2009). A computational evaluation of a general branch-and-price framework for capacitated network location problems. Annals of Operations Research, 167, 209\u2013251.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"3067_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2016.04.030","volume":"255","author":"M Delorme","year":"2016","unstructured":"Delorme, M., Iori, M., & Martello, S. (2016). Bin packing and cutting stock problems: Mathematical models and exact algorithms. European Journal of Operational Research, 255(1), 1\u201320.","journal-title":"European Journal of Operational Research"},{"volume-title":"Column generation","year":"2005","key":"3067_CR12","unstructured":"Desaulniers, G., Desrosiers, J., & Solomon, M. M. (Eds.). (2005). Column generation. Berlin: Springer."},{"key":"3067_CR13","unstructured":"FICO xpress webpage. (2017). \nhttp:\/\/www.fico.com\/en\/products\/fico-xpress-optimization-suite\n\n. Last accessed March, 2017"},{"key":"3067_CR14","volume-title":"Breakthroughs in statistics. Springer series in statistics (perspectives in statistics)","author":"RA Fisher","year":"1992","unstructured":"Fisher, R. A. (1992). Statistical methods for research workers. In S. Kotz & N. L. Johnson (Eds.), Breakthroughs in statistics. Springer series in statistics (perspectives in statistics). New York, NY: Springer."},{"key":"3067_CR15","doi-asserted-by":"crossref","unstructured":"Gamrath, G., & L\u00fcbbecke, M. E. (2010). Experiments with a generic Dantzig\u2013Wolfe decomposition for integer programs. LNCS 6049 (pp. 239\u2013252).","DOI":"10.1007\/978-3-642-13193-6_21"},{"key":"3067_CR16","unstructured":"GUROBI webpage. (2017). \nhttp:\/\/www.gurobi.com\n\n. Last accessed March, 2017"},{"issue":"9","key":"3067_CR17","doi-asserted-by":"publisher","first-page":"1263","DOI":"10.1109\/TKDE.2008.239","volume":"21","author":"H He","year":"2009","unstructured":"He, H., & Garcia, E. A. (2009). Learning from imbalanced data. IEEE Transactions on Knowledge and Data Engineering, 21(9), 1263\u20131284.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"1","key":"3067_CR18","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. (2014). Algorithm runtime prediction: Methods & evaluation. Artificial Intelligence, 206(1), 79\u2013111.","journal-title":"Artificial Intelligence"},{"key":"3067_CR19","unstructured":"IBM Cplex webpage. (2016). \nhttp:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/index.html\n\n. Last accessed August, 2016"},{"key":"3067_CR20","unstructured":"Khalil, E. B. (2016). Machine learning for integer programming. In Proceedings of the twenty-fifth international joint conference on artificial intelligence."},{"issue":"2","key":"3067_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., Achterberg, T., Andersen, E., Bastert, O., Berthold, T., Bixby, R. E., et al. (2011). MIPLIB 2010. Mathematical Programming Computation, 3(2), 103\u2013163.","journal-title":"Mathematical Programming Computation"},{"key":"3067_CR22","unstructured":"Kruber, M., Luebbecke, M. E., & Parmentier, A. (2016). Learning when to use a decomposition. RWTH technical report 2016-037."},{"key":"3067_CR23","volume-title":"Data mining and predictive analytics","author":"DT Larose","year":"2015","unstructured":"Larose, D. T., & Larose, C. D. (2015). Data mining and predictive analytics. Hoboken: Wiley."},{"key":"3067_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603","volume-title":"Probability and computing: Randomized algorithms and probabilistic analysis","author":"M Mitzenmacher","year":"2005","unstructured":"Mitzenmacher, M., & Upfal, E. (2005). Probability and computing: Randomized algorithms and probabilistic analysis. New York, NY: Cambridge University Press."},{"issue":"1","key":"3067_CR25","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/s10601-009-9085-0","volume":"16","author":"J Puchinger","year":"2011","unstructured":"Puchinger, J., Stuckey, P. J., Wallace, M. G., & Brand, S. (2011). Dantzig\u2013Wolfe decomposition and branch-and-price solving in G12. Constraints, 16(1), 77\u201399.","journal-title":"Constraints"},{"key":"3067_CR26","unstructured":"R Core Team. (2016). R: A language and environment for statistical computing. R Foundation for Statistical Computing. \nhttps:\/\/www.R-project.org\/\n\n."},{"key":"3067_CR27","unstructured":"Ralphs, T. K., & Galati, M. V. (2017). DIP\u2014decomposition for integer programming. \nhttps:\/\/projects.coin-or.org\/Dip\n\n. Last accessed March, 2017."},{"key":"3067_CR28","volume-title":"Theory of linear and integer programming","author":"A Schrijver","year":"1998","unstructured":"Schrijver, A. (1998). Theory of linear and integer programming. Hoboken: Wiley."},{"key":"3067_CR29","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/B:STCO.0000035301.49549.88","volume":"14","author":"AJ Smola","year":"2004","unstructured":"Smola, A. J., & Scholkopf, B. (2004). A tutorial on support vector regression. Statistics and Computing, 14, 199\u2013222.","journal-title":"Statistics and Computing"},{"key":"3067_CR30","unstructured":"Vanderbeck, F. (2017). BaPCod\u2014A generic branch-and-price code. \nhttps:\/\/wiki.bordeaux.inria.fr\/realopt\/pmwiki.php\/Project\/BaPCod\n\n. Last accessed March, 2017."},{"key":"3067_CR31","volume-title":"50 years of integer programming 1958\u20132008","author":"F Vanderbeck","year":"2010","unstructured":"Vanderbeck, F., & Wolsey, L. (2010). Reformulation and decomposition of integer programs. In M. J\u00fcnger, Th M Liebling, D. Naddef, G. L. Nemhauser, W. R. Pulleyblank, G. Reinelt, G. Rinaldi, & L. A. Wolsey (Eds.), 50 years of integer programming 1958\u20132008. Berlin: Springer."},{"key":"3067_CR32","doi-asserted-by":"crossref","unstructured":"Wang, J., & Ralphs, T. (2013). Computational experience with hypergraph-based methods for automatic decomposition in discrete optimization. In C. Gomes & M. Sellmann (Eds.), Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. LNCS 7874 (pp. 394\u2013402).","DOI":"10.1007\/978-3-642-38171-3_31"},{"key":"3067_CR33","volume-title":"Integer programming","author":"L Wolsey","year":"1998","unstructured":"Wolsey, L. (1998). Integer programming. Hoboken: Wiley."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3067-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-018-3067-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-018-3067-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,2]],"date-time":"2020-01-02T07:55:53Z","timestamp":1577951753000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-018-3067-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,27]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["3067"],"URL":"https:\/\/doi.org\/10.1007\/s10479-018-3067-9","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2018,9,27]]},"assertion":[{"value":"27 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}