{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:06:57Z","timestamp":1777597617641,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4-5","license":[{"start":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T00:00:00Z","timestamp":1540425600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71501157"],"award-info":[{"award-number":["71501157"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s10732-018-9398-5","type":"journal-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T06:26:14Z","timestamp":1540448774000},"page":"731-752","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An effective multi-wave algorithm for solving the max-mean dispersion problem"],"prefix":"10.1007","volume":"25","author":[{"given":"Jiawei","family":"Song","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,10,25]]},"reference":[{"issue":"2","key":"9398_CR1","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.ejor.2016.12.039","volume":"260","author":"Z Amirgaliyeva","year":"2017","unstructured":"Amirgaliyeva, Z., Mladenovi\u0107, N., Todosijevi\u0107, R.: Solving the maximum min-sum dispersion by alternating formulations of two different problems. Eur. J. Oper. Res. 260(2), 444\u2013459 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9398_CR2","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1057\/jors.2010.104","volume":"62","author":"R Aringhieri","year":"2011","unstructured":"Aringhieri, R., Cordone, R.: Comparing local search metaheuristics for the maximum diversity problem. J. Oper. Res. Soc. 62, 266\u2013280 (2011)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"9398_CR3","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10288-007-0033-9","volume":"6","author":"R Aringhieri","year":"2008","unstructured":"Aringhieri, R., Cordone, R., Melzani, Y.: Tabu Search versus GRASP for the maximum diversity problem. 4OR 6(1), 45\u201360 (2008)","journal-title":"4OR"},{"issue":"1","key":"9398_CR4","first-page":"1","volume":"242","author":"R Aringhieri","year":"2014","unstructured":"Aringhieri, R., Cordone, R., Grosso, A.: Construction and improvement algorithms for dispersion problems. Eur. J. Oper. Res. 242(1), 1\u201313 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"9398_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.ins.2016.12.021","volume":"382","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: solving the max-mean diversity problem with variable neighborhood search. Inf. Sci. 382, 179\u2013200 (2017)","journal-title":"Inf. Sci."},{"issue":"2","key":"9398_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s11590-015-0973-5","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg, J., Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: A basic variable neighborhood search heuristic for the uncapacitated multiple allocation phub center problem. Optim. Lett. 11(2), 313\u2013327 (2017)","journal-title":"Optim. Lett."},{"key":"9398_CR7","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/j.knosys.2015.05.011","volume":"85","author":"R Carrasco","year":"2015","unstructured":"Carrasco, R., Pham, A., Gallego, M., Gort\u00e1zar, F., Mart\u00ed, R., Duarte, A.: Tabu search for the MaxCMean dispersion problem. Knowl.-Based Syst. 85, 256\u2013264 (2015)","journal-title":"Knowl.-Based Syst."},{"issue":"8","key":"9398_CR8","doi-asserted-by":"publisher","first-page":"2429","DOI":"10.1016\/j.cor.2008.09.007","volume":"36","author":"CF Della","year":"2009","unstructured":"Della, C.F., Grosso, A., Locatelli, M.: A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. 36(8), 2429\u20132433 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9398_CR9","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.cor.2016.01.003","volume":"71","author":"CF Della","year":"2016","unstructured":"Della, C.F., Garraffa, M., Salassa, F.: A hybrid three-phase approach for the max-mean dispersion problem. Comput. Oper. Res. 71, 16\u201322 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"9398_CR10","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.ejor.2006.01.021","volume":"178","author":"A Duarte","year":"2007","unstructured":"Duarte, A., Mart\u00ed, R.: Tabu search and grasp for the maximum diversity problem. Eur. J. Oper. Res. 178(1), 71\u201384 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"9398_CR11","first-page":"46","volume":"296","author":"A Duarte","year":"2014","unstructured":"Duarte, A., S\u00e1nchez-Oro, J., Resende, M.G.C., Glover, F., Mart\u00ed, R.: Greedy randomized search procedure with exterior path relinking for differential dispersion minimization. Inf. Sci. 296(1), 46\u201360 (2014)","journal-title":"Inf. Sci."},{"issue":"1","key":"9398_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10479-011-0983-3","volume":"191","author":"P Galinier","year":"2011","unstructured":"Galinier, P., Boujbel, Z., Fernandes, M.C.: An efficient memetic algorithm for the graph partitioning problem. Ann. Oper. Res. 191(1), 1\u201322 (2011)","journal-title":"Ann. Oper. Res."},{"key":"9398_CR13","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10732-016-9312-y","volume":"22","author":"F Glover","year":"2016","unstructured":"Glover, F.: Multi-wave algorithms for metaheuristic optimization. J. Heurist. 22, 331\u2013358 (2016)","journal-title":"J. Heurist."},{"issue":"1","key":"9398_CR14","first-page":"109","volume":"19","author":"F Glover","year":"1998","unstructured":"Glover, F., Kuo, C.C., Dhir, K.S.: Heuristic algorithms for the maximum diversity problem. J. Inf. Optim. Sci. 19(1), 109\u2013132 (1998)","journal-title":"J. Inf. Optim. Sci."},{"key":"9398_CR15","doi-asserted-by":"crossref","unstructured":"Kerchove, C., Dooren, P.V.: The page trust algorithm: how to rank web pages when negative links are allowed? In: Proceedings SIAM International Conference on Data Mining, pp. 346\u2013352 (2008)","DOI":"10.1137\/1.9781611972788.31"},{"key":"9398_CR16","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1016\/j.cor.2016.02.016","volume":"72","author":"X Lai","year":"2016","unstructured":"Lai, X., Hao, J.K.: A tabu based memetic algorithm for the max-mean dispersion problem. Comput. Oper. Res. 72, 118\u2013127 (2016)","journal-title":"Comput. Oper. Res."},{"key":"9398_CR17","doi-asserted-by":"publisher","first-page":"3091","DOI":"10.1016\/j.cor.2012.04.005","volume":"40","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Sandoya, F.: GRASP and path relinking for the equitable dispersion problem. Comput. Oper. Res. 40, 3091\u20133099 (2013)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"9398_CR18","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/s10732-011-9172-4","volume":"19","author":"R Mart\u00ed","year":"2013","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A., Pardo, E.G.: Heuristics and metaheuristics for the maximum diversity problem. J. Heurist. 19(4), 591\u2013615 (2013)","journal-title":"J. Heurist."},{"key":"9398_CR19","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1016\/j.ins.2015.07.044","volume":"326","author":"N Mladenovi\u0107","year":"2016","unstructured":"Mladenovi\u0107, N., Todosijevi\u0107, R., Uro\u0161evi\u0107, D.: Less is more: basic variable neighborhood search for minimum differential dispersion problem. Inf. Sci. 326, 160\u2013171 (2016)","journal-title":"Inf. Sci."},{"issue":"1","key":"9398_CR20","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/s10479-011-0898-z","volume":"186","author":"DC Porumbel","year":"2011","unstructured":"Porumbel, D.C., Hao, J.K., Glover, F.: A simple and effective algorithm for the MaxMin diversity problem. Ann. Oper. Res. 186(1), 275\u2013293 (2011)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"9398_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","volume":"197","author":"OA Prokopyev","year":"2009","unstructured":"Prokopyev, O.A., Kong, N., Martinez-Torres, D.L.: The equitable dispersion problem. Eur. J. Oper. Res. 197(1), 59\u201367 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9398_CR22","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/j.cor.2008.05.011","volume":"37","author":"MGC Resende","year":"2010","unstructured":"Resende, M.G.C., Mart, R., Gallego, M., Duarte, A.: GRASP and path relinking for the max-min diversity problem. Comput. Oper. Res. 37(3), 498\u2013508 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9398_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/978-3-540-24838-5_37","volume-title":"Experimental and Efficient Algorithms","author":"GC Silver","year":"2004","unstructured":"Silver, G.C., Ochi, L.S., Martins, S.L.: Experimental comparisons of greedy randomized adaptive search procedures for the maximum diversity problem. In: Ribeiro, C.C., Martins, S.L. (eds.) Experimental and Efficient Algorithms. Lecture Notes in Computer Science, vol. 3059, pp. 498\u2013512. Springer, Angra dos Reis, Brazil (2004)"},{"key":"9398_CR24","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.engappai.2013.09.005","volume":"27","author":"Y Wang","year":"2014","unstructured":"Wang, Y., Hao, J.K., Glover, F., L\u00fc, Z.: A tabu search based memetic search for the maximum diversity problem. Eng. Appl. Artif. Intell. 27, 103\u2013114 (2014)","journal-title":"Eng. Appl. Artif. Intell."},{"key":"9398_CR25","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2016.10.035","volume":"258","author":"Y Wang","year":"2017","unstructured":"Wang, Y., Wu, Q., Glover, F.: Effective metaheuristic algorithms for the minimum differential dispersion problem. Eur. J. Oper. Res. 258, 829\u2013843 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"9398_CR26","doi-asserted-by":"crossref","unstructured":"Wilson, T., Wiebe, J., Hoffmann, P.: Recognizing contextual polarity in phrase-level sentiment analysis, In: Proceedings of the Conference on Human Language Technology and Empirical Methods in Natural Language Processing, pp. 347\u2013354 (2005)","DOI":"10.3115\/1220575.1220619"},{"issue":"10","key":"9398_CR27","doi-asserted-by":"publisher","first-page":"1333","DOI":"10.1109\/TKDE.2007.1061","volume":"19","author":"B Yang","year":"2007","unstructured":"Yang, B., Cheung, W., Liu, J.: Community mining from signed social networks. IEEE Trans. Knowl. Data Eng. 19(10), 1333\u20131348 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9398-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-018-9398-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-018-9398-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,19]],"date-time":"2020-01-19T00:32:59Z","timestamp":1579393979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-018-9398-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,25]]},"references-count":27,"journal-issue":{"issue":"4-5","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["9398"],"URL":"https:\/\/doi.org\/10.1007\/s10732-018-9398-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,10,25]]},"assertion":[{"value":"15 August 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 October 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 October 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}