{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T15:15:38Z","timestamp":1725981338034},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319936581"},{"type":"electronic","value":"9783319936598"}],"license":[{"start":{"date-parts":[[2018,6,19]],"date-time":"2018-06-19T00:00:00Z","timestamp":1529366400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-93659-8_61","type":"book-chapter","created":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T14:00:55Z","timestamp":1529330455000},"page":"670-680","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Restart Diversification Strategy for Iterated Local Search to Maximum Clique Problem"],"prefix":"10.1007","author":[{"given":"Kazuho","family":"Kanahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kengo","family":"Katayama","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Okano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elis","family":"Kulla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Oda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noritaka","family":"Nishihara","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,19]]},"reference":[{"issue":"4","key":"61_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 29(4), 610\u2013637 (2001)","journal-title":"Algorithmica"},{"key":"61_CR2","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"IM 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, vol. A (suppl.), pp. 1\u201374. Kluwer, Boston (1999)"},{"key":"61_CR3","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR 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)"},{"key":"61_CR4","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 - \\epsilon }$$n1-\u03f5. Acta Math. 182, 105\u2013142 (1999)","journal-title":"Acta Math."},{"key":"61_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability","author":"David Johnson","year":"1996","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)"},{"issue":"5","key":"61_CR6","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. Inf. Process. Lett. 95(5), 503\u2013511 (2005)","journal-title":"Inf. Process. Lett."},{"key":"61_CR7","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-540-71615-0_8","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"Kengo Katayama","year":"2007","unstructured":"Katayama, K., Sadamatsu, M., Narihisa, H.: Iterated k-opt local search for the maximum clique problem. In: Evolutionary Computation in Combinatorial Optimization. LNCS, vol. 4446, pp. 84\u201395. Springer (2007)"},{"key":"61_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"BW Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291\u2013307 (1970)","journal-title":"Bell Syst. Tech. J."},{"key":"61_CR9","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":"61_CR10","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. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"61_CR11","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":"HR 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. 57, pp. 321\u2013353. Kluwer Academic Publishers, Norwell (2003)"},{"issue":"3","key":"61_CR12","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu, Q., Hao, J.-K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693\u2013709 (2015)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Advances in Intelligent Systems and Computing","Complex, Intelligent, and Software Intensive Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-93659-8_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,6,18]],"date-time":"2018-06-18T14:39:40Z","timestamp":1529332780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-93659-8_61"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,19]]},"ISBN":["9783319936581","9783319936598"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-93659-8_61","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,6,19]]}}}