{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T20:35:45Z","timestamp":1760646945313,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030059828"},{"type":"electronic","value":"9783030059835"}],"license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05983-5_1","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T12:27:46Z","timestamp":1545049666000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Generic CP-Supported CMSA for Binary Integer Linear Programs"],"prefix":"10.1007","author":[{"given":"Christian","family":"Blum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haroldo","family":"Gambini Santos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis (2007)","key":"1_CR1"},{"key":"1_CR2","volume-title":"The Traveling Salesman Problem: A Computational Study","author":"DL Applegate","year":"2007","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2007)"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10288-011-0165-9","volume":"9","author":"Thierry Benoist","year":"2011","unstructured":"Benoist, T., Estellon, B., Gardi, F., Megel, R., Nouioua, K.: LocalSolver 1.x: a black-box local-search solver for 0\u20131 programming. 4OR 9(3), 299 (2011)","journal-title":"4OR"},{"key":"1_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-39636-1_2","volume-title":"Hybrid Metaheuristics","author":"C Blum","year":"2016","unstructured":"Blum, C.: Construct, merge, solve and adapt: application to unbalanced minimum common string partition. In: Blesa, M.J., Blum, C., Cangelosi, A., Cutello, V., Di Nuovo, A., Pavone, M., Talbi, E.-G. (eds.) HM 2016. LNCS, vol. 9668, pp. 17\u201331. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-39636-1_2"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s10732-017-9329-x","volume":"24","author":"C Blum","year":"2017","unstructured":"Blum, C., Blesa, M.J.: A comprehensive comparison of metaheuristics for the repetition-free longest common subsequence problem. J. Heuristics 24, 551\u2013579 (2017)","journal-title":"J. Heuristics"},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.cor.2015.10.014","volume":"68","author":"C Blum","year":"2016","unstructured":"Blum, C., Pinacho, P., L\u00f3pez-Ib\u00e1\u00f1ez, M., Lozano, J.A.: Construct, merge, solve & adapt: a new general algorithm for combinatorial optimization. Comput. Oper. Res. 68, 75\u201388 (2016)","journal-title":"Comput. Oper. Res."},{"doi-asserted-by":"crossref","unstructured":"Ernst, A.T., Singh, G.: Lagrangian particle swarm optimization for a resource constrained machine scheduling problem. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138 (2012)","key":"1_CR7","DOI":"10.1109\/CEC.2012.6256177"},{"issue":"1","key":"1_CR8","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s12532-009-0007-3","volume":"1","author":"M Fischetti","year":"2009","unstructured":"Fischetti, M., Salvagnin, D.: Feasibility pump 2.0. Math. Program. Comput. 1(2), 201\u2013222 (2009)","journal-title":"Math. Program. Comput."},{"unstructured":"Fourer, R., Gay, D., Kernighan, B.: AMPL, vol. 117. Boyd & Fraser Danvers (1993)","key":"1_CR10"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s12532-015-0083-5","volume":"7","author":"G Gamrath","year":"2015","unstructured":"Gamrath, G., Koch, T., Martin, A., Miltenberger, M., Weninger, D.: Progress in presolving for mixed integer programming. Math. Program. Comput. 7, 367\u2013398 (2015)","journal-title":"Math. Program. Comput."},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1287\/ijoc.12.1.2.11900","volume":"12","author":"E Johnson","year":"2000","unstructured":"Johnson, E., Nemhauser, G., Savelsbergh, W.: Progress in linear programming-based algorithms for integer programming: an exposition. INFORMS J. Comput. 12, 2\u20133 (2000)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s12532-011-0025-9","volume":"3","author":"T Koch","year":"2011","unstructured":"Koch, T., et al.: Miplib 2010. Math. Program. Comput. 3(2), 103 (2011)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1_CR14","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger, G., et al.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28(1), 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"1_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1007\/978-3-319-55453-2_5","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"E Liz\u00e1rraga","year":"2017","unstructured":"Liz\u00e1rraga, E., Blesa, M.J., Blum, C.: Construct, merge, solve and adapt versus large neighborhood search for solving the multi-dimensional knapsack problem: which one works better when? In: Hu, B., L\u00f3pez-Ib\u00e1\u00f1ez, M. (eds.) EvoCOP 2017. LNCS, vol. 10197, pp. 60\u201374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55453-2_5"},{"issue":"11","key":"1_CR16","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"unstructured":"Sandholm, T., Shields, R.: Nogood learning for mixed integer programming. Technical report (2006)","key":"1_CR17"},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-07644-7_4","volume-title":"Hybrid Metaheuristics","author":"S Souza Brito","year":"2014","unstructured":"Souza Brito, S., Gambini Santos, H., Miranda Santos, B.H.: A local search approach for binary programming: feasibility search. In: Blesa, M.J., Blum, C., Vo\u00df, S. (eds.) HM 2014. LNCS, vol. 8457, pp. 45\u201355. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07644-7_4"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S0219720003000186","volume":"1","author":"J Xy","year":"2003","unstructured":"Xy, J., Li, M., Kim, D., Xu, Y.: RAPTOR: optimal protein threading by linear programming. J. Bioinform. Comput. Biol. 1(1), 95\u2013117 (2003)","journal-title":"J. Bioinform. Comput. Biol."}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05983-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:23:52Z","timestamp":1710361432000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05983-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"ISBN":["9783030059828","9783030059835"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05983-5_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Hybrid Metaheuristics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hm2019.ing.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}