{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:37:31Z","timestamp":1767137851488,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_16","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"186-197","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A Hybrid Heuristic Approach Based on a Quadratic Knapsack Formulation for the Max-Mean Dispersion Problem"],"prefix":"10.1007","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[]},{"given":"Michele","family":"Garraffa","sequence":"additional","affiliation":[]},{"given":"Fabio","family":"Salassa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"2429","DOI":"10.1016\/j.cor.2008.09.007","volume":"36","author":"F Della Croce","year":"2009","unstructured":"Della Croce, F., Grosso, A., Locatelli, M.: A heuristic approach for the max-min diversity problem based on max-clique. Comput. Oper. Res. 36, 2429\u20132433 (2009)","journal-title":"Comput. Oper. Res."},{"key":"16_CR2","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.: Local branching. Math. Program. 98, 23\u201347 (2003)","journal-title":"Math. Program."},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1016\/0167-6377(96)00025-9","volume":"19","author":"JB Ghosh","year":"1996","unstructured":"Ghosh, J.B.: Computational aspects of the maximum diversity problem. Oper. Res. Lett. 19, 175\u2013181 (1996)","journal-title":"Oper. Res. Lett."},{"key":"16_CR4","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."},{"key":"16_CR5","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem - a survey. Discrete Appl. Math. 155, 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"key":"16_CR6","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, 59\u201367 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR7","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\u00ed, R., Gallego, M., Duarte, A.: GRASP and path relinking for the maxmin diversity problem. Comput. Oper. Res. 37, 498\u2013508 (2010)","journal-title":"Comput. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:09:47Z","timestamp":1703192987000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":7,"aliases":["10.1007\/978-3-319-14115-2_16"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}