{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T21:31:53Z","timestamp":1780954313684,"version":"3.54.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T00:00:00Z","timestamp":1330128000000},"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":[[2012,8]]},"DOI":"10.1007\/s10732-012-9196-4","type":"journal-article","created":{"date-parts":[[2012,2,24]],"date-time":"2012-02-24T16:49:40Z","timestamp":1330102180000},"page":"525-547","source":"Crossref","is-referenced-by-count":104,"title":["Fast local search for the maximum independent set problem"],"prefix":"10.1007","volume":"18","author":[{"given":"Diogo V.","family":"Andrade","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2012,2,25]]},"reference":[{"key":"9196_CR1","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/978-3-540-68552-4_17","volume-title":"Proc. 7th International Workshop on Experimental Algorithms (WEA)","author":"D.V. Andrade","year":"2008","unstructured":"Andrade, D.V., Resende, M.G.C., Werneck, R.F.: Fast local search for the maximum independent set problem. In: McGeoch, C.C. (ed.) Proc. 7th International Workshop on Experimental Algorithms (WEA), vol.\u00a05038, pp. 220\u2013234. Springer, Berlin (2008)"},{"issue":"4","key":"9196_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(4), 610\u2013637 (2001)","journal-title":"Algorithmica"},{"key":"9196_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization (Sup. Vol. A)","author":"I.M. Bomze","year":"1999","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization (Sup. Vol. A), pp. 1\u201374. Kluwer Academic, Norwell (1999)"},{"key":"9196_CR4","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1145\/508791.508897","volume-title":"Proceedings of the 2002 ACM Symposium on Applied Computing","author":"S. Butenko","year":"2002","unstructured":"Butenko, S., Pardalos, P.M., Sergienko, I., Shylo, V., Stetsyuk, P.: Finding maximum independent sets in graphs arising from coding theory. In: Proceedings of the 2002 ACM Symposium on Applied Computing, pp. 542\u2013546 (2002)"},{"key":"9196_CR5","volume-title":"Optimization: Structure and Applications","author":"S. Butenko","year":"2008","unstructured":"Butenko, S., Pardalos, P.M., Sergienko, I., Shylo, V., Stetsyuk, P.: Estimating the size of correcting codes using extremal graph problems. In: Pearce, C. (ed.) Optimization: Structure and Applications. Springer, Berlin (2008)"},{"key":"9196_CR6","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th DIMACS Implementation Challenge: Shortest Paths (2006). http:\/\/www.dis.uniroma1.it\/~challenge9 . Last visited on March 15, 2008"},{"key":"9196_CR7","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T. Feo","year":"1994","unstructured":"Feo, T., Resende, M.G.C., Smith, S.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"key":"9196_CR8","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., Della Croce, F.: 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"},{"issue":"6","key":"9196_CR9","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.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics 14(6), 587\u2013612 (2008)","journal-title":"J. Heuristics"},{"issue":"1","key":"9196_CR10","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., Uro\u0161evi\u0107, D.: Variable neighborhood search for the maximum clique. Discrete Appl. Math. 145(1), 117\u2013125 (2004)","journal-title":"Discrete Appl. Math."},{"key":"9196_CR11","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Cliques, Coloring and Satisfiability","year":"1996","unstructured":"Johnson, D.S., Trick, M. (eds.): Cliques, Coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. AMS, Providence (1996)"},{"key":"9196_CR12","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum, New York (1972)"},{"key":"9196_CR13","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.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95, 503\u2013511 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9196_CR14","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer Academic, Norwell (2003)"},{"key":"9196_CR15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W.J. Pullan","year":"2006","unstructured":"Pullan, W.J., Hoos, H.H.: Dynamic local search for the maximum clique problem. J. Artif. Intell. Res. 25, 159\u2013185 (2006)","journal-title":"J. Artif. Intell. Res."},{"key":"9196_CR16","first-page":"412","volume-title":"Proceedings of the 30th German Conference on Artificial Intelligence (KI)","author":"S. Richter","year":"2007","unstructured":"Richter, S., Helmert, M., Gretton, C.: A stochastic local search approach to vertex cover. In: Proceedings of the 30th German Conference on Artificial Intelligence (KI), pp. 412\u2013426 (2007)"},{"issue":"5","key":"9196_CR17","doi-asserted-by":"crossref","first-page":"144:1","DOI":"10.1145\/1409060.1409097","volume":"27","author":"P.V. Sander","year":"2008","unstructured":"Sander, P.V., Nehab, D., Chlamtac, E., Hoppe, H.: Efficient traversal of mesh edges using adjacency primitives. ACM Trans. Graph. 27(5), 144:1\u2013144:9 (2008)","journal-title":"ACM Trans. Graph."},{"key":"9196_CR18","unstructured":"Sloane, N.J.A.: Challenge problems: Independent sets in graphs (2000). http:\/\/www.research.att.com\/~njas\/doc\/graphs.html . Last visited on March 15, 2008"},{"key":"9196_CR19","unstructured":"Xu, K.: BHOSLIB: Benchmarks with hidden optimum solutions for graph problems (2004). http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/graph-benchmarks.htm . Last visited on March 15, 2008"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9196-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-012-9196-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-012-9196-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,24]],"date-time":"2019-06-24T07:44:13Z","timestamp":1561362253000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-012-9196-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,2,25]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,8]]}},"alternative-id":["9196"],"URL":"https:\/\/doi.org\/10.1007\/s10732-012-9196-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,2,25]]}}}