{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T01:52:23Z","timestamp":1717293143661},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T00:00:00Z","timestamp":1597708800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["Nos. 61806082 and 61503074"],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Jilin education department 13th five-year science and technology project","award":["JJKH20190726KJ","JJKH20190- 756SK","JJKH20180465KJ"]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Neural Comput & Applic"],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s00521-020-05289-5","type":"journal-article","created":{"date-parts":[[2020,8,18]],"date-time":"2020-08-18T05:02:56Z","timestamp":1597726976000},"page":"4929-4944","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A novel two-model local search algorithm with a self-adaptive parameter for clique partitioning problem"],"prefix":"10.1007","volume":"33","author":[{"given":"Shuli","family":"Hu","sequence":"first","affiliation":[]},{"given":"Xiaoli","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Huan","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Ruizhi","family":"Li","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"issue":"9","key":"5289_CR1","doi-asserted-by":"publisher","first-page":"2935","DOI":"10.1007\/s00521-017-2880-4","volume":"30","author":"MM Alipour","year":"2018","unstructured":"Alipour MM, Razavi SN, Derakhshi MRF, Balafar MA (2018) A hybrid algorithm using a genetic algorithm and multiagent reinforcement learning heuristic to solve the traveling salesman problem. Neural Comput Appl 30(9):2935\u20132951","journal-title":"Neural Comput Appl"},{"key":"5289_CR2","doi-asserted-by":"publisher","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 (2015) Solving the maximally diverse grouping problem by skewed general variable neighborhood search. Inf Sci 295:650\u2013675","journal-title":"Inf Sci"},{"issue":"6","key":"5289_CR3","doi-asserted-by":"publisher","first-page":"1123","DOI":"10.1007\/s11590-015-0869-4","volume":"11","author":"J Brimberg","year":"2017","unstructured":"Brimberg J, Jani\u0107ijevi\u0107 S, Mladenovi\u0107 N, Uro\u0161evi\u0107 D (2017) Solving the clique partitioning problem as a maximally diverse grouping problem. Optim Lett 11(6):1123\u20131135","journal-title":"Optim Lett"},{"issue":"4","key":"5289_CR4","doi-asserted-by":"publisher","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(4):685","journal-title":"Psychometrika"},{"issue":"5","key":"5289_CR5","doi-asserted-by":"publisher","first-page":"754","DOI":"10.1016\/j.dam.2005.05.029","volume":"154","author":"I Charon","year":"2006","unstructured":"Charon I, Hudry O (2006) Noising methods for a clique partitioning problem. Discret Appl Math 154(5):754\u2013769","journal-title":"Discret Appl Math"},{"key":"5289_CR6","doi-asserted-by":"crossref","unstructured":"Charon I, Hudry O (2007) Application of the\u201c descent with mutations\u201d metaheuristic to a clique partitioning problem. In: 2007 IEEE international conference on research. Innovation and vision for the future, IEEE, pp 29\u201335","DOI":"10.1109\/RIVF.2007.369132"},{"issue":"1","key":"5289_CR7","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/BF02618466","volume":"9","author":"SG De Amorim","year":"1992","unstructured":"De Amorim SG, Barth\u00e9lemy JP, Ribeiro CC (1992) Clustering and clique partitioning: simulated annealing and Tabu search approaches. J Classif 9(1):17\u201341","journal-title":"J Classif"},{"issue":"2","key":"5289_CR8","doi-asserted-by":"publisher","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(2):141\u2013153","journal-title":"ORSA J Comput."},{"issue":"3","key":"5289_CR9","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1287\/trsc.1070.0211","volume":"42","author":"U Dorndorf","year":"2008","unstructured":"Dorndorf U, Jaehn F, Pesch E (2008) Modelling robust flight-gate scheduling as a clique partitioning problem. Transp Sci 42(3):292\u2013301","journal-title":"Transp Sci"},{"issue":"1","key":"5289_CR10","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10479-010-0809-8","volume":"194","author":"U Dorndorf","year":"2012","unstructured":"Dorndorf U, Jaehn F, Pesch E (2012) Flight gate scheduling with respect to a reference schedule. Ann Oper Res 194(1):177\u2013187","journal-title":"Ann Oper Res"},{"key":"5289_CR11","doi-asserted-by":"publisher","first-page":"2093","DOI":"10.1007\/978-1-4613-0303-9_33","volume-title":"In: Handbook of combinatorial optimization","author":"F Glover","year":"1998","unstructured":"Glover F, Laguna M (1998) Tabu search. In: Handbook of combinatorial optimization. Springer, New York, pp 2093\u20132229"},{"issue":"1\u20133","key":"5289_CR12","doi-asserted-by":"publisher","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(1\u20133):59\u201396","journal-title":"Math Program"},{"issue":"1\u20133","key":"5289_CR13","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel M, Wakabayashi Y (1990) Facets of the clique partitioning polytope. Math Program 47(1\u20133):367\u2013387","journal-title":"Math Program"},{"issue":"3","key":"5289_CR14","doi-asserted-by":"publisher","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(3):215\u2013229","journal-title":"Adv Data Anal Classif"},{"issue":"3","key":"5289_CR15","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1051\/ro\/2018048","volume":"53","author":"O Hudry","year":"2019","unstructured":"Hudry O (2019) Application of the \u201cdescent with mutations\u201d metaheuristic to a clique partitioning problem. RAIRO Oper Res 53(3):1083\u20131095","journal-title":"RAIRO Oper Res"},{"issue":"13\u201314","key":"5289_CR16","doi-asserted-by":"publisher","first-page":"2025","DOI":"10.1016\/j.dam.2013.02.011","volume":"161","author":"F Jaehn","year":"2013","unstructured":"Jaehn F, Pesch E (2013) New bounds and constraint propagation techniques for the clique partitioning problem. Discret Appl Math 161(13\u201314):2025\u20132037","journal-title":"Discret Appl Math"},{"issue":"1","key":"5289_CR17","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/j.disopt.2006.10.009","volume":"4","author":"X Ji","year":"2007","unstructured":"Ji X, Mitchell JE (2007) Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discret Optim 4(1):87\u2013102","journal-title":"Discret Optim"},{"issue":"4","key":"5289_CR18","first-page":"577","volume":"88","author":"JG Kemeny","year":"1959","unstructured":"Kemeny JG (1959) Mathematics without numbers. Daedalus 88(4):577\u2013591","journal-title":"Daedalus"},{"issue":"4598","key":"5289_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick S, Gelatt CD, Vecchi MP (1983) Optimization by simulated annealing. Science 220(4598):671\u2013680","journal-title":"Science"},{"issue":"12","key":"5289_CR20","doi-asserted-by":"publisher","first-page":"6088","DOI":"10.1166\/jctn.2015.4549","volume":"12","author":"R Li","year":"2015","unstructured":"Li R, Hu S, Wang J (2015) The community structure of the constraint satisfaction problem instances of model RB. J Comput Theoret Nanosci 12(12):6088\u20136093","journal-title":"J Comput Theoret Nanosci"},{"key":"5289_CR21","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1016\/j.ins.2016.08.053","volume":"372","author":"R Li","year":"2016","unstructured":"Li R, Hu S, Zhang H, Yin M (2016) An efficient local search framework for the minimum weighted vertex cover problem. Inf Sci 372:428\u2013445","journal-title":"Inf Sci"},{"key":"5289_CR22","doi-asserted-by":"publisher","first-page":"10743","DOI":"10.1109\/ACCESS.2018.2799953","volume":"6","author":"R Li","year":"2018","unstructured":"Li R, Wu X, Liu H, Wu J, Yin M (2018) An efficient local search for the maximum edge weighted clique problem. IEEE Access 6:10743\u201310753","journal-title":"IEEE Access"},{"key":"5289_CR23","first-page":"395","volume":"43","author":"J Marcotorchino","year":"1981","unstructured":"Marcotorchino J, Michaud P (1981) Heuristic approach of the similarity aggregation problem. Method Oper Res 43:395\u2013404","journal-title":"Method Oper Res"},{"issue":"1","key":"5289_CR24","doi-asserted-by":"publisher","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):1\u201312","journal-title":"Oper Res Lett"},{"issue":"4","key":"5289_CR25","first-page":"209","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten M, Rutten JH, Spieksma FC (2001) The clique partitioning problem: facets and patching facets. Netw Int J 38(4):209\u2013226","journal-title":"Netw Int J"},{"key":"5289_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1155\/2014\/353101","volume":"2014","author":"G Palubeckis","year":"2014","unstructured":"Palubeckis G, Ostreika A (2014) Tomkevi\u010dius A (2014) An iterated Tabu search approach for the clique partitioning problem. Sci World J 2014:1\u201310","journal-title":"Sci World J"},{"key":"5289_CR27","unstructured":"R\u00e9gnier S (1983) Sur quelques aspects math\u00e9matiques des probl\u00e8mes de classification automatique. Math\u00e9matiques et Sciences Humaines 82(20)"},{"key":"5289_CR28","unstructured":"Wakabayashi Y (1986) Aggregation of binary relations: algorithmic and polyhedral investigations. PhD thesis, Universit\u00e4t Ausburg"},{"issue":"2","key":"5289_CR29","doi-asserted-by":"publisher","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(2):77\u201397","journal-title":"Int J Flex Manuf Syst"},{"key":"5289_CR30","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Yin M (2016) Two efficient local search algorithms for maximum weight clique problem. In: AAAI, pp 805\u2013811","DOI":"10.1609\/aaai.v30i1.10067"},{"issue":"1","key":"5289_CR31","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00521-016-2339-z","volume":"28","author":"X Zhang","year":"2017","unstructured":"Zhang X, Li X, Wang J (2017) Local search algorithm with path relinking for single batch-processing machine scheduling problem. Neural Comput Appl 28(1):313\u2013326","journal-title":"Neural Comput Appl"},{"issue":"2","key":"5289_CR32","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1007\/s10878-015-9964-9","volume":"32","author":"Y Zhou","year":"2016","unstructured":"Zhou Y, Hao JK, Go\u00ebffon A (2016) A three-phased local search approach for the clique partitioning problem. J Combin Optim 32(2):469\u2013491","journal-title":"J Combin Optim"},{"issue":"7","key":"5289_CR33","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1007\/s00521-016-2800-z","volume":"30","author":"Y Zhou","year":"2018","unstructured":"Zhou Y, Wang Y, Gao J, Luo N, Wang J (2018) An efficient local search for partial vertex cover problem. Neural Comput Appl 30(7):2245\u20132256","journal-title":"Neural Comput Appl"},{"issue":"7","key":"5289_CR34","doi-asserted-by":"publisher","first-page":"2155","DOI":"10.1007\/s00521-017-3176-4","volume":"31","author":"Y Zhou","year":"2019","unstructured":"Zhou Y, Wang R, Zhao C, Luo Q, Metwally MA (2019) Discrete greedy flower pollination algorithm for spherical traveling salesman problem. Neural Comput Appl 31(7):2155\u20132170","journal-title":"Neural Comput Appl"}],"container-title":["Neural Computing and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05289-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00521-020-05289-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00521-020-05289-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,7]],"date-time":"2022-11-07T18:36:45Z","timestamp":1667846205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00521-020-05289-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,8,18]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["5289"],"URL":"https:\/\/doi.org\/10.1007\/s00521-020-05289-5","relation":{},"ISSN":["0941-0643","1433-3058"],"issn-type":[{"value":"0941-0643","type":"print"},{"value":"1433-3058","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,8,18]]},"assertion":[{"value":"5 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declared that they have no conflicts of interest to this work. We declare that we do not have any commercial or associative interest that represents a conflict of interest in connection with the work submitted.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of interest"}}]}}