{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:55:10Z","timestamp":1752461710808},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716143"},{"type":"electronic","value":"9783540716150"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71615-0_8","type":"book-chapter","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T14:51:34Z","timestamp":1176907894000},"page":"84-95","source":"Crossref","is-referenced-by-count":8,"title":["Iterated k-Opt Local Search for the Maximum Clique Problem"],"prefix":"10.1007","author":[{"given":"Kengo","family":"Katayama","sequence":"first","affiliation":[]},{"given":"Masashi","family":"Sadamatsu","sequence":"additional","affiliation":[]},{"given":"Hiroyuki","family":"Narihisa","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"8_CR1","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1287\/ijoc.15.1.82.15157","volume":"15","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Cook, W., Rohe, A.: Chained Lin-Kernighan for large traveling salesman problems. INFORMS Journal on Computing\u00a015(1), 82\u201392 (2003)","journal-title":"INFORMS Journal on Computing"},{"issue":"4","key":"8_CR2","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":"8_CR3","first-page":"1","volume-title":"Handbook of Combinatorial Optimization (suppl. 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 (suppl. Vol. A), pp. 1\u201374. Kluwer, Dordrecht (1999)"},{"key":"8_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"1","key":"8_CR5","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":"8_CR6","doi-asserted-by":"publisher","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\u2009\u2212\u2009\u03b5 . Acta. Mathematica\u00a0182, 105\u2013142 (1999)","journal-title":"Acta Mathematica"},{"key":"8_CR7","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D.S. Johnson","year":"1997","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: A case study. In: Aarts, E., Lenstra, J.K. (eds.) Local Search in Combinatorial Optimization, pp. 215\u2013310. John Wiley & Sons, New York (1997)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Johnson, D.S., Trick, M.A.: Cliques, Coloring, and Satisfiability. Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society (1996)","DOI":"10.1090\/dimacs\/026"},{"issue":"5","key":"8_CR9","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(5), 503\u2013511 (2005)","journal-title":"Information Processing Letters"},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Katayama, K., Narihisa, H.: Iterated local search approach using genetic transformation to the traveling salesman problem. In: Proc. of the Genetic and Evolutionary Computation Conference, pp. 321\u2013328 (1999)","DOI":"10.1145\/298151.298359"},{"key":"8_CR11","unstructured":"Katayama, K., Tani, M., Narihisa, H.: Solving large binary quadratic programming problems by effective genetic local search algorithm. In: Proc. of the Genetic and Evolutionary Computation Conference, pp. 643\u2013650 (2000)"},{"key":"8_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal\u00a049, 291\u2013307 (1970)","journal-title":"Bell System Technical Journal"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Khot, S.: Improved inapproximability results for maxclique, chromatic number and approximate graph coloring. In: Proceedings of the 42nd IEEE symposium on Foundations of Computer Science, pp. 600\u2013609 (2001)","DOI":"10.1109\/SFCS.2001.959936"},{"key":"8_CR14","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling salesman problem. Operations Research\u00a021, 498\u2013516 (1973)","journal-title":"Operations Research"},{"key":"8_CR15","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2003)"},{"key":"8_CR16","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: Cagnoni, S., Gottlieb, J., Hart, E., Middendorf, M., Raidl, G.R. (eds.) EvoIASP 2002, EvoWorkshops 2002, EvoSTIM 2002, EvoCOP 2002, and EvoPlan 2002. LNCS, vol.\u00a02279, pp. 112\u2013121. Springer, Heidelberg (2002)"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1162\/106365600568103","volume":"8","author":"P. Merz","year":"2000","unstructured":"Merz, P., Freisleben, B.: Fitness landscapes, memetic algorithms and greedy operators for graph bi-partitioning. Evolutionary Computation\u00a08(1), 61\u201391 (2000)","journal-title":"Evolutionary Computation"},{"issue":"1\u20133","key":"8_CR18","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.biosystems.2004.08.002","volume":"78","author":"P. Merz","year":"2004","unstructured":"Merz, P., Katayama, K.: Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems\u00a078(1\u20133), 99\u2013118 (2004)","journal-title":"BioSystems"},{"key":"8_CR19","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of Metaheuristics","author":"P. Moscato","year":"2003","unstructured":"Moscato, P., Cotta, C.: A gentle introduction to memetic algorithms. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, pp. 105\u2013144. Kluwer Academic Publishers, Norwell (2003)"},{"issue":"1\u20133","key":"8_CR20","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"P.R.J. \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics\u00a0120(1\u20133), 197\u2013207 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1613\/jair.1815","volume":"25","author":"W. Pullan","year":"2006","unstructured":"Pullan, W., Hoos, H.H.: Dynamic local search for the maximum clique problem. Journal of Artificial Intelligence Research\u00a025, 159\u2013185 (2006)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"1-2","key":"8_CR22","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10732-006-3750-x","volume":"12","author":"A. Singh","year":"2006","unstructured":"Singh, A., Gupta, A.K.: A hybrid heuristic for the maximum clique problem. Journal of Heuristics\u00a012(1-2), 5\u201322 (2006)","journal-title":"Journal of Heuristics"},{"key":"8_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-45066-1_22","volume-title":"Discrete Mathematics and Theoretical Computer Science","author":"E. Tomita","year":"2003","unstructured":"Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. In: Calude, C.S., Dinneen, M.J., Vajnovszki, V. (eds.) DMTCS 2003. LNCS, vol.\u00a02731, pp. 278\u2013289. Springer, Heidelberg (2003)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71615-0_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T07:16:28Z","timestamp":1556349388000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71615-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716143","9783540716150"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}