{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T06:23:15Z","timestamp":1782973395972,"version":"3.54.5"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,3,4]],"date-time":"2015-03-04T00:00:00Z","timestamp":1425427200000},"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":["Optim Lett"],"published-print":{"date-parts":[[2017,8]]},"DOI":"10.1007\/s11590-015-0869-4","type":"journal-article","created":{"date-parts":[[2015,3,2]],"date-time":"2015-03-02T18:14:54Z","timestamp":1425320094000},"page":"1123-1135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Solving the clique partitioning problem as a maximally diverse grouping problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Jack","family":"Brimberg","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefana","family":"Jani\u0107ijevi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nenad","family":"Mladenovi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dragan","family":"Uro\u0161evi\u0107","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,3,4]]},"reference":[{"key":"869_CR1","doi-asserted-by":"crossref","unstructured":"Brimberg, J., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inform Sci 295, 650\u2013675 (2015)","DOI":"10.1016\/j.ins.2014.10.043"},{"issue":"4","key":"869_CR2","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s11336-009-9126-z","volume":"74","author":"MJ Brusco","year":"2009","unstructured":"Brusco, M.J., K\u00f6hn, H.-F.: Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem. Psychometrika 74(4), 685\u2013703 (2009)","journal-title":"Psychometrika"},{"issue":"5","key":"869_CR3","doi-asserted-by":"crossref","first-page":"754","DOI":"10.1016\/j.dam.2005.05.029","volume":"154","author":"I Charon","year":"2006","unstructured":"Charon, I., Hudry, O.: Noising methods for a clique partitioning problem. Discrete Appl. Math. 154(5), 754\u2013769 (2006)","journal-title":"Discrete Appl. Math."},{"key":"869_CR4","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02618466","volume":"9","author":"SG Amorim De","year":"1992","unstructured":"De Amorim, S.G., Barth\u00e9lemy, J.P., Ribeiro, C.C.: Clustering and clique partitioning: simulated annealing and tabu search approaches. J. Classif. 9, 17\u201341 (1992)","journal-title":"J. Classif."},{"key":"869_CR5","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1057\/palgrave.jors.2601775","volume":"56","author":"J Desrosiers","year":"2005","unstructured":"Desrosiers, J., Mladenovi\u0107, N., Villeneuve, D.: Design of balanced MBA student teams. J. Oper. Res. Soc. 56, 60\u201366 (2005)","journal-title":"J. Oper. Res. Soc."},{"key":"869_CR6","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighbourhood search. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"869_CR7","unstructured":"Hettich, S., Pazzani, M.J.: Min lessons learned at the national science foundation. In: Proceedings of the KDD\u201906, pp. 862\u2013871. ACM, New York (2006)"},{"key":"869_CR8","first-page":"116","volume":"2","author":"J Kral","year":"1965","unstructured":"Kral, J.: To the problem of segmentation of a program. Inf. Process. Mach. 2, 116\u2013127 (1965)","journal-title":"Inf. Process. Mach."},{"key":"869_CR9","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1057\/jors.1991.42","volume":"42","author":"V Lotfi","year":"1991","unstructured":"Lotfi, V., Cerveny, R.: A final exam scheduling package. J. Oper. Res. Soc. 42, 205\u2013216 (1991)","journal-title":"J. Oper. Res. Soc."},{"key":"869_CR10","first-page":"395","volume":"43","author":"F Marcotorchino","year":"1981","unstructured":"Marcotorchino, F., Michaud, P.: Heuristic approach to the similarity aggregation problem. Methods Oper. Res. 43, 395\u2013404 (1981)","journal-title":"Methods Oper. Res."},{"key":"869_CR11","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, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"869_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten, M., Rutten, J.H.G.C., Spieksma, F.C.R.: The clique partitioning problem: facets and patching facets. Networks 38(4), 209\u2013226 (2001)","journal-title":"Networks"},{"key":"869_CR13","first-page":"175","volume":"4","author":"S R\u00e9gnier","year":"1965","unstructured":"R\u00e9gnier, S.: Sur quelques aspects math\u00e9matiques des probl\u00e8mes de classification automatique. I.C.C. Bulletin 4, 175\u2013191 (1965)","journal-title":"I.C.C. Bulletin"},{"issue":"1","key":"869_CR14","doi-asserted-by":"crossref","first-page":"21","DOI":"10.2298\/YJOR121223003U","volume":"24","author":"D Uro\u0161evi\u0107","year":"2014","unstructured":"Uro\u0161evi\u0107, D.: Variable neighborhood search for maximum diverse grouping problem. Yugosl. J. Oper. Res. 24(1), 21\u201333 (2014)","journal-title":"Yugosl. J. Oper. Res."},{"key":"869_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10696-006-9011-3","volume":"18","author":"H Wang","year":"2006","unstructured":"Wang, H., Alidaee, B., Glover, F., Kochenberger, G.: Solving group technology problems via clique partitioning. Int. J. Flex. Manuf. Syst. 18, 77\u201397 (2006)","journal-title":"Int. J. Flex. Manuf. Syst."},{"key":"869_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/03610910701723559","volume":"37","author":"H Wang","year":"2008","unstructured":"Wang, H., Obremski, T., Alidaee, B., Kochenberger, G.: Clique partitioning for clustering: a comparison with \n                        $$k$$\n                        \n                            \n                                            \n                                k\n                            \n                        \n                    -means and latent class analysis. Commun. Stat. Simul. Comput. 37, 1\u201313 (2008)","journal-title":"Commun. Stat. Simul. Comput."},{"issue":"4","key":"869_CR17","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1016\/S0305-0483(97)00007-8","volume":"25","author":"RR Weitz","year":"1997","unstructured":"Weitz, R.R., Lakshminarayanan, S.: An empirical comparison of heuristic and graph theoretic methods for creating maximally diverse groups, VLSI design, and exam scheduling. Omega 25(4), 473\u2013482 (1997)","journal-title":"Omega"},{"issue":"6","key":"869_CR18","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1057\/palgrave.jors.2600510","volume":"49","author":"RR Weitz","year":"1998","unstructured":"Weitz, R.R., Lakshminarayanan, S.: An empirical comparison of heuristic methods for creating maximally diverse groups. J. Oper. Res. Soc. 49(6), 635\u2013646 (1998)","journal-title":"J. Oper. Res. Soc."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0869-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0869-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0869-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0869-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T13:11:41Z","timestamp":1559394701000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0869-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,4]]},"references-count":18,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2017,8]]}},"alternative-id":["869"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0869-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,4]]}}}