{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:51:43Z","timestamp":1740099103026,"version":"3.37.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319071237"},{"type":"electronic","value":"9783319071244"}],"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-07124-4_31","type":"book-chapter","created":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T15:09:59Z","timestamp":1534172999000},"page":"687-701","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["POPMUSIC"],"prefix":"10.1007","author":[{"given":"\u00c9ric D.","family":"Taillard","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,14]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1287\/mnsc.34.3.391","volume":"34","author":"J Adams","year":"1988","unstructured":"Adams J, Balas E, Zawack D (1988) The shifting bottleneck procedure for job shop scheduling. Manag Sci 34:391\u2013401","journal-title":"Manag Sci"},{"key":"31_CR2","unstructured":"Alvim ACF, Taillard \u00c9D (2007) An efficient POPMUSIC based approach to the point feature label placement problem. In: Metaheuristic International Conference (MIC\u201907) Proceedings."},{"issue":"2","key":"31_CR3","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1016\/j.ejor.2007.10.002","volume":"192","author":"ACF Alvim","year":"2009","unstructured":"Alvim ACF, Taillard \u00c9D (2009) POPMUSIC for the point feature label placement problem. Eur J Oper Res 192(2):396\u2013413","journal-title":"Eur J Oper Res"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s13676-013-0024-2","volume":"2","author":"ACF Alvim","year":"2013","unstructured":"Alvim ACF, Taillard \u00c9D (2013) POPMUSIC for the world location routing problem. EURO J Transp Logist 2:231\u2013254","journal-title":"EURO J Transp Logist"},{"issue":"11","key":"31_CR5","doi-asserted-by":"publisher","first-page":"2017","DOI":"10.1016\/j.cor.2010.02.002","volume":"37","author":"E Angelelli","year":"2010","unstructured":"Angelelli E, Mansini R, Speranza M (2010) Kernel search: a general heuristic for the multi-dimensional knapsack problem. Comput Oper Res 37(11):2017\u20132026","journal-title":"Comput Oper Res"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s10589-010-9326-6","volume":"51","author":"E Angelelli","year":"2012","unstructured":"Angelelli E, Mansini R, Speranza M (2012) Kernel search: a new heuristic framework for portfolio selection. Comput Optim Appl 51(1):345\u2013361.","journal-title":"Comput Optim Appl"},{"issue":"5","key":"31_CR7","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","volume":"28","author":"E Balas","year":"1980","unstructured":"Balas E, Zemel E (1980) An algorithm for large zero-one knapsack problems. Oper Res 28(5):1130\u20131154","journal-title":"Oper Res"},{"issue":"1","key":"31_CR8","first-page":"21","volume":"16","author":"MO Ball","year":"2011","unstructured":"Ball MO (2011) Heuristics based on mathematical programming. Surv Oper Res Manag Sci 16(1):21\u201338","journal-title":"Surv Oper Res Manag Sci"},{"key":"31_CR9","unstructured":"Concorde (2015) Concorde TSP solver. http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/index.html"},{"key":"31_CR10","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti M, Lodi A (2003) Local branching. Math Program B 98:23\u201347","journal-title":"Math Program B"},{"issue":"2","key":"31_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1002\/net.20017","volume":"44","author":"M Fischetti","year":"2004","unstructured":"Fischetti M, Polo C, Scantamburlo M (2004) A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44(2):61\u201372","journal-title":"Networks"},{"key":"31_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, Dordrecht"},{"issue":"10","key":"31_CR13","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen P, Mladenovi\u0107 N, Urosevi\u0107 D (2006) Variable neighborhood search and local branching. Comput Oper Res 33(10):3034\u20133045","journal-title":"Comput Oper Res"},{"key":"31_CR14","volume-title":"Generalized local branching heuristics and the capacitated ring tree problem","author":"A Hill","year":"2015","unstructured":"Hill A, Vo\u00df S (2015) Generalized local branching heuristics and the capacitated ring tree problem. Working paper, IWI, University of Hamburg"},{"key":"31_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/s10472-014-9444-4","volume":"76","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz E, Vo\u00df S (2016) POPMUSIC as a matheuristic for the berth allocation problem. Ann Math Artif Intell 76:173\u2013189","journal-title":"Ann Math Artif Intell"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Lalla-Ruiz E, Vo\u00df S, Exposito-Izquierdo C, Melian-Batista B, Moreno-Vega JM (2015) A POPMUSIC-based approach for the berth allocation problem under time-dependent limitations. Ann Oper Res 1\u201327. doi:10.1007\/s10479-015-2055-6, ISSN:1572-9338. Page online available http:\/\/dx.doi.org\/10.1007\/s10479-015-2055-6","DOI":"10.1007\/s10479-015-2055-6"},{"key":"31_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-50349-3_19","volume-title":"A matheuristic approach for the p-cable trench problem","author":"E Lalla-Ruiz","year":"2016","unstructured":"Lalla-Ruiz E, Schwarze S, Vo\u00df S (2016) A matheuristic approach for the p-cable trench problem. Working paper, IWI, University of Hamburg"},{"key":"31_CR18","unstructured":"Laurent M, Taillard \u00c9D, Ertz O, Grin F, Rappo D, Roh S (2009) From point feature label placement to map labelling. In: Metaheuristic International Conference (MIC\u201909) Proceedings."},{"volume-title":"Matheuristics: hybridizing metaheuristics and mathematical programming","year":"2009","key":"31_CR19","unstructured":"Maniezzo V, St\u00fctzle T, Vo\u00df S (eds) (2009) Matheuristics: hybridizing metaheuristics and mathematical programming. Springer, Berlin"},{"issue":"7","key":"31_CR20","doi-asserted-by":"publisher","first-page":"934","DOI":"10.1057\/palgrave.jors.2602633","volume":"60","author":"A Ostertag","year":"2009","unstructured":"Ostertag A, Doerner KF, Hartl RF, Taillard \u00c9D, Waelti P (2009) POPMUSIC for a real-world large-scale vehicle routing problem with time windows. J Oper Res Soc 60(7):934\u2013943","journal-title":"J Oper Res Soc"},{"issue":"4","key":"31_CR21","doi-asserted-by":"publisher","first-page":"570","DOI":"10.1287\/opre.47.4.570","volume":"47","author":"D Pisinger","year":"1999","unstructured":"Pisinger D (1999) Core problems in knapsack algorithms. Oper Res 47(4):570\u2013575","journal-title":"Oper Res"},{"issue":"8","key":"31_CR22","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403\u20132435","journal-title":"Comput Oper Res"},{"key":"31_CR23","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich M, Vo\u00df S (2006) The corridor method: a dynamic programming inspired metaheuristic. Control Cybern 35:551\u2013578","journal-title":"Control Cybern"},{"key":"31_CR24","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1007\/978-1-4615-1507-4_27","volume-title":"Essays and surveys in metaheuristics","author":"E Taillard","year":"2002","unstructured":"Taillard E, Vo\u00df S (2002) POPMUSIC\u2014partial optimization metaheuristic under special intensification conditions. In: Ribeiro C, Hansen P (eds) Essays and surveys in metaheuristics. Kluwer, Boston, pp 613\u2013629"},{"issue":"8","key":"31_CR25","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9D Taillard","year":"1993","unstructured":"Taillard \u00c9D (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"key":"31_CR26","unstructured":"Taillard \u00c9D (2003) Heuristic methods for large centroid clustering problems. J Heuristics 9(1):51\u201373. Old technical report IDSIA-96-96"},{"key":"31_CR27","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1016\/S0377-2217(97)00293-2","volume":"106","author":"D Woodruff","year":"1998","unstructured":"Woodruff D (1998) Proposals for chunking and tabu search. Eur J Oper Res 106:585\u2013598","journal-title":"Eur J Oper Res"},{"key":"31_CR28","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1013720231747","volume":"6","author":"M Yamamoto","year":"2002","unstructured":"Yamamoto M, Camara G, Lorena L (2002) Tabu search heuristic for point-feature cartographic label placement. GeoInformatica 6:77\u201390","journal-title":"GeoInformatica"}],"container-title":["Handbook of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07124-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,8,13]],"date-time":"2018-08-13T16:03:03Z","timestamp":1534176183000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07124-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319071237","9783319071244"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07124-4_31","relation":{},"subject":[],"published":{"date-parts":[[2018]]}}}