{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:36:21Z","timestamp":1760708181837},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,4,2]],"date-time":"2010-04-02T00:00:00Z","timestamp":1270166400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1007\/s10732-010-9131-5","type":"journal-article","created":{"date-parts":[[2010,4,1]],"date-time":"2010-04-01T15:34:10Z","timestamp":1270136050000},"page":"181-199","source":"Crossref","is-referenced-by-count":38,"title":["Cooperating local search for the maximum clique problem"],"prefix":"10.1007","volume":"17","author":[{"given":"Wayne","family":"Pullan","sequence":"first","affiliation":[]},{"given":"Franco","family":"Mascia","sequence":"additional","affiliation":[]},{"given":"Mauro","family":"Brunato","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,4,2]]},"reference":[{"issue":"4","key":"9131_CR1","doi-asserted-by":"crossref","first-page":"1054","DOI":"10.1137\/0215075","volume":"15","author":"E. Balus","year":"1986","unstructured":"Balus, E., Yu, C.: Finding a maximum clique in an arbitrary graph. SIAM J. Comput. 15(4), 1054\u20131068 (1986)","journal-title":"SIAM J. Comput."},{"key":"9131_CR2","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R. Battiti","year":"2001","unstructured":"Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem. Algorithmica 29, 610\u2013637 (2001)","journal-title":"Algorithmica"},{"key":"9131_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"I. Bomze","year":"1999","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P. (eds.) Handbook of Combinatorial Optimization, vol. A, pp. 1\u201374. Kluwer Academic, Norwell (1999)"},{"key":"9131_CR4","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/BF01994876","volume":"32","author":"R. Boppana","year":"1992","unstructured":"Boppana, R., Halld\u00f3rsson, M.: Approximating maximum independent sets by excluding subgraphs. BIT 32, 180\u2013196 (1992)","journal-title":"BIT"},{"key":"9131_CR5","series-title":"DIMACS Series","volume-title":"Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge","author":"M. Brockington","year":"1996","unstructured":"Brockington, M., Culberson, J.: Camouflaging independent sets in quasi-random graphs. In: Johnson, D.S., Trick, M. (eds.) Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series, vol. 26. American Mathematical Society, Providence (1996)"},{"key":"9131_CR6","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Meta-heuristics","author":"E. Burke","year":"2003","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P., Schulenburg, S.: Hyper-heuristics: An emerging direction in modern search technology. In: Glover, F. (ed.) Handbook of Meta-heuristics, pp. 457\u2013474. Kluwer Academic, Norwell (2003)"},{"key":"9131_CR7","first-page":"379","volume-title":"Proceedings of Supercomputing Symposium","author":"G. Burns","year":"1994","unstructured":"Burns, G., Daoud, R., Vaigl, J.: LAM: An open cluster environment for MPI. In: Proceedings of Supercomputing Symposium, pp. 379\u2013386. ACM, New York (1994)"},{"issue":"15","key":"9131_CR8","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.: A new trust region technique for the maximum weight clique problem. Discrete Appl. Math. 154(15), 2080\u20132096 (2006)","journal-title":"Discrete Appl. Math."},{"key":"9131_CR9","series-title":"Studies in Computational Intelligence","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-3-540-79438-7_1","volume-title":"Adaptive and Multilevel Metaheuristics","author":"K. Chakhlevitch","year":"2008","unstructured":"Chakhlevitch, K., Cowling, P.: Hyper-heuristics: Recent developments. In: Cotta, C., Sevaux, M., S\u00f6rensen, K. (eds.): Adaptive and Multilevel Metaheuristics. Studies in Computational Intelligence, vol. 136, pp. 3\u201329. Springer, Berlin (2008)"},{"key":"9131_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of $\\mathcal{NP}$ -Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of $\\mathcal{NP}$ -Completeness. Freeman, San Francisco (1979)"},{"key":"9131_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:HEUR.0000026264.51747.7f","volume":"10","author":"A. Grosso","year":"2004","unstructured":"Grosso, A., Locatelli, M., Croce, F.D.: Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem. J. Heuristics 10, 135\u2013152 (2004)","journal-title":"J. Heuristics"},{"key":"9131_CR12","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.: Randomness, plateau search, penalties, restart rules: simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14, 587\u2013612 (2008)","journal-title":"J. Heuristics"},{"key":"9131_CR13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.dam.2003.09.012","volume":"145","author":"P. Hansen","year":"2004","unstructured":"Hansen, P., Mladenovi\u0107, N., Urosevi\u0107, D.: Variable neighborhood search for the maximum clique. Discrete Appl. Math. 145, 117\u2013125 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9131_CR14","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. H\u00e5stad","year":"1999","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within n 1\u2212\u03b5 . Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"issue":"10","key":"9131_CR15","doi-asserted-by":"crossref","first-page":"1591","DOI":"10.1093\/bioinformatics\/bth131","volume":"20","author":"Y. Ji","year":"2004","unstructured":"Ji, Y., Xu, X., Stormo, G.D.: A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences. Bioinformatics 20(10), 1591\u20131602 (2004)","journal-title":"Bioinformatics"},{"key":"9131_CR16","series-title":"DIMACS Series","volume-title":"Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge","year":"1996","unstructured":"Johnson, D., Trick, M. (eds.): Cliques, Coloring and Satisfiability: Second DIMACS Implementation Challenge. DIMACS Series, vol. 26. American Mathematical Society, Providence (1996)"},{"key":"9131_CR17","doi-asserted-by":"crossref","first-page":"1021","DOI":"10.1145\/967900.968107","volume-title":"Proceedings of the 2004 ACM Symposium on Applied Computing","author":"K. Katayama","year":"2004","unstructured":"Katayama, K., Hamamoto, A., Narihisa, H.: Solving the maximum clique problem by k-opt local search. In: Proceedings of the 2004 ACM Symposium on Applied Computing, pp. 1021\u20131025. ACM, New York (2004)"},{"key":"9131_CR18","series-title":"Lecture Notes in Computer Science","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.: Genetic, iterated and multistart local search for the maximum clique problem. In: Applications of Evolutionary Computing. Lecture Notes in Computer Science, vol. 2279, pp. 112\u2013121. Springer, Berlin (2002)"},{"key":"9131_CR19","first-page":"269","volume-title":"Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology","author":"P.A. Pevzner","year":"2000","unstructured":"Pevzner, P.A., Sze, S.H.: Combinatorial approaches to finding subtle signals in DNA sequences. In: Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pp.\u00a0269\u2013278. AAAI Press, Menlo Park (2000)"},{"key":"9131_CR20","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/s10878-006-9635-y","volume":"12","author":"W. Pullan","year":"2006","unstructured":"Pullan, W.: Phased local search for the maximum clique problem. J. Combin. Optim. 12, 303\u2013323 (2006)","journal-title":"J. Combin. Optim."},{"key":"9131_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W. Pullan","year":"2008","unstructured":"Pullan, W.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heuristics 14, 117\u2013134 (2008)","journal-title":"J. Heuristics"},{"key":"9131_CR22","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W. Pullan","year":"2006","unstructured":"Pullan, W., Hoos, H.: Dynamic local search for the maximum clique problem. J. Artif. Intell. Res. 25, 159\u2013185 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"9131_CR23","doi-asserted-by":"crossref","first-page":"386","DOI":"10.1145\/293686.293690","volume":"24","author":"M. Resende","year":"1998","unstructured":"Resende, M., Feo, T., Smith, S.: Algorithm 786: FORTRAN subroutine for approximate solution of the maximum independent set problem using GRASP. ACM Trans. Math. Softw. 24, 386\u2013394 (1998)","journal-title":"ACM Trans. Math. Softw."},{"key":"9131_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/978-3-540-39924-7_52","volume-title":"Proceedings, 10th European PVM\/MPI Users\u2019 Group Meeting","author":"J.M. Squyres","year":"2003","unstructured":"Squyres, J.M., Lumsdaine, A.: A component architecture for LAM\/MPI. In: Proceedings, 10th European PVM\/MPI Users\u2019 Group Meeting, Venice, Italy, September\/October 2003. Lecture Notes in Computer Science, vol. 2840, pp. 379\u2013387. Springer, Berlin (2003)"},{"key":"9131_CR25","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"D. Wolpert","year":"1997","unstructured":"Wolpert, D., Macready, G.: No free lunch theorems for optimization. IEEE Trans. Evol. Comput. 1, 67\u201382 (1997)","journal-title":"IEEE Trans. Evol. Comput."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9131-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-010-9131-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-010-9131-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:54:31Z","timestamp":1559256871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-010-9131-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,4,2]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,4]]}},"alternative-id":["9131"],"URL":"https:\/\/doi.org\/10.1007\/s10732-010-9131-5","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,4,2]]}}}