{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:16:04Z","timestamp":1750220164149,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,7,8]],"date-time":"2022-07-08T00:00:00Z","timestamp":1657238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Coordena\u00e7\u00e3o de Aperfei\u00e7oamento de Pessoal de N\u00edvel Superior (CAPES)","award":["Finance Code 001"],"award-info":[{"award-number":["Finance Code 001"]}]},{"name":"Google Research Latin America","award":["25111"],"award-info":[{"award-number":["25111"]}]},{"name":"CNPq","award":["437859\/2018-5"],"award-info":[{"award-number":["437859\/2018-5"]}]},{"DOI":"10.13039\/501100008128","name":"Universidade do Estado de Santa Catarina","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100008128","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,7,8]]},"DOI":"10.1145\/3512290.3528750","type":"proceedings-article","created":{"date-parts":[[2022,7,18]],"date-time":"2022-07-18T13:59:57Z","timestamp":1658152797000},"page":"222-231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Improved regression models for algorithm configuration"],"prefix":"10.1145","author":[{"given":"Marcelo","family":"de Souza","sequence":"first","affiliation":[{"name":"Universidade do Estado de Santa Catarina and Universidade Federal do Rio Grande do Sul"}]},{"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[{"name":"Universidade Federal do Rio Grande do Sul"}]}],"member":"320","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2015.12.006"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04244-7_14"},{"volume-title":"Experimental Methods for the Analysis of Optimization Algorithms, Thomas Bartz-Beielstein, Marco Chiarandini, Lu\u00eds Paquete","author":"Bartz-Beielstein Thomas","key":"e_1_3_2_1_3_1","unstructured":"Thomas Bartz-Beielstein , C. Lasarczyk , and Mike Preuss . 2010. The Sequential Parameter Optimization Toolbox . In Experimental Methods for the Analysis of Optimization Algorithms, Thomas Bartz-Beielstein, Marco Chiarandini, Lu\u00eds Paquete , and Mike Preuss (Eds.). Springer , Berlin, Germany , 337--360. Thomas Bartz-Beielstein, C. Lasarczyk, and Mike Preuss. 2010. The Sequential Parameter Optimization Toolbox. In Experimental Methods for the Analysis of Optimization Algorithms, Thomas Bartz-Beielstein, Marco Chiarandini, Lu\u00eds Paquete, and Mike Preuss (Eds.). Springer, Berlin, Germany, 337--360."},{"key":"e_1_3_2_1_4_1","unstructured":"John E. Beasley. 1998. Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/bqp.pdf  John E. Beasley. 1998. Heuristic Algorithms for the Unconstrained Binary Quadratic Programming Problem. http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/bqp.pdf"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45823-6_15"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3071178.3071343"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"e_1_3_2_1_8_1","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference, GECCO","author":"Birattari Mauro","year":"2002","unstructured":"Mauro Birattari , Thomas St\u00fctzle , Lu\u00eds Paquete , and Klaus Varrentrapp . 2002 . A Racing Algorithm for Configuring Metaheuristics . In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2002, William B. Langdon et al. (Eds.). Morgan Kaufmann Publishers, San Francisco, CA, 11--18. Mauro Birattari, Thomas St\u00fctzle, Lu\u00eds Paquete, and Klaus Varrentrapp. 2002. A Racing Algorithm for Configuring Metaheuristics. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO 2002, William B. Langdon et al. (Eds.). Morgan Kaufmann Publishers, San Francisco, CA, 11--18."},{"volume-title":"Parallel Problem Solving from Nature - PPSN XI (Lecture Notes in Computer Science), Robert Schaefer, Carlos Cotta, Joanna Ko\u0142odziej, and G\u00fcnther Rudolph (Eds.)","author":"B\u00f6ttcher S\u00fcntje","key":"e_1_3_2_1_9_1","unstructured":"S\u00fcntje B\u00f6ttcher , Benjamin Doerr , and Frank Neumann . 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem . In Parallel Problem Solving from Nature - PPSN XI (Lecture Notes in Computer Science), Robert Schaefer, Carlos Cotta, Joanna Ko\u0142odziej, and G\u00fcnther Rudolph (Eds.) . Springer , Heidelberg, Germany , 1--10. S\u00fcntje B\u00f6ttcher, Benjamin Doerr, and Frank Neumann. 2010. Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem. In Parallel Problem Solving from Nature - PPSN XI (Lecture Notes in Computer Science), Robert Schaefer, Carlos Cotta, Joanna Ko\u0142odziej, and G\u00fcnther Rudolph (Eds.). Springer, Heidelberg, Germany, 1--10."},{"key":"e_1_3_2_1_10_1","first-page":"685","article-title":"Clustering Qualitative Data Based on Binary Equivalence Relations","volume":"74","author":"Brusco Michael J.","year":"2009","unstructured":"Michael J. Brusco and Hans-Friedrich K\u00f6hn . 2009 . Clustering Qualitative Data Based on Binary Equivalence Relations : Neighborhood Search Heuristics for the Clique Partitioning Problem. Psychometrika 74 , 4 (2009), 685 -- 703 . Michael J. Brusco and Hans-Friedrich K\u00f6hn. 2009. Clustering Qualitative Data Based on Binary Equivalence Relations: Neighborhood Search Heuristics for the Clique Partitioning Problem. Psychometrika 74, 4 (2009), 685--703.","journal-title":"Neighborhood Search Heuristics for the Clique Partitioning Problem. Psychometrika"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2005.05.029"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2018.8477801"},{"key":"e_1_3_2_1_13_1","volume-title":"HHTA: Hybrid Heuristic for the Test-Assignment Problem - Source Code. https:\/\/github.com\/souzamarcelo\/hhta","author":"de Souza Marcelo","year":"2018","unstructured":"Marcelo de Souza and Marcus Ritt . 2018 . HHTA: Hybrid Heuristic for the Test-Assignment Problem - Source Code. https:\/\/github.com\/souzamarcelo\/hhta Marcelo de Souza and Marcus Ritt. 2018. HHTA: Hybrid Heuristic for the Test-Assignment Problem - Source Code. https:\/\/github.com\/souzamarcelo\/hhta"},{"key":"e_1_3_2_1_14_1","volume-title":"ILSBQP: A Simple Iterated Local Search for the Unconstrained Binary Quadratic Programming - Source Code. https:\/\/github.com\/souzamarcelo\/ilsbqp","author":"de Souza Marcelo","year":"2022","unstructured":"Marcelo de Souza and Marcus Ritt . 2022 . ILSBQP: A Simple Iterated Local Search for the Unconstrained Binary Quadratic Programming - Source Code. https:\/\/github.com\/souzamarcelo\/ilsbqp Marcelo de Souza and Marcus Ritt. 2022. ILSBQP: A Simple Iterated Local Search for the Unconstrained Binary Quadratic Programming - Source Code. https:\/\/github.com\/souzamarcelo\/ilsbqp"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Marcelo de Souza and Marcus Ritt. 2022. Improved Regression Models for Algorithm Configuration - Source Code. https:\/\/github.com\/souzamarcelo\/regression-models-ac  Marcelo de Souza and Marcus Ritt. 2022. Improved Regression Models for Algorithm Configuration - Source Code. https:\/\/github.com\/souzamarcelo\/regression-models-ac","DOI":"10.1145\/3512290.3528750"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Marcelo de Souza and Marcus Ritt. 2022. Improved Regression Models for Algorithm Configuration - Supplementary Material. https:\/\/github.com\/souzamarcelo\/supp-models-ac  Marcelo de Souza and Marcus Ritt. 2022. Improved Regression Models for Algorithm Configuration - Supplementary Material. https:\/\/github.com\/souzamarcelo\/supp-models-ac","DOI":"10.1145\/3512290.3528750"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10732-011-9176-0"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2017.12.011"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72904-2"},{"key":"e_1_3_2_1_20_1","unstructured":"Alberto Franzin and Thomas St\u00fctzle. 2020. Towards Transferring Algorithm Configurations Across Problems. In Learning Meets Combinatorial Algorithms at NeurIPS2020 Marin Vlastelica et al. (Eds.). OpenReview. https:\/\/openreview.net\/group?id=NeurIPS.cc\/2020\/Workshop\/LMCA  Alberto Franzin and Thomas St\u00fctzle. 2020. Towards Transferring Algorithm Configurations Across Problems. In Learning Meets Combinatorial Algorithms at NeurIPS2020 Marin Vlastelica et al. (Eds.). OpenReview. https:\/\/openreview.net\/group?id=NeurIPS.cc\/2020\/Workshop\/LMCA"},{"volume-title":"Handbook of Satisfiability, Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (Eds.). Frontiers in Artificial Intelligence and Applications","author":"Hoos Holger H.","key":"e_1_3_2_1_21_1","unstructured":"Holger H. Hoos , Frank Hutter , and Kevin Leyton-Brown . 2021. Automated Configuration and Selection of SAT Solvers . In Handbook of Satisfiability, Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (Eds.). Frontiers in Artificial Intelligence and Applications , Vol. 336 . IOS Press , Amsterdam, The Netherlands, 481--507. Holger H. Hoos, Frank Hutter, and Kevin Leyton-Brown. 2021. Automated Configuration and Selection of SAT Solvers. In Handbook of Satisfiability, Armin Biere, Marijn Heule, Hans van Maaren, and Toby Walsh (Eds.). Frontiers in Artificial Intelligence and Applications, Vol. 336. IOS Press, Amsterdam, The Netherlands, 481--507."},{"key":"e_1_3_2_1_23_1","volume-title":"CP 2006 (Lecture Notes in Computer Science","volume":"228","author":"Hutter Frank","year":"2006","unstructured":"Frank Hutter , Youssef Hamadi , Holger H. Hoos , and Kevin Leyton-Brown . 2006 . Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. In Principles and Practice of Constraint Programming , CP 2006 (Lecture Notes in Computer Science , Vol. 4204), Fr\u00e9d\u00e9ric Benhamou (Ed.). Springer, Heidelberg, Germany, 213-- 228 . Frank Hutter, Youssef Hamadi, Holger H. Hoos, and Kevin Leyton-Brown. 2006. Performance Prediction and Automated Tuning of Randomized and Parametric Algorithms. In Principles and Practice of Constraint Programming, CP 2006 (Lecture Notes in Computer Science, Vol. 4204), Fr\u00e9d\u00e9ric Benhamou (Ed.). Springer, Heidelberg, Germany, 213--228."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2861"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of the 19th European Conference on Artificial Intelligence, H. Coelho, R. Studer, and Michael Wooldridge (Eds.). IOS Press","author":"Kadioglu Serdar","year":"2010","unstructured":"Serdar Kadioglu , Yuri Malitsky , Meinolf Sellmann , and Kevin Tierney . 2010 . ISAC: Instance-Specific Algorithm Configuration . In Proceedings of the 19th European Conference on Artificial Intelligence, H. Coelho, R. Studer, and Michael Wooldridge (Eds.). IOS Press , Amsterdam, The Netherlands, 751--756. Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, and Kevin Tierney. 2010. ISAC: Instance-Specific Algorithm Configuration. In Proceedings of the 19th European Conference on Artificial Intelligence, H. Coelho, R. Studer, and Michael Wooldridge (Eds.). IOS Press, Amsterdam, The Netherlands, 751--756."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1162\/evco_a_00215"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2011.132"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2005.08.013"},{"key":"e_1_3_2_1_31_1","volume-title":"CP 2002 (Lecture Notes in Computer Science","volume":"572","author":"Leyton-Brown Kevin","unstructured":"Kevin Leyton-Brown , Eugene Nudelman , and Y. Shoham . 2002. Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. In Principles and Practice of Constraint Programming , CP 2002 (Lecture Notes in Computer Science , Vol. 2470), Pascal Van Hentenryck (Ed.). Springer, Heidelberg, Germany, 556-- 572 . Kevin Leyton-Brown, Eugene Nudelman, and Y. Shoham. 2002. Learning the Empirical Hardness of Optimization Problems: The Case of Combinatorial Auctions. In Principles and Practice of Constraint Programming, CP 2002 (Lecture Notes in Computer Science, Vol. 2470), Pascal Van Hentenryck (Ed.). Springer, Heidelberg, Germany, 556--572."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-55453-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orp.2016.09.002"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11230-5_3"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218213010000236"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-44973-4_44"},{"key":"e_1_3_2_1_37_1","volume-title":"Proceedings of the Fourth International Conference on Computer Vision Theory and Applications, VISAPP","author":"Muja Marius","year":"2009","unstructured":"Marius Muja and David G. Lowe . 2009. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration . In Proceedings of the Fourth International Conference on Computer Vision Theory and Applications, VISAPP , Lisbon, Portugal , February 5-8, 2009 , Alpesh Ranchordas and Helder Ara\u00fajo (Eds.), Vol. 1. INSTICC Press, Lisbon, Portugal, 331--340. Marius Muja and David G. Lowe. 2009. Fast Approximate Nearest Neighbors with Automatic Algorithm Configuration. In Proceedings of the Fourth International Conference on Computer Vision Theory and Applications, VISAPP, Lisbon, Portugal, February 5-8, 2009, Alpesh Ranchordas and Helder Ara\u00fajo (Eds.), Vol. 1. INSTICC Press, Lisbon, Portugal, 331--340."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28650-9_4"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2013.11.015"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90182-M"},{"key":"e_1_3_2_1_42_1","unstructured":"Angelika Wiegele. 2007. Biq Mac Library - Binary Quadratic and Max Cut Library. http:\/\/biqmac.aau.at\/biqmaclib.html  Angelika Wiegele. 2007. Biq Mac Library - Binary Quadratic and Max Cut Library. http:\/\/biqmac.aau.at\/biqmaclib.html"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/EALS.2014.7009510"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9964-9"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Zhi-Hua Zhou Jin-Kao Hao and Adrien Go\u00ebffon. 2016. A Three-Phased Local Search Approach for the Clique Partitioning Problem - Supplementary Material. https:\/\/leria-info.univ-angers.fr\/~jinkao.hao\/cpp.html  Zhi-Hua Zhou Jin-Kao Hao and Adrien Go\u00ebffon. 2016. A Three-Phased Local Search Approach for the Clique Partitioning Problem - Supplementary Material. https:\/\/leria-info.univ-angers.fr\/~jinkao.hao\/cpp.html","DOI":"10.1007\/s10878-015-9964-9"},{"key":"e_1_3_2_1_46_1","volume-title":"Proceedings of the XLV Brazilian Symposium on Operational Research - SBPO 2013","author":"Zubaran Tadeu","year":"2013","unstructured":"Tadeu Zubaran and Marcus Ritt . 2013 . A Simple, Adaptive Bubble Search for Improving Heuristic Solutions of the Permutation Flow Shop Scheduling Problem . In Proceedings of the XLV Brazilian Symposium on Operational Research - SBPO 2013 , Luciano Ferreira and Mariana Rodrigues de Almeida (Eds.). SOBRAPO, Rio de Janeiro, RJ, Brazil , 1847--1856. Tadeu Zubaran and Marcus Ritt. 2013. A Simple, Adaptive Bubble Search for Improving Heuristic Solutions of the Permutation Flow Shop Scheduling Problem. In Proceedings of the XLV Brazilian Symposium on Operational Research - SBPO 2013, Luciano Ferreira and Mariana Rodrigues de Almeida (Eds.). SOBRAPO, Rio de Janeiro, RJ, Brazil, 1847--1856."}],"event":{"name":"GECCO '22: Genetic and Evolutionary Computation Conference","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"],"location":"Boston Massachusetts","acronym":"GECCO '22"},"container-title":["Proceedings of the Genetic and Evolutionary Computation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528750","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3512290.3528750","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:30Z","timestamp":1750186830000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3512290.3528750"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,8]]},"references-count":44,"alternative-id":["10.1145\/3512290.3528750","10.1145\/3512290"],"URL":"https:\/\/doi.org\/10.1145\/3512290.3528750","relation":{},"subject":[],"published":{"date-parts":[[2022,7,8]]},"assertion":[{"value":"2022-07-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}