{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:08:33Z","timestamp":1725905313117},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319557014"},{"type":"electronic","value":"9783319557021"}],"license":[{"start":{"date-parts":[[2017,7,21]],"date-time":"2017-07-21T00:00:00Z","timestamp":1500595200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-55702-1_54","type":"book-chapter","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:21:16Z","timestamp":1500546076000},"page":"405-410","source":"Crossref","is-referenced-by-count":1,"title":["A Heuristic for Solving the Maximum Dispersion Problem"],"prefix":"10.1007","author":[{"given":"Mahdi","family":"Moeini","sequence":"first","affiliation":[]},{"given":"Oliver","family":"Wendt","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,21]]},"reference":[{"issue":"4","key":"54_CR1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1057\/palgrave.jors.2601307","volume":"53","author":"KR Baker","year":"2002","unstructured":"Baker, K.R., Powell, S.G.: Methods for assigning students to groups: a study of alternative objective functions. J. Oper. Res. Soc. 53(4), 397\u2013404 (2002)","journal-title":"J. Oper. Res. Soc."},{"key":"54_CR2","doi-asserted-by":"crossref","first-page":"650","DOI":"10.1016\/j.ins.2014.10.043","volume":"295","author":"J Brimberg","year":"2015","unstructured":"Brimberg, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf. Sci. 295, 650\u2013675 (2015)","journal-title":"Inf. Sci."},{"issue":"1","key":"54_CR3","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0377-2217(90)90297-O","volume":"46","author":"E Erkut","year":"1990","unstructured":"Erkut, E.: The discrete p-dispersion problem. Eur. J. Oper. Res. 46(1), 48\u201360 (1990)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"54_CR4","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.2009.70","volume":"61","author":"E Fern\u00e1ndez","year":"2010","unstructured":"Fern\u00e1ndez, E., Kalcsics, J., Nickel, S., R\u00edos-Mercado, R.Z.: A novel maximum dispersion territory design model arising in the implementation of the WEEE-directive. J. Oper. Res. Soc. 61(3), 503\u2013514 (2010)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"54_CR5","doi-asserted-by":"crossref","first-page":"721","DOI":"10.1016\/j.omega.2012.09.005","volume":"41","author":"E Fern\u00e1ndez","year":"2013","unstructured":"Fern\u00e1ndez, E., Kalcsics, J., Nickel, S.: The maximum dispersion problem. Omega 41(4), 721\u2013730 (2013)","journal-title":"Omega"},{"issue":"11","key":"54_CR6","doi-asserted-by":"crossref","first-page":"696","DOI":"10.1016\/0307-904X(95)00083-V","volume":"19","author":"F Glover","year":"2010","unstructured":"Glover, F., Ching-Chung, K., Dhir, K.: A discrete optimization model for preserving biological diversity. Appl. Math. Modell. 19(11), 696\u2013701 (2010)","journal-title":"Appl. Math. Modell."},{"key":"54_CR7","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Glover, F., Knochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145\u2013184. Kluwer Academic Publisher (2003)","DOI":"10.1007\/0-306-48056-5_6"},{"issue":"1","key":"54_CR8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1016\/j.ejor.2008.12.023","volume":"200","author":"R Mart\u00ed","year":"2010","unstructured":"Mart\u00ed, R., Gallego, M., Duarte, A.: A branch and bound algorithm for the maximum diversity problem. Eur. J. Oper. Res. 200(1), 36\u201344 (2010)","journal-title":"Eur. J. Oper. Res."},{"issue":"11","key":"54_CR9","doi-asserted-by":"crossref","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."},{"issue":"4","key":"54_CR10","first-page":"277","volume":"40","author":"G Palubeckis","year":"2011","unstructured":"Palubeckis, G., Kar\u010diauskas, E., Ri\u0161kus, A.: Comperative performance of three metaheuristic approaches for the maximally diverse grouping problem. Inf. Technol. Control 40(4), 277\u2013285 (2011)","journal-title":"Inf. Technol. Control"},{"issue":"1","key":"54_CR11","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/j.ejor.2008.06.005","volume":"197","author":"O Prokopyev","year":"2009","unstructured":"Prokopyev, O., Kong, N., Martinez-Torres, D.: The equitable dispersion problem. Eur. J. Oper. Res. 197(1), 59\u201367 (2009)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2016"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-55702-1_54","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T10:33:56Z","timestamp":1500546836000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-55702-1_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,21]]},"ISBN":["9783319557014","9783319557021"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-55702-1_54","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017,7,21]]}}}