{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,12]],"date-time":"2025-10-12T19:55:33Z","timestamp":1760298933947},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,25]],"date-time":"2014-05-25T00:00:00Z","timestamp":1400976000000},"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":[[2015,1]]},"DOI":"10.1007\/s11590-014-0754-6","type":"journal-article","created":{"date-parts":[[2014,5,24]],"date-time":"2014-05-24T20:24:35Z","timestamp":1400963075000},"page":"199-207","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Redundant constraints in the standard formulation for the clique partitioning problem"],"prefix":"10.1007","volume":"9","author":[{"given":"Atsushi","family":"Miyauchi","sequence":"first","affiliation":[]},{"given":"Noriyoshi","family":"Sukegawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,25]]},"reference":[{"key":"754_CR1","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1140\/epjb\/e2008-00425-1","volume":"66","author":"G Agarwal","year":"2008","unstructured":"Agarwal, G., Kempe, D.: Modularity-maximizing graph communities via mathematical programming. Eur. Phys. J. B 66, 409\u2013418 (2008)","journal-title":"Eur. Phys. J. B"},{"key":"754_CR2","doi-asserted-by":"crossref","first-page":"046112","DOI":"10.1103\/PhysRevE.82.046112","volume":"82","author":"D Aloise","year":"2010","unstructured":"Aloise, D., Cafieri, S., Caporossi, G., Hansen, P., Liberti, L., Perron, S.: Column generation algorithms for exact modularity maximization in networks. Phys. Rev. E 82, 046112 (2010)","journal-title":"Phys. Rev. E"},{"key":"754_CR3","unstructured":"Blake, C.L., Merz, C.J.: UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences (1998). http:\/\/archive.ics.uci.edu\/ml\/ . Accessed 17 Apr 2014"},{"key":"754_CR4","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, 685\u2013703 (2009)","journal-title":"Psychometrika"},{"key":"754_CR5","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0278-6125(82)80068-X","volume":"1","author":"HM Chan","year":"1982","unstructured":"Chan, H.M., Milner, D.A.: Direct clustering algorithm for group formulation in cellular manufacturing. J. Manuf. Syst. 1, 65\u201374 (1982)","journal-title":"J. Manuf. Syst."},{"key":"754_CR6","unstructured":"Dinh, T.N., Thai, M.T.: Towards optimal community detection: From trees to general weighted networks, Internet Math. (accepted pending revision)"},{"key":"754_CR7","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45, 59\u201396 (1989)","journal-title":"Math. Program."},{"key":"754_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0305-0483(80)90023-7","volume":"8","author":"KR King","year":"1980","unstructured":"King, K.R.: Machine component group formation in group technology. Omega 8, 193\u2013199 (1980)","journal-title":"Omega"},{"key":"754_CR9","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(86)90032-9","volume":"24","author":"RK Kumar","year":"1986","unstructured":"Kumar, R.K., Kusiak, A., Vannelli, A.: Grouping of parts and components in flexible manufacturing systems. Eur. J. Oper. Res. 24, 387\u2013397 (1986)","journal-title":"Eur. J. Oper. Res."},{"key":"754_CR10","first-page":"837","volume":"34","author":"B Malakooti","year":"2002","unstructured":"Malakooti, B., Yang, Z.: Multiple criteria approach and generation of efficient alternatives for machine-part family formulation in group technology. IIE Trans. 34, 837\u2013846 (2002)","journal-title":"IIE Trans."},{"key":"754_CR11","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/0272-6963(91)90035-V","volume":"10","author":"J Miltenburg","year":"1991","unstructured":"Miltenburg, J., Zhang, W.: A comparative evaluation of nine well-known algorithms for solving the cell formation in group technology. J. Oper. Manag. 10, 44\u201372 (1991)","journal-title":"J. Oper. Manag."},{"key":"754_CR12","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1140\/epjb\/e2013-40006-7","volume":"86","author":"A Miyauchi","year":"2013","unstructured":"Miyauchi, A., Miyamoto, Y.: Computing an upper bound of modularity. Eur. Phys. J. B 86, 302 (2013)","journal-title":"Eur. Phys. J. B"},{"key":"754_CR13","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, 209\u2013226 (2001)","journal-title":"Networks"},{"key":"754_CR14","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ejor.2003.07.005","volume":"160","author":"DF Rogers","year":"2005","unstructured":"Rogers, D.F., Kulkarni, S.S.: Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing. Eur. J. Oper. Res. 160, 423\u2013444 (2005)","journal-title":"Eur. J. Oper. Res."},{"key":"754_CR15","unstructured":"Wakabayashi, Y.: Aggregation of binary relations: algorithmic and polyhedral investigations, Ph.D. Thesis, Universit\u00e4t Augsburg (1986)"},{"key":"754_CR16","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10878-005-1861-1","volume":"10","author":"H Wang","year":"2005","unstructured":"Wang, H., Alidaee, B., Glover, F., Kochenberger, G.: Clustering of microarray data via clique partitioning. J. Comb. Optim. 10, 77\u201392 (2005)","journal-title":"J. Comb. Optim."},{"key":"754_CR17","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."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0754-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-014-0754-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-014-0754-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:38Z","timestamp":1559409098000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-014-0754-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,25]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["754"],"URL":"https:\/\/doi.org\/10.1007\/s11590-014-0754-6","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,25]]}}}