{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T19:15:18Z","timestamp":1759778118124,"version":"3.37.3"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T00:00:00Z","timestamp":1560211200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2020,3]]},"DOI":"10.1007\/s00500-019-04122-z","type":"journal-article","created":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T11:03:01Z","timestamp":1560250981000},"page":"3551-3567","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A novel parallel local search algorithm for the maximum vertex weight clique problem in large graphs"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7670-722X","authenticated-orcid":false,"given":"Ender","family":"Sevinc","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1665-5928","authenticated-orcid":false,"given":"Tansel","family":"Dokeroglu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,11]]},"reference":[{"key":"4122_CR1","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2006.06.035","volume":"181","author":"B Alidaee","year":"2007","unstructured":"Alidaee B, Glover F, Kochenberger G, Wang H (2007) Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur J Oper Res 181:592\u2013597","journal-title":"Eur J Oper Res"},{"key":"4122_CR2","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E Balas","year":"1986","unstructured":"Balas E, Yu CS (1986) Finding a maximum clique in an arbitrary graph. SIAM J Comput 15:1054\u20131068","journal-title":"SIAM J Comput"},{"key":"4122_CR3","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1016\/j.cor.2012.06.002","volume":"40","author":"U Benlic","year":"2013","unstructured":"Benlic U, Hao J-K (2013) Breakout local search for maximum clique problems. Comput Oper Res 40:192\u2013206","journal-title":"Comput Oper Res"},{"key":"4122_CR4","unstructured":"Cai S, Lin J (2016) Fast solving maximum weight clique problem in massive graphs. In: IJCAI, pp 568\u2013574"},{"key":"4122_CR5","first-page":"141","volume":"10","author":"E Cant\u00fa-Paz","year":"1998","unstructured":"Cant\u00fa-Paz E (1998) A survey of parallel genetic algorithms. Calculateurs paralleles, reseaux et systems repartis 10:141\u2013171","journal-title":"Calculateurs paralleles, reseaux et systems repartis"},{"key":"4122_CR6","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(93)90097-7","volume":"69","author":"G Dijkhuizen","year":"1993","unstructured":"Dijkhuizen G, Faigle U (1993) A cutting-plane approach to the edge-weighted maximal clique problem. Eur J Oper Res 69:121\u2013130","journal-title":"Eur J Oper Res"},{"key":"4122_CR7","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.cie.2015.03.001","volume":"85","author":"T Dokeroglu","year":"2015","unstructured":"Dokeroglu T (2015) Hybrid teaching-learning-based optimization algorithms for the quadratic assignment problem. Comput Ind Eng 85:86\u2013101","journal-title":"Comput Ind Eng"},{"key":"4122_CR8","first-page":"1","volume":"22","author":"T Dokeroglu","year":"2017","unstructured":"Dokeroglu T, Mengusoglu E (2017) A self-adaptive and stagnation-aware breakout local search algorithm on the grid for the steiner tree problem with revenue, budget and hop constraints. Soft Comput 22:1\u201319","journal-title":"Soft Comput"},{"key":"4122_CR9","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1016\/j.asoc.2019.01.001","volume":"76","author":"T Dokeroglu","year":"2019","unstructured":"Dokeroglu T, Sevinc E, Cosar A (2019) Artificial bee colony optimization for the quadratic assignment problem. Appl Soft Comput 76:595\u2013606","journal-title":"Appl Soft Comput"},{"key":"4122_CR10","doi-asserted-by":"crossref","unstructured":"El Baz D, Hifi M, Wu L, Shi X (2016) A parallel ant colony optimization for the maximum-weight clique problem. In: IEEE international parallel and distributed processing symposium workshops, 2016, IEEE, pp 796\u2013800","DOI":"10.1109\/IPDPSW.2016.111"},{"key":"4122_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-1-4419-1665-5_3","volume-title":"Handbook of metaheuristics","author":"P Hansen","year":"2010","unstructured":"Hansen P, Mladenovi\u0107 N, Brimberg J, P\u00e9rez JAM (2010) Variable neighborhood search. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, Berlin, pp 61\u201386"},{"key":"4122_CR12","doi-asserted-by":"crossref","unstructured":"Jiang H, Li C-M, Manya F (2017) An exact algorithm for the maximum weight clique problem in large graphs. In: AAAI, pp 830\u2013838","DOI":"10.1609\/aaai.v31i1.10648"},{"key":"4122_CR13","doi-asserted-by":"crossref","unstructured":"Jiang H, Li C-M, Liu Y, Manya F (2018) A two-stage maxsat reasoning approach for the maximum weight clique problem. In: AAAI","DOI":"10.1609\/aaai.v32i1.11527"},{"key":"4122_CR14","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.cie.2018.02.018","volume":"118","author":"HE Kiziloz","year":"2018","unstructured":"Kiziloz HE, Dokeroglu T (2018) A robust and cooperative parallel tabu search algorithm for the maximum vertex weight clique problem. Comput Ind Eng 118:54\u201366","journal-title":"Comput Ind Eng"},{"key":"4122_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1016\/j.cie.2018.08.021","volume":"125","author":"T Kucukyilmaz","year":"2018","unstructured":"Kucukyilmaz T, Kiziloz HE (2018) Cooperative parallel grouping genetic algorithm for the one-dimensional bin packing problem. Comput Ind Eng 125:157\u2013170","journal-title":"Comput Ind Eng"},{"key":"4122_CR16","unstructured":"Kumlander D (2004) A new exact algorithm for the maximum-weight clique problem based on a heuristic vertex-coloring and a backtrack search. In: Proceedings of 5th international conference on modelling, computation and optimization in information systems and management sciences, Citeseer, pp 202\u2013208"},{"key":"4122_CR17","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.ejor.2018.03.020","volume":"270","author":"C-M Li","year":"2018","unstructured":"Li C-M, Liu Y, Jiang H, Many\u00e0 F, Li Y (2018) A new upper bound for the maximum weight clique problem. Eur J Oper Res 270:66\u201377","journal-title":"Eur J Oper Res"},{"key":"4122_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-1-4419-1665-5_12","volume-title":"Handbook of metaheuristics","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin JY (eds) Handbook of metaheuristics. Springer, Berlin, pp 363\u2013397"},{"key":"4122_CR19","unstructured":"Ma T, Latecki L J (2012) Maximum weight cliques with mutex constraints for video object segmentation. In: IEEE Conference on computer vision and pattern recognition (CVPR), 2012 IEEE, pp 670\u2013677"},{"key":"4122_CR20","doi-asserted-by":"crossref","unstructured":"Mascia F, Cilia E, Brunato M, Passerini A (2010) Predicting structural and functional sites in proteins by searching for maximum-weight cliques. In: AAAI","DOI":"10.1609\/aaai.v24i1.7495"},{"key":"4122_CR21","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1016\/j.cor.2017.09.023","volume":"90","author":"B Nogueira","year":"2018","unstructured":"Nogueira B, Pinheiro RG (2018) A CPU-GPU local search heuristic for the maximum weight clique problem on massive graphs. Comput Oper Res 90:232\u2013248","journal-title":"Comput Oper Res"},{"key":"4122_CR22","first-page":"1","volume":"12","author":"B Nogueira","year":"2017","unstructured":"Nogueira B, Pinheiro RG, Subramanian A (2017) A hybrid iterated local search heuristic for the maximum weight independent set problem. Optim Lett 12:1\u201317","journal-title":"Optim Lett"},{"key":"4122_CR23","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W Pullan","year":"2008","unstructured":"Pullan W (2008) Approximating the maximum vertex\/edge weighted clique using local search. J Heuristics 14:117\u2013134","journal-title":"J Heuristics"},{"key":"4122_CR24","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W Pullan","year":"2006","unstructured":"Pullan W, Hoos HH (2006) Dynamic local search for the maximum clique problem. J Artif Intell Res 25:159\u2013185","journal-title":"J Artif Intell Res"},{"key":"4122_CR25","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/978-3-642-41827-3_69","volume-title":"Progress in Pattern Recognition, Image Analysis, Computer Vision, and Applications","author":"Mariano Tepper","year":"2013","unstructured":"Tepper M, Sapiro G (2013) Ants crawling to discover the community structure in networks. In: Iberoamerican congress on pattern recognition. Springer, Berlin, pp 552\u2013559"},{"key":"4122_CR26","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/s10878-016-9990-2","volume":"32","author":"Y Wang","year":"2016","unstructured":"Wang Y, Hao J-K, Glover F, L\u00fc Z, Wu Q (2016a) Solving the maximum vertex weight clique problem via binary quadratic programming. J Comb Optim 32:531\u2013549","journal-title":"J Comb Optim"},{"key":"4122_CR27","doi-asserted-by":"crossref","unstructured":"Wang Y, Cai S, Yin M (2016b) Two efficient local search algorithms for maximum weight clique problem. In: AAAI, pp 805\u2013811","DOI":"10.1609\/aaai.v30i1.10067"},{"key":"4122_CR28","unstructured":"Warren JS, Hicks IV (2006) Combinatorial branch-and-bound for the maximum weight independent set problem. Relat\u00f3rio T\u00e9cnico, Texas A&M University, Citeseer 9:17"},{"key":"4122_CR29","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.eswa.2014.07.027","volume":"42","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao J-K (2015a) Solving the winner determination problem via a weighted maximum clique heuristic. Exp Syst Appl 42:355\u2013365","journal-title":"Exp Syst Appl"},{"key":"4122_CR30","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao J-K (2015b) A review on algorithms for maximum clique problems. Eur J Oper Res 242:693\u2013709","journal-title":"Eur J Oper Res"},{"key":"4122_CR31","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ins.2015.11.029","volume":"334","author":"Q Wu","year":"2016","unstructured":"Wu Q, Hao J-K (2016) A clique-based exact method for optimal winner determination in combinatorial auctions. Inf Sci 334:103\u2013121","journal-title":"Inf Sci"},{"key":"4122_CR32","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","volume":"196","author":"Q Wu","year":"2012","unstructured":"Wu Q, Hao J-K, Glover F (2012) Multi-neighborhood tabu search for the maximum weight clique problem. Ann Oper Res 196:611\u2013634","journal-title":"Ann Oper Res"},{"key":"4122_CR33","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1109\/TCBB.2007.1075","volume":"4","author":"C Zheng","year":"2007","unstructured":"Zheng C, Zhu Q, Sankoff D (2007) Removing noise and ambiguities from comparative maps in rearrangement analysis. IEEE\/ACM Trans Comput Biol Bioinf 4:515\u2013522","journal-title":"IEEE\/ACM Trans Comput Biol Bioinf"},{"key":"4122_CR34","doi-asserted-by":"crossref","unstructured":"Zhian H, Sabaei M, Javan N T, Tavallaie O (2013) Increasing coding opportunities using maximum-weight clique. In: 5th computer science and electronic engineering conference (CEEC), 2013, IEEE, pp 168\u2013173","DOI":"10.1109\/CEEC.2013.6659466"},{"key":"4122_CR35","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1109\/TEVC.2017.2674800","volume":"21","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Hao J-K, Duval B (2017a) Opposition-based memetic search for the maximum diversity problem. IEEE Trans Evol Comput 21:731\u2013745","journal-title":"IEEE Trans Evol Comput"},{"key":"4122_CR36","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ejor.2016.07.056","volume":"257","author":"Y Zhou","year":"2017","unstructured":"Zhou Y, Hao J-K, Go\u00ebffon A (2017b) Push: a generalized operator for the maximum vertex weight clique problem. Eur J Oper Res 257:41\u201354","journal-title":"Eur J Oper Res"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04122-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-019-04122-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-019-04122-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,17]],"date-time":"2023-09-17T10:34:57Z","timestamp":1694946897000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-019-04122-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,11]]},"references-count":36,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,3]]}},"alternative-id":["4122"],"URL":"https:\/\/doi.org\/10.1007\/s00500-019-04122-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"type":"print","value":"1432-7643"},{"type":"electronic","value":"1433-7479"}],"subject":[],"published":{"date-parts":[[2019,6,11]]},"assertion":[{"value":"11 June 2019","order":1,"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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and animals participants"}},{"value":"There is no individual participant included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}