{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T11:31:51Z","timestamp":1742988711792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774480"},{"type":"electronic","value":"9783319774497"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-77449-7_5","type":"book-chapter","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T10:27:00Z","timestamp":1519986420000},"page":"67-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Automatic Grammar-Based Design of Heuristic Algorithms for Unconstrained Binary Quadratic Programming"],"prefix":"10.1007","author":[{"given":"Marcelo","family":"de Souza","sequence":"first","affiliation":[]},{"given":"Marcus","family":"Ritt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,3]]},"reference":[{"issue":"1","key":"5_CR1","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. J. Artif. Intell. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR2","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 Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Sellmann, M., Tierney, K.: A gender-based genetic algorithm for the automatic configuration of algorithms. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 142\u2013157. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_14"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-25566-3_40","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2011","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.orp.2016.09.002","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"issue":"2","key":"5_CR5","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B Alidaae","year":"1994","unstructured":"Alidaae, B., Kochenberger, G.A., Ahmadian, A.: 0\u20131 quadratic programming approach for optimum solutions of two scheduling problems. Int. J. Syst. Sci. 25(2), 401\u2013408 (1994)","journal-title":"Int. J. Syst. Sci."},{"issue":"4","key":"5_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen, P., Jaumard, B.: Algorithms for the maximum satisfiability problem. Computing 44(4), 279\u2013303 (1990)","journal-title":"Computing"},{"issue":"3","key":"5_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos, P.M., Xue, J.: The maximum clique problem. J. Global Optim. 4(3), 301\u2013328 (1994)","journal-title":"J. Global Optim."},{"issue":"2","key":"5_CR8","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"PM Pardalos","year":"1992","unstructured":"Pardalos, P.M., Jha, S.: Complexity of uniqueness and local search in quadratic 0\u20131 programming. Oper. Res. Lett. 11(2), 119\u2013123 (1992)","journal-title":"Oper. Res. Lett."},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s00291-003-0153-3","volume":"26","author":"GA Kochenberger","year":"2004","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: A unified modeling and solution framework for combinatorial optimization problems. OR Spectr. 26, 237\u2013250 (2004)","journal-title":"OR Spectr."},{"key":"5_CR10","unstructured":"Ans\u00f3tegui, C., Malitsky, Y., Samulowitz, H., Sellmann, M., Tierney, K.: Model-based genetic algorithms for algorithm configuration. In: IJCAI, pp. 733\u2013739 (2015)"},{"key":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-34413-8_5","volume-title":"Learning and Intelligent Optimization","author":"F Hutter","year":"2012","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Parallel algorithm configuration. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 55\u201370. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_5"},{"key":"5_CR12","unstructured":"Birattari, M., St\u00fctzle, T., Paquete, L., Varrentrapp, K.: A racing algorithm for configuring metaheuristics. In: 4th Annual Conference on Genetic and Evolutionary Computation, pp. 11\u201318. Morgan Kaufmann Publishers Inc. (2002)"},{"key":"5_CR13","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2015.11.002","volume":"232","author":"AR KhudaBukhsh","year":"2016","unstructured":"KhudaBukhsh, A.R., Xu, L., Hoos, H.H., Leyton-Brown, K.: SATenstein: automatically building local search SAT solvers from components. Artif. Intell. 232, 20\u201342 (2016)","journal-title":"Artif. Intell."},{"issue":"6","key":"5_CR14","doi-asserted-by":"publisher","first-page":"861","DOI":"10.1109\/TEVC.2011.2182651","volume":"16","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2012","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: The automatic design of multiobjective ant colony optimization algorithms. IEEE Trans. Evol. Comput. 16(6), 861\u2013875 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1007\/978-3-319-10762-2_50","volume-title":"Parallel Problem Solving from Nature \u2013 PPSN XIII","author":"LCT Bezerra","year":"2014","unstructured":"Bezerra, L.C.T., L\u00f3pez-Ib\u00e1\u00f1ez, M., St\u00fctzle, T.: Automatic design of evolutionary algorithms for multi-objective combinatorial optimization. In: Bartz-Beielstein, T., Branke, J., Filipi\u010d, B., Smith, J. (eds.) PPSN 2014. LNCS, vol. 8672, pp. 508\u2013517. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10762-2_50"},{"issue":"4","key":"5_CR16","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1109\/4235.942529","volume":"5","author":"M O\u2019Neill","year":"2001","unstructured":"O\u2019Neill, M., Ryan, C.: Grammatical evolution. IEEE Trans. Evol. Comput. 5(4), 349\u2013358 (2001)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","volume":"16","author":"EK Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Trans. Evol. Comput. 16(3), 406\u2013417 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"5_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"206","DOI":"10.1007\/978-3-642-29139-5_18","volume-title":"Genetic Programming","author":"J Tavares","year":"2012","unstructured":"Tavares, J., Pereira, F.B.: Automatic design of ant algorithms with grammatical evolution. In: Moraglio, A., Silva, S., Krawiec, K., Machado, P., Cotta, C. (eds.) EuroGP 2012. LNCS, vol. 7244, pp. 206\u2013217. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29139-5_18"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1007\/11729976_29","volume-title":"Genetic Programming","author":"F Rothlauf","year":"2006","unstructured":"Rothlauf, F., Oetzel, M.: On the locality of grammatical evolution. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ek\u00e1rt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 320\u2013330. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11729976_29"},{"issue":"3","key":"5_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s10710-015-9262-4","volume":"17","author":"N Louren\u00e7o","year":"2016","unstructured":"Louren\u00e7o, N., Pereira, F.B., Costa, E.: Unveiling the properties of structured grammatical evolution. Genet. Program. Evol. Mach. 17(3), 251\u2013289 (2016)","journal-title":"Genet. Program. Evol. Mach."},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/978-3-642-44973-4_36","volume-title":"Learning and Intelligent Optimization","author":"F Mascia","year":"2013","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: From grammars to parameters: automatic iterated greedy design for the permutation flow-shop problem with weighted tardiness. In: Nicosia, G., Pardalos, P. (eds.) LION 2013. LNCS, vol. 7997, pp. 321\u2013334. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-44973-4_36"},{"key":"5_CR22","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1016\/j.cor.2014.05.020","volume":"51","author":"F Mascia","year":"2014","unstructured":"Mascia, F., L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., St\u00fctzle, T.: Grammar-based generation of stochastic local search heuristics through automatic algorithm configuration tools. Comput. Oper. Res. 51, 190\u2013199 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"5_CR23","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., Hao, J.K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"issue":"2","key":"5_CR24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G Palubeckis","year":"2006","unstructured":"Palubeckis, G.: Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2), 279\u2013296 (2006)","journal-title":"Informatica"},{"issue":"3","key":"5_CR25","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10288-009-0115-y","volume":"8","author":"F Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR: Q. J. Oper. Res. 8(3), 239\u2013253 (2010)","journal-title":"4OR: Q. J. Oper. Res."},{"issue":"3","key":"5_CR26","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.ejor.2012.07.012","volume":"223","author":"Y Wang","year":"2012","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.K.: Path relinking for unconstrained binary quadratic programming. EJOR 223(3), 595\u2013604 (2012)","journal-title":"EJOR"},{"issue":"3","key":"5_CR27","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"5_CR28","doi-asserted-by":"publisher","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol. 146, pp. 321\u2013354. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_12","DOI":"10.1007\/978-1-4419-1665-5_12"},{"issue":"2","key":"5_CR29","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P Merz","year":"2002","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. J. Heuristics 8(2), 197\u2013213 (2002)","journal-title":"J. Heuristics"},{"issue":"2","key":"5_CR30","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T.A., Resende, M.G.: Greedy randomized adaptive search procedures. J. Global Optim. 6(2), 109\u2013133 (1995)","journal-title":"J. Global Optim."},{"issue":"12","key":"5_CR31","doi-asserted-by":"publisher","first-page":"1725","DOI":"10.1057\/jors.2012.149","volume":"64","author":"MR Hyde","year":"2013","unstructured":"Hyde, M.R., Burke, E.K., Kendall, G.: Automated code generation by local search. J. Oper. Res. Soc. 64(12), 1725\u20131741 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"5_CR32","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1287\/ijoc.1080.0275","volume":"21","author":"R Mart\u00ed","year":"2009","unstructured":"Mart\u00ed, R., Duarte, A., Laguna, M.: Advanced scatter search for the max-cut problem. INFORMS J. Comput. 21(1), 26\u201338 (2009)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"5_CR33","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S Burer","year":"2002","unstructured":"Burer, S., Monteiro, R.D., Zhang, Y.: Rank-two relaxation heuristics for max-cut and other binary quadratic programs. SIAM J. Optim. 12(2), 503\u2013521 (2002)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77449-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T18:33:37Z","timestamp":1710354817000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77449-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774480","9783319774497"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77449-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Parma","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2018\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}