{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:15:59Z","timestamp":1787498159011,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135194","type":"print"},{"value":"9783642135200","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_23","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T12:10:33Z","timestamp":1276344633000},"page":"186-202","source":"Crossref","is-referenced-by-count":104,"title":["Automated Configuration of Mixed Integer Programming Solvers"],"prefix":"10.1007","author":[{"given":"Frank","family":"Hutter","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Holger H.","family":"Hoos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Leyton-Brown","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"1","key":"23_CR1","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/opre.1050.0243","volume":"54","author":"B. Adenso-Diaz","year":"2006","unstructured":"Adenso-Diaz, B., Laguna, M.: Fine-tuning of algorithms using fractional experimental design and local search. Operations Research\u00a054(1), 99\u2013114 (2006)","journal-title":"Operations Research"},{"key":"23_CR2","unstructured":"Akt\u00fcrk, S.M., Atamt\u00fcrk, A., G\u00fcrel, S.: A strong conic quadratic reformulation for machine-job assignment with controllable processing times. Research Report BCOL.07.01, University of California-Berkeley (2007)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-04244-7_14","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C. Ansotegui","year":"2009","unstructured":"Ansotegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of solvers. In: Gent, I.P. (ed.) CP 2009. LNCS, vol.\u00a05732, pp. 142\u2013157. Springer, Heidelberg (2009)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10107-003-0400-z","volume":"98","author":"A. Atamt\u00fcrk","year":"2003","unstructured":"Atamt\u00fcrk, A.: On the facets of the mixed\u2013integer knapsack polyhedron. Mathematical Programming\u00a098, 145\u2013175 (2003)","journal-title":"Mathematical Programming"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A. Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A., Mu\u00f1oz, J.C.: A study of the lot-sizing polytope. Mathematical Programming\u00a099, 443\u2013465 (2004)","journal-title":"Mathematical Programming"},{"issue":"3","key":"23_CR6","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1137\/040620886","volume":"17","author":"C. Audet","year":"2006","unstructured":"Audet, C., Orban, D.: Finding optimal algorithmic parameters using the mesh adaptive direct search algorithm. SIAM Journal on Optimization\u00a017(3), 642\u2013664 (2006)","journal-title":"SIAM Journal on Optimization"},{"key":"23_CR7","series-title":"Natural Computing Series","volume-title":"Experimental Research in Evolutionary Computation: The New Experimentalism","author":"T. Bartz-Beielstein","year":"2006","unstructured":"Bartz-Beielstein, T.: Experimental Research in Evolutionary Computation: The New Experimentalism. Natural Computing Series. Springer, Berlin (2006)"},{"key":"23_CR8","unstructured":"Birattari, M.: The Problem of Tuning Metaheuristics as Seen from a Machine Learning Perspective. PhD thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2004)"},{"key":"23_CR9","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: Proc.\u00a0of GECCO 2002, pp. 11\u201318 (2002)"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Cote, M., Gendron, B., Rousseau, L.: Grammar-based integer programing models for multi-activity shift scheduling. Technical Report CIRRELT-2010-01, Centre interuniversitaire de recherche sur les r\u00e9seaux d\u2019entreprise, la logistique et le transport (2010)","DOI":"10.1016\/j.endm.2010.05.092"},{"key":"23_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68155-7_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C.P. Gomes","year":"2008","unstructured":"Gomes, C.P., van Hoeve, W.-J., Sabharwal, A.: Connections in networks: A hybrid approach. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 303\u2013307. Springer, Heidelberg (2008)"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1613\/jair.177","volume":"4","author":"J. Gratch","year":"1996","unstructured":"Gratch, J., Chien, S.A.: Adaptive problem-solving for large-scale scheduling problems: A case study. JAIR\u00a04, 365\u2013396 (1996)","journal-title":"JAIR"},{"issue":"3","key":"23_CR13","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/s10898-005-2454-3","volume":"34","author":"D. Huang","year":"2006","unstructured":"Huang, D., Allen, T.T., Notz, W.I., Zeng, N.: Global optimization of stochastic black-box systems via sequential kriging meta-models. Journal of Global Optimization\u00a034(3), 441\u2013466 (2006)","journal-title":"Journal of Global Optimization"},{"key":"23_CR14","unstructured":"Hutter, F.: On the potential of automatic algorithm configuration. In: SLS-DS2007: Doctoral Symposium on Engineering Stochastic Local Search Algorithms, pp. 36\u201340. Technical report TR\/IRIDIA\/2007-014, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium (2007)"},{"key":"23_CR15","unstructured":"Hutter, F.: Automated Configuration of Algorithms for Solving Hard Computational Problems. PhD thesis, University of British Columbia, Department of Computer Science, Vancouver, Canada (2009)"},{"key":"23_CR16","first-page":"27","volume-title":"Proc.\u00a0of FMCAD 2007","author":"F. Hutter","year":"2007","unstructured":"Hutter, F., Babi\u0107, D., Hoos, H.H., Hu, A.J.: Boosting Verification by Automatic Tuning of Decision Procedures. In: Proc.\u00a0of FMCAD 2007, Washington, DC, USA, pp. 27\u201334. IEEE Computer Society, Los Alamitos (2007a)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., Murphy, K.P.: An experimental investigation of model-based parameter optimisation: SPO and beyond. In: Proc.\u00a0of GECCO 2009, pp. 271\u2013278 (2009a)","DOI":"10.1145\/1569901.1569940"},{"key":"23_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-16108-7","volume-title":"Proc.\u00a0of LION-4","author":"F. Hutter","year":"2010","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., Murphy, K.P.: Time-bounded sequential parameter optimization. In: Proc.\u00a0of LION-4. LNCS. Springer, Heidelberg (to appear, 2010)"},{"key":"23_CR19","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1613\/jair.2861","volume":"36","author":"F. Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: ParamILS: an automatic algorithm configuration framework. Journal of Artificial Intelligence Research\u00a036, 267\u2013306 (2009b)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"23_CR20","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. In: Proc.\u00a0of AAAI 2007, pp. 1152\u20131157 (2007b)"},{"key":"23_CR21","unstructured":"KhudaBukhsh, A., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: Automatically building local search SAT solvers from components. In: Proc.\u00a0of IJCAI 2009, pp. 517\u2013524 (2009)"},{"key":"23_CR22","first-page":"66","volume-title":"Proc.\u00a0of EC 2000","author":"K. Leyton-Brown","year":"2000","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proc.\u00a0of EC 2000, pp. 66\u201376. ACM, New York (2000)"},{"key":"23_CR23","unstructured":"Mittelmann, H.: Mixed integer linear programming benchmark, serial codes (2010), http:\/\/plato.asu.edu\/ftp\/milpf.html (version last visited on January 26, 2010)"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:39:13Z","timestamp":1606167553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}