{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T03:16:28Z","timestamp":1768101388829,"version":"3.49.0"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,12,9]],"date-time":"2011-12-09T00:00:00Z","timestamp":1323388800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2013,7]]},"DOI":"10.1007\/s10878-011-9437-8","type":"journal-article","created":{"date-parts":[[2011,12,8]],"date-time":"2011-12-08T11:57:53Z","timestamp":1323345473000},"page":"86-108","source":"Crossref","is-referenced-by-count":53,"title":["An adaptive multistart tabu search approach to solve the maximum clique problem"],"prefix":"10.1007","volume":"26","author":[{"given":"Qinghua","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,12,9]]},"reference":[{"issue":"4","key":"9437_CR1","doi-asserted-by":"crossref","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(4):1054\u20131068","journal-title":"SIAM J Comput"},{"issue":"4","key":"9437_CR2","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1007\/s10878-004-4835-9","volume":"8","author":"V Barbosa","year":"2004","unstructured":"Barbosa V, Campos L (2004) A novel evolutionary formulation of the maximum independent set problem. J Comb Optim 8(4):419\u2013437","journal-title":"J Comb Optim"},{"issue":"3","key":"9437_CR3","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.cor.2009.02.013","volume":"37","author":"R Battiti","year":"2010","unstructured":"Battiti R, Mascia F (2010) Reactive and dynamic local search for max-clique: engineering effective building blocks. Comput Oper Res 37(3):534\u2013542","journal-title":"Comput Oper Res"},{"issue":"4","key":"9437_CR4","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R Battiti","year":"2001","unstructured":"Battiti R, Protasi M (2001) Reactive local search for the maximum clique problem. Algorithmica 29(4):610\u2013637","journal-title":"Algorithmica"},{"key":"9437_CR5","first-page":"478","volume-title":"Proceedings of the 6th international conference on genetic algorithms","author":"T Bui","year":"1995","unstructured":"Bui T, Eppley P (1995) A hybrid genetic algorithm for the maximum clique problem. In: Proceedings of the 6th international conference on genetic algorithms, pp 478\u2013484"},{"issue":"3","key":"9437_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1023\/A:1014899909753","volume":"6","author":"S Busygin","year":"2002","unstructured":"Busygin S, Butenko S, Pardalos PM (2002) A heuristic for the maximum independent set problem based on optimization of a quadratic over a sphere. J Comb Optim 6(3):287\u2013297","journal-title":"J Comb Optim"},{"issue":"1","key":"9437_CR7","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S Busygin","year":"2006","unstructured":"Busygin S (2006) A new trust region technique for the maximum weight clique problem. Discrete Appl Math 154(1):2080\u20132096","journal-title":"Discrete Appl Math"},{"key":"9437_CR8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9:375\u2013382","journal-title":"Oper Res Lett"},{"key":"9437_CR9","series-title":"DIMACS series in discrete mathematics and theoretical computer science","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1090\/dimacs\/026\/29","volume-title":"Proceedings of the 2nd DIMACS implementation challenge","author":"C Fleurent","year":"1996","unstructured":"Fleurent C, Ferland J (1996) Object-oriented implementation of heuristic search methods for graph coloring, maximum clique, and satisfiability. In: Johnson D, Trick M (eds) Proceedings of the 2nd DIMACS implementation challenge. DIMACS series in discrete mathematics and theoretical computer science, vol 26. Am. Math. Soc., Providence, pp 619\u2013652"},{"key":"9437_CR10","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C Friden","year":"1989","unstructured":"Friden C, Hertz A, de Werra D (1989) Stabulus: A technique for finding stable sets in large graphs with tabu search. Computing 42:35\u201344","journal-title":"Computing"},{"issue":"4","key":"9437_CR11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1023\/A:1009823419804","volume":"3","author":"P Galinier","year":"1999","unstructured":"Galinier P, Hao JK (1999) Hybrid evolutionary algorithms for graph coloring. J Comb Optim 3(4):379\u2013397","journal-title":"J Comb Optim"},{"key":"9437_CR12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M Gendreau","year":"1993","unstructured":"Gendreau M, Soriano P, Salvail L (1993) Solving the maximum clique problem using a tabu search approach. Ann Oper Res 41:385\u2013403","journal-title":"Ann Oper Res"},{"key":"9437_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer Academic, Norwell"},{"issue":"6","key":"9437_CR14","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1007\/s10732-007-9055-x","volume":"14","author":"A Grosso","year":"2008","unstructured":"Grosso A, Locatelli M, Pullan W (2008) Simple ingredients leading to very efficient heuristics for the maximum clique problem. J Heuristics 14(6):587\u2013612","journal-title":"J Heuristics"},{"key":"9437_CR15","series-title":"DIMACS series in discrete mathe-matics and theoretical computer science","doi-asserted-by":"crossref","DOI":"10.1090\/dimacs\/026","volume-title":"Second DIMACS implementation challenge: cliques, coloring and satisfiability","author":"DS Johnson","year":"1996","unstructured":"Johnson DS, Trick MA (1996) Second DIMACS implementation challenge: cliques, coloring and satisfiability. DIMACS series in discrete mathe-matics and theoretical computer science, vol\u00a026. Am. Math. Soc., Providence"},{"key":"9437_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"RM Karp","year":"1972","unstructured":"Karp RM (1972) Reducibility among combinatorial problems. In: Miller RE, Thatcher JW (eds) Complexity of computer computations. Plenum, New York, pp 85\u2013103"},{"issue":"5","key":"9437_CR17","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1016\/j.ipl.2005.05.010","volume":"95","author":"K Katayama","year":"2005","unstructured":"Katayama K, Hamamoto A, Narihisa H (2005) An effective local search for the maximum clique problem. Inf Process Lett 95(5):503\u2013511","journal-title":"Inf Process Lett"},{"key":"9437_CR18","first-page":"366","volume-title":"Proceedings of ACM symposium on applied computing","author":"E Marchiori","year":"1998","unstructured":"Marchiori E (1998) A simple heuristic based genetic algorithm for the maximum clique problem. In: Proceedings of ACM symposium on applied computing, pp 366\u2013373"},{"key":"9437_CR19","series-title":"Proceedings of EvoWorkshops","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1007\/3-540-46004-7_12","volume-title":"Applications of evolutionary computing","author":"E Marchiori","year":"2002","unstructured":"Marchiori E (2002) Genetic, iterated and multistart local search for the maximum clique problem. In: Applications of evolutionary computing. Proceedings of EvoWorkshops, vol\u00a02279, pp 112\u2013121"},{"key":"9437_CR20","first-page":"195","volume":"120","author":"PJR \u00d6sterg\u00e4rd","year":"2002","unstructured":"\u00d6sterg\u00e4rd PJR (2002) A fast algorithm for the maximum clique problem. Discrete Appl Math 120:195\u2013205","journal-title":"Discrete Appl Math"},{"key":"9437_CR21","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"2002","unstructured":"Pardalos PM, Xue J (2002) The maximum clique problem. J Glob Optim 4:301\u2013328","journal-title":"J Glob Optim"},{"issue":"3","key":"9437_CR22","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10878-006-9635-y","volume":"12","author":"W Pullan","year":"2006","unstructured":"Pullan W (2006) Phased local search for the maximum clique problem. J Comb Optim 12(3):303\u2013323","journal-title":"J Comb Optim"},{"key":"9437_CR23","doi-asserted-by":"crossref","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"},{"issue":"4","key":"9437_CR24","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s10878-009-9264-3","volume":"21","author":"S Rebennack","year":"2011","unstructured":"Rebennack S, Oswald M, Theis DO, Seitz H, Reinelt G, Pardalos PM (2011) A Branch and Cut solver for the maximum stable set problem. J Comb Optim 21(4):434\u2013457","journal-title":"J Comb Optim"},{"key":"9437_CR25","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10732-006-3750-x","volume":"12","author":"A Singh","year":"2008","unstructured":"Singh A, Gupta AK (2008) A hybrid heuristic for the maximum clique problem. J Heuristics 12:5\u201322","journal-title":"J Heuristics"},{"key":"9437_CR26","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume":"2731","author":"E Tomita","year":"2003","unstructured":"Tomita E, Seki T (2003) An efficient branch-and-bound algorithm for finding a maximum clique. Discrete Math Theor Comput Sci 2731:278\u2013289","journal-title":"Discrete Math Theor Comput Sci"},{"issue":"2","key":"9437_CR27","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1109\/TEVC.2004.840835","volume":"9","author":"QF Zhang","year":"2005","unstructured":"Zhang QF, Sun JY, Tsang E (2005) Evolutionary algorithm with the guided mutation for the maximum clique problem. IEEE Trans Evol Comput 9(2):192\u2013200","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"9437_CR28","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/j.cor.2011.04.002","volume":"39","author":"Q Wu","year":"2012","unstructured":"Wu Q, Hao JK (2012a) Coloring large graphs based on independent set extraction. Comput Oper Res 39(2):283\u2013290","journal-title":"Comput Oper Res"},{"issue":"7","key":"9437_CR29","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2011.09.010","volume":"39","author":"Q Wu","year":"2012","unstructured":"Wu Q, Hao JK (2012b) An effective heuristic algorithm for sum coloring of graphs. Comput. Oper. Res. 39(7):1593\u20131600. doi: 10.1016\/j.cor.2011.09.010","journal-title":"Comput. Oper. Res."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9437-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9437-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9437-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T12:12:53Z","timestamp":1561032773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9437-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12,9]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9437"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9437-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,12,9]]}}}