{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T09:10:33Z","timestamp":1689412233305},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2014,7,17]],"date-time":"2014-07-17T00:00:00Z","timestamp":1405555200000},"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":["J Heuristics"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10732-014-9255-0","type":"journal-article","created":{"date-parts":[[2014,7,16]],"date-time":"2014-07-16T14:28:55Z","timestamp":1405520935000},"page":"589-615","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Boosting local search with Lagrangian relaxation"],"prefix":"10.1007","volume":"20","author":[{"given":"Zhilei","family":"Ren","sequence":"first","affiliation":[]},{"given":"He","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Shuwei","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Jingxuan","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Zhongxuan","family":"Luo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,17]]},"reference":[{"issue":"4","key":"9255_CR1","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s11590-006-0031-4","volume":"1","author":"RM Aiex","year":"2007","unstructured":"Aiex, R.M., Resende, M.G., Ribeiro, C.C.: TTT plots: a perl program to create time-to-target plots. Optim. Lett. 1(4), 355\u2013366 (2007)","journal-title":"Optim. Lett."},{"issue":"3","key":"9255_CR2","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1016\/j.ejor.2006.12.063","volume":"191","author":"E Alekseeva","year":"2008","unstructured":"Alekseeva, E., Kochetov, Y., Plyasunov, A.: Complexity of local search for the p-median problem. Eur. J. Oper. Res. 191(3), 736\u2013752 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9255_CR3","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-005-0700-6","volume":"109","author":"P Avella","year":"2007","unstructured":"Avella, P., Sassano, A., Vasil\u2019ev, I.: Computational study of large-scale p-median problems. Math. Program. 109(1), 89\u2013114 (2007)","journal-title":"Math. Program."},{"issue":"3","key":"9255_CR4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0377-2217(93)90118-7","volume":"65","author":"JE Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65(3), 383\u2013399 (1993)","journal-title":"Eur. J. Oper. Res."},{"key":"9255_CR5","unstructured":"Belov, A., J\u00e4rvisalo, M., Stachniak, Z.: Depth-driven circuit-level stochastic local search for sat. In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence, vol. 1, pp. 504\u2013509. AAAI Press, Menlo Park (2011)"},{"issue":"2","key":"9255_CR6","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1007\/s10732-008-9095-x","volume":"16","author":"J Bennell","year":"2010","unstructured":"Bennell, J., Song, X.: A beam search implementation for the irregular shape packing problem. J. Heuristics 16(2), 167\u2013188 (2010)","journal-title":"J. Heuristics"},{"issue":"5","key":"9255_CR7","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10732-007-9046-y","volume":"14","author":"J Brimberg","year":"2008","unstructured":"Brimberg, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Local and variable neighborhood search for the k-cardinality subgraph problem. J. Heuristics 14(5), 501\u2013517 (2008)","journal-title":"J. Heuristics"},{"issue":"6","key":"9255_CR8","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1007\/s10732-010-9149-8","volume":"17","author":"T Brueggemann","year":"2011","unstructured":"Brueggemann, T., Hurink, J.L.: Matching based very large-scale neighborhoods for parallel machine scheduling. J. Heuristics 17(6), 637\u2013658 (2011)","journal-title":"J. Heuristics"},{"issue":"2","key":"9255_CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/s10732-011-9162-6","volume":"19","author":"S Ceschia","year":"2013","unstructured":"Ceschia, S., Schaerf, A.: Local search for a multi-drop multi-container loading problem. J. Heuristics 19(2), 275\u2013294 (2013)","journal-title":"J. Heuristics"},{"issue":"2","key":"9255_CR10","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0377-2217(82)90160-6","volume":"10","author":"N Christofides","year":"1982","unstructured":"Christofides, N., Beasley, J.E.: A tree search algorithm for the p-median problem. Eur. J. Oper. Res. 10(2), 196\u2013204 (1982)","journal-title":"Eur. J. Oper. Res."},{"key":"9255_CR11","unstructured":"Climer, S., Zhang, W.: Searching for backbones and fat: a limit-crossing approach with applications. In: Proceedings of The National Conference on Artificial Intelligence, pp 707\u2013712. AAAI Press, Menlo Park (2002)"},{"issue":"1","key":"9255_CR12","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/B:HEUR.0000019987.10818.e0","volume":"10","author":"F Croce","year":"2004","unstructured":"Croce, F., Ghirardi, M., Tadei, R.: Recovering beam search: enhancing the beam search approach for combinatorial optimization problems. J. Heuristics 10(1), 89\u2013104 (2004)","journal-title":"J. Heuristics"},{"issue":"1\u20133","key":"9255_CR13","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program."},{"issue":"4","key":"9255_CR14","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1287\/ijoc.1100.0418","volume":"23","author":"S Garc\u00eda","year":"2011","unstructured":"Garc\u00eda, S., Labb\u00e9, M., Mar\u00edn, A.: Solving large p-median problems with a radius formulation. INFORMS J. Comput. 23(4), 546\u2013556 (2011)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"9255_CR15","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search-part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9255_CR16","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search-part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"9255_CR17","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1007\/978-3-642-02029-2_10","volume-title":"Graph Theory, Computational Intelligence and Thought","author":"G Gutin","year":"2009","unstructured":"Gutin, G., Karapetyan, D.: Local search heuristics for the multidimensional assignment problem. Graph Theory, Computational Intelligence and Thought, pp. 100\u2013115. Springer, Berlin (2009)"},{"issue":"3","key":"9255_CR18","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. 12(3), 450\u2013459 (1964)","journal-title":"Oper. Res."},{"issue":"4","key":"9255_CR19","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0966-8349(98)00030-8","volume":"5","author":"P Hansen","year":"1997","unstructured":"Hansen, P., Mladenovic, N.: Variable neighborhood search for the p-median. Locat. Sci. 5(4), 207\u2013226 (1997)","journal-title":"Locat. Sci."},{"issue":"2\u20133","key":"9255_CR20","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/s12532-009-0004-6","volume":"1","author":"K Helsgaun","year":"2009","unstructured":"Helsgaun, K.: General k-opt submoves for the Lin\u2013Kernighan TSP heuristic. Math. Program. Comput. 1(2\u20133), 119\u2013163 (2009)","journal-title":"Math. Program. Comput."},{"key":"9255_CR21","volume-title":"Stochastic Local Search. Foundations and Applications","author":"HH Hoos","year":"2005","unstructured":"Hoos, H.H., St\u00fctzle, T.: Stochastic Local Search. Foundations and Applications. Elsevier, Amsterdam (2005)"},{"issue":"1","key":"9255_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/opre.20.1.173","volume":"20","author":"P J\u00e4rvinen","year":"1972","unstructured":"J\u00e4rvinen, P., Rajala, J., Sinervo, H.: A branch-and-bound algorithm for seeking the p-median. Oper. Res. 20(1), 173\u2013178 (1972)","journal-title":"Oper. Res."},{"key":"9255_CR23","first-page":"209","volume":"29","author":"B Kernighan","year":"1970","unstructured":"Kernighan, B., Lin, S.: An eflicient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 29, 209 (1970)","journal-title":"Bell Syst. Tech. J."},{"issue":"1","key":"9255_CR24","doi-asserted-by":"crossref","first-page":"53","DOI":"10.2298\/YJOR0501053K","volume":"15","author":"Y Kochetov","year":"2005","unstructured":"Kochetov, Y., Levanova, T., Alekseeva, E., Loresh, M.: Large neighborhood local search for the p-median problem. Yugosl. J. Oper. Res. 15(1), 53\u201363 (2005)","journal-title":"Yugosl. J. Oper. Res."},{"key":"9255_CR25","doi-asserted-by":"crossref","unstructured":"Li, C.M., Quan, Z.: An efficient branch-and-bound algorithm based on MaxSAT for the maximum clique problem. In: Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, pp. 128\u2013133 (2010)","DOI":"10.1609\/aaai.v24i1.7536"},{"issue":"3","key":"9255_CR26","doi-asserted-by":"crossref","first-page":"927","DOI":"10.1016\/j.ejor.2005.05.034","volume":"179","author":"N Mladenovic","year":"2007","unstructured":"Mladenovic, N., Brimberg, J., Hansen, P., Moreno-Prez, J.A.: The p-median problem: a survey of metaheuristic approaches. Eur. J. Oper. Res. 179(3), 927\u2013939 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"9255_CR27","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/s10732-007-9048-9","volume":"14","author":"J Puchinger","year":"2008","unstructured":"Puchinger, J., Raidl, G.R.: Bringing order into the neighborhoods: relaxation guided variable neighborhood search. J. Heuristics 14(5), 457\u2013472 (2008)","journal-title":"J. Heuristics"},{"key":"9255_CR28","doi-asserted-by":"crossref","unstructured":"Pullan, W.: A population based hybrid metaheuristic for the p-median problem. In: 2008 IEEE Congress on Evolutionary Computation, pp. 75\u201382 (2008)","DOI":"10.1109\/CEC.2008.4630779"},{"issue":"3","key":"9255_CR29","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese, J.: Solution methods for the p-median problem: an annotated bibliography. Networks 48(3), 125\u2013142 (2006)","journal-title":"Networks"},{"key":"9255_CR30","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt, G.: TSPLIB-a traveling salesman problem library. ORSA J. Comput. 3, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"9255_CR31","doi-asserted-by":"crossref","unstructured":"Ren, Z., Jiang, H., Xuan, J., Hu, Y., Luo, Z.: New insights into diversification of hyper-heuristics. IEEE Trans. Cybern (in press) (2013)","DOI":"10.1109\/TCYB.2013.2294185"},{"issue":"4","key":"9255_CR32","doi-asserted-by":"crossref","first-page":"1187","DOI":"10.1109\/TSMCB.2012.2188100","volume":"42","author":"Z Ren","year":"2012","unstructured":"Ren, Z., Jiang, H., Xuan, J., Luo, Z.: An accelerated-limit-crossing-based multilevel algorithm for the p-median problem. IEEE Trans. Syst. Man Cybern. B 42(4), 1187\u20131202 (2012a)","journal-title":"IEEE Trans. Syst. Man Cybern. B"},{"issue":"2","key":"9255_CR33","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1162\/EVCO_a_00063","volume":"20","author":"Z Ren","year":"2012","unstructured":"Ren, Z., Jiang, H., Xuan, J., Luo, Z.: Hyper-heuristics with low level parameter adaptation. Evol. Comput. 20(2), 189\u2013227 (2012b)","journal-title":"Evol. Comput."},{"key":"9255_CR34","unstructured":"Resende, M.G., Werneck, R.F.: On the implementation of a swap-based local search procedure for the p-median problem. In: Proceedings of the Fifth Workshop on Algorithm Engineering and Experiments, pp. 119\u2013127 (2003)"},{"issue":"1","key":"9255_CR35","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1023\/B:HEUR.0000019986.96257.50","volume":"10","author":"MGC Resende","year":"2004","unstructured":"Resende, M.G.C., Werneck, R.F.: A hybrid heuristic for the p-median problem. J. Heuristics 10(1), 59\u201388 (2004)","journal-title":"J. Heuristics"},{"issue":"4","key":"9255_CR36","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s10732-010-9139-x","volume":"17","author":"A Riise","year":"2011","unstructured":"Riise, A., Burke, E.K.: Local search for the surgery admission planning problem. J. Heuristics 17(4), 389\u2013414 (2011)","journal-title":"J. Heuristics"},{"issue":"3","key":"9255_CR37","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1016\/S0377-2217(98)00268-9","volume":"117","author":"KE Rosing","year":"1999","unstructured":"Rosing, K.E., Revelle, C.S., Schilling, D.A.: A gamma heuristic for the p-median problem. Eur. J. Oper. Res. 117(3), 522\u2013532 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9255_CR38","volume-title":"Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research","author":"E Senne","year":"2000","unstructured":"Senne, E., Lorena, L.: Lagrangean\/surrogate heuristics for p-median problems. Computing Tools for Modeling, Optimization and Simulation: Interfaces in Computer Science and Operations Research. Kluwer Academic, Dordrecht (2000)"},{"issue":"1","key":"9255_CR39","first-page":"6:1","volume":"41","author":"KA Smith-Miles","year":"2009","unstructured":"Smith-Miles, K.A.: Cross-disciplinary perspectives on meta-learning for algorithm selection. ACM Comput. Surv. 41(1), 6:1\u20136:25 (2009)","journal-title":"ACM Comput. Surv."},{"issue":"5","key":"9255_CR40","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1287\/opre.16.5.955","volume":"16","author":"MB Teitz","year":"1968","unstructured":"Teitz, M.B., Bart, P.: Heuristic methods for estimating the generalized vertex median of a weighted graph. Oper. Res. 16(5), 955\u2013961 (1968)","journal-title":"Oper. Res."},{"issue":"2","key":"9255_CR41","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/s10732-008-9094-y","volume":"16","author":"CR Vela","year":"2010","unstructured":"Vela, C.R., Varela, R., Gonz\u00e1lez, M.A.: Local search and genetic algorithm for the job shop scheduling problem with sequence dependent setup times. J. Heuristics 16(2), 139\u2013165 (2010)","journal-title":"J. Heuristics"},{"issue":"2","key":"9255_CR42","first-page":"95","volume":"21","author":"R Whitaker","year":"1983","unstructured":"Whitaker, R.: A fast algorithm for the greedy interchange for large-scale clustering and median location problems. INFOR J. 21(2), 95\u2013108 (1983)","journal-title":"INFOR J."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9255-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-014-9255-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-014-9255-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T08:29:09Z","timestamp":1689409749000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-014-9255-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,17]]},"references-count":42,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["9255"],"URL":"https:\/\/doi.org\/10.1007\/s10732-014-9255-0","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,17]]}}}