{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:59:23Z","timestamp":1774022363626,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540685487","type":"print"},{"value":"9783540685524","type":"electronic"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-68552-4_17","type":"book-chapter","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T05:06:43Z","timestamp":1211951203000},"page":"220-234","source":"Crossref","is-referenced-by-count":10,"title":["Fast Local Search for the Maximum Independent Set Problem"],"prefix":"10.1007","author":[{"given":"Diogo V.","family":"Andrade","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio G. C.","family":"Resende","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Renato F.","family":"Werneck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"17_CR1","doi-asserted-by":"publisher","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\u00a029(4), 610\u2013637 (2001)","journal-title":"Algorithmica"},{"key":"17_CR2","first-page":"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, Dordrecht (1999)"},{"key":"17_CR3","doi-asserted-by":"crossref","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)","DOI":"10.1145\/508791.508897"},{"key":"17_CR4","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, Heidelberg (2008)"},{"key":"17_CR5","unstructured":"Demetrescu, C., Goldberg, A.V., Johnson, D.S.: 9th DIMACS Implementation Challenge: Shortest Paths (2006) (last visited on March 15, 2008), \n                  \n                    http:\/\/www.dis.uniroma1.it\/~challenge9"},{"key":"17_CR6","doi-asserted-by":"publisher","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. Operations Research\u00a042, 860\u2013878 (1994)","journal-title":"Operations Research"},{"key":"17_CR7","doi-asserted-by":"publisher","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\u00a010, 135\u2013152 (2004)","journal-title":"J. Heuristics"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Grosso, A., Locatelli, M., Pullan, W.: Simple ingredients leading to very efficient heuristics for the maximum clique problem. J. Heuristics (30 October, 2007), doi:10.1007\/s10732-007-9055-x","DOI":"10.1007\/s10732-007-9055-x"},{"issue":"1","key":"17_CR9","doi-asserted-by":"publisher","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 Applied Mathematics\u00a0145(1), 117\u2013125 (2004)","journal-title":"Discrete Applied Mathematics"},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.: Cliques, Coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a026. AMS (1996)","DOI":"10.1090\/dimacs\/026"},{"key":"17_CR11","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 Press, New York (1972)"},{"key":"17_CR12","doi-asserted-by":"publisher","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. Information Processing Letters\u00a095, 503\u2013511 (2005)","journal-title":"Information Processing Letters"},{"key":"17_CR13","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, Dordrecht (2003)"},{"key":"17_CR14","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. Artificial Intelligence Research\u00a025, 159\u2013185 (2006)","journal-title":"J. Artificial Intelligence Research"},{"key":"17_CR15","doi-asserted-by":"crossref","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)","DOI":"10.1007\/978-3-540-74565-5_31"},{"key":"17_CR16","unstructured":"Sander, P.V., Nehab, D., Chlamtac, E., Hoppe, H.: Efficient traversal of mesh edges (submitted, 2008)"},{"key":"17_CR17","unstructured":"Sloane, N.J.A.: Challenge problems: Independent sets in graphs (2000) (last visited on March 15, 2008), \n                  \n                    http:\/\/www.research.att.com\/~njas\/doc\/graphs.html"},{"key":"17_CR18","unstructured":"Xu, K.: BHOSLIB: Benchmarks with hidden optimum solutions for graph problems (2004) (last visited on March 15, 2008), \n                  \n                    http:\/\/www.nlsde.buaa.edu.cn\/~kexu\/benchmarks\/graph-benchmarks.htm"}],"container-title":["Lecture Notes in Computer Science","Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68552-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:36:30Z","timestamp":1558265790000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68552-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540685487","9783540685524"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68552-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008]]}}}