{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:53:09Z","timestamp":1760597589609},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,5,30]],"date-time":"2013-05-30T00:00:00Z","timestamp":1369872000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Adv Data Anal Classif"],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1007\/s11634-013-0135-5","type":"journal-article","created":{"date-parts":[[2013,5,29]],"date-time":"2013-05-29T11:26:32Z","timestamp":1369826792000},"page":"363-391","source":"Crossref","is-referenced-by-count":9,"title":["Lagrangian relaxation and pegging test for the clique partitioning problem"],"prefix":"10.1007","volume":"7","author":[{"given":"Noriyoshi","family":"Sukegawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshitsugu","family":"Yamamoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Liyuan","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,5,30]]},"reference":[{"key":"135_CR1","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1287\/opre.44.6.875","volume":"44","author":"E Balas","year":"1996","unstructured":"Balas E, Carrera MC (1996) A dynamic subgradient-based branch-and-bound procedure for set covering. Oper Res 44:875\u2013890","journal-title":"Oper Res"},{"key":"135_CR2","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1007\/s11336-009-9126-z","volume":"74","author":"MJ Brusco","year":"2009","unstructured":"Brusco MJ, K\u00f6hn HF (2009) Clustering qualitative data based on binary equivalence relations: neighborhood search heuristics for the clique partitioning problem. Psychometrika 74:685\u2013703","journal-title":"Psychometrika"},{"key":"135_CR3","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0272-6963(91)90033-T","volume":"10","author":"JL Burbidge","year":"1991","unstructured":"Burbidge JL (1991) Production flow analysis for planning group technology. J Oper Manag 10:5\u201327","journal-title":"J Oper Manag"},{"key":"135_CR4","doi-asserted-by":"crossref","unstructured":"Chan HM, Milner DA (1982) Direct clustering algorithm for group formation in cellular manufacturing. J Manuf Syst 1:65\u201374","DOI":"10.1016\/S0278-6125(82)80068-X"},{"key":"135_CR5","doi-asserted-by":"crossref","unstructured":"Charon I, Hudry O (2006) Noising methods for a clique partitioning problem. Discret Appl Math 154: 754\u2013769","DOI":"10.1016\/j.dam.2005.05.029"},{"key":"135_CR6","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1287\/trsc.1070.0211","volume":"42","author":"U Dorndorf","year":"2008","unstructured":"Dorndorf U, Jaehn F, Pesch E (2008) Modeling robust flight-gate scheduling as a clique partitioning problem. Transp Sci 42:292\u2013301","journal-title":"Transp Sci"},{"key":"135_CR7","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/ijoc.6.2.141","volume":"6","author":"U Dorndorf","year":"1994","unstructured":"Dorndorf U, Pesch E (1994) Fast Clustering Algorithms. ORSA J Comput 6:141\u2013153","journal-title":"ORSA J Comput"},{"key":"135_CR8","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02618466","volume":"9","author":"SG Amorim De","year":"1992","unstructured":"De Amorim SG, Barth\u00e9lemy J-P, Riberio CC (1992) Clustering and clique partitioning: simulated annealing and tabu search approaches. J Classif 9:17\u201341","journal-title":"J Classif"},{"key":"135_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"ML Fisher","year":"1981","unstructured":"Fisher ML (1981) The Lagrangian relaxation method for solving integer programming problems. Manag Sci 27:1\u201318","journal-title":"Manag Sci"},{"key":"135_CR10","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"AM Geoffrion","year":"1974","unstructured":"Geoffrion AM (1974) Lagrangian relaxation for integer programming. Math Program Study 2:82\u2013114","journal-title":"Math Program Study"},{"key":"135_CR11","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 (1989) A cutting plane algorithm for a clustering problem. Math Program 45:59\u201396","journal-title":"Math Program"},{"key":"135_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/s11634-011-0087-6","volume":"5","author":"A Gu\u00e9noche","year":"2011","unstructured":"Gu\u00e9noche A (2011) Consensus of partitions : a constructive approach. Adv Data Anal Classif 5:215\u2013229","journal-title":"Adv Data Anal Classif"},{"key":"135_CR13","doi-asserted-by":"crossref","unstructured":"Jaehn F, Pesch E (2013) New bounds and constraint propagation techniques for clique partitioning problem. Discret Appl Math. doi: 10.1016\/j.dam.2013.02.011","DOI":"10.1016\/j.dam.2013.02.011"},{"key":"135_CR14","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0305-0483(80)90023-7","volume":"8","author":"JR King","year":"1980","unstructured":"King JR (1980) Machine component group formation in group technology. Omega 8:193\u2013199","journal-title":"Omega"},{"key":"135_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10878-005-1861-1","volume":"10","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, Wang H (2005) Clustering of microarray data via clique partitioning. J Comb Optim 10:77\u201392","journal-title":"J Comb Optim"},{"key":"135_CR16","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(86)90032-9","volume":"24","author":"RK Kumar","year":"1986","unstructured":"Kumar RK, Kusiak A, Vannelli A (1986) Grouping of parts and components in flexible manufacturing systems. Eur J Oper Res 24:387\u2013397","journal-title":"Eur J Oper Res"},{"key":"135_CR17","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0377-2217(94)00200-2","volume":"88","author":"T Larsson","year":"1996","unstructured":"Larsson T, Patriksson M, Str\u00f6mberg A-B (1996) Conditional subgradient optimization\u2014theory and applications. Eur J Oper Res 88:382\u2013403","journal-title":"Eur J Oper Res"},{"key":"135_CR18","first-page":"837","volume":"34","author":"B Malakooti","year":"2002","unstructured":"Malakooti B, Yang Z (2002) Multiple criteria approach and generation of efficient alternatives for machine-part family formation in group technology. IIE Trans 34:837\u2013846","journal-title":"IIE Trans"},{"key":"135_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","volume":"22","author":"A Mehrotra","year":"1998","unstructured":"Mehrotra A, Trick MA (1998) Cliques and clustering: a combinatorial approach. Oper Res Lett 22:1\u201312","journal-title":"Oper Res Lett"},{"key":"135_CR20","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 (1991) A comparative evaluation of nine well-known algorithms for solving the cell formation in group technology. J Oper Manag 10:44\u201372","journal-title":"J Oper Manag"},{"key":"135_CR21","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"RM Nauss","year":"1976","unstructured":"Nauss RM (1976) An efficient algorithm for the 0\u20131 knapsack problem. Manag Sci 23:27\u201331","journal-title":"Manag Sci"},{"key":"135_CR22","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten M, Rutten JHGC, Spieksma FCR (2001) The clique partitioning problem: facets and patching facets. Networks 38:209\u2013226","journal-title":"Networks"},{"key":"135_CR23","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.ejor.2003.07.005","volume":"160","author":"DF Rogers","year":"2005","unstructured":"Rogers DF, Kulkarni SS (2005) Optimal bivariate clustering and a genetic algorithm with an application in cellular manufacturing. Eur J Oper Res 160:423\u2013444","journal-title":"Eur J Oper Res"},{"key":"135_CR24","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 (2006) Solving group technology problems via clique partitioning. Int J Flex Manuf Syst 18:77\u201397","journal-title":"Int J Flex Manuf Syst"},{"key":"135_CR25","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1016\/j.ejor.2006.10.031","volume":"183","author":"B You","year":"2007","unstructured":"You B, Yamada T (2007) A pegging approach to the precedence-constrained knapsack problem. Eur J Oper Res 183:618\u2013632","journal-title":"Eur J Oper Res"}],"container-title":["Advances in Data Analysis and Classification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-013-0135-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11634-013-0135-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11634-013-0135-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T18:46:34Z","timestamp":1559414794000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11634-013-0135-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5,30]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,12]]}},"alternative-id":["135"],"URL":"https:\/\/doi.org\/10.1007\/s11634-013-0135-5","relation":{},"ISSN":["1862-5347","1862-5355"],"issn-type":[{"value":"1862-5347","type":"print"},{"value":"1862-5355","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,5,30]]}}}