{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T21:13:10Z","timestamp":1725657190584},"publisher-location":"Boston, MA","reference-count":26,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781461355885"},{"type":"electronic","value":"9781461515074"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4615-1507-4_11","type":"book-chapter","created":{"date-parts":[[2012,2,5]],"date-time":"2012-02-05T23:30:47Z","timestamp":1328484647000},"page":"227-244","source":"Crossref","is-referenced-by-count":9,"title":["A Scatter Search Algorithm for the Maximum Clique Problem"],"prefix":"10.1007","author":[{"given":"Lu\u00eds","family":"Cavique","sequence":"first","affiliation":[]},{"given":"C\u00e9sar","family":"Rego","sequence":"additional","affiliation":[]},{"given":"Isabel","family":"Themido","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1009646528813","volume":"4","author":"E Balas","year":"1998","unstructured":"E. Balas and W. Niehaus. Optimized Crossover-Based Genetic Algorithms will be the Maximum Cardinality and Maximum Weight Clique Problems. Journal of Heuristics, 4:107\u2013122, 1998.","journal-title":"Journal of Heuristics"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R Battiti","year":"2001","unstructured":"R. Battiti and M. Protasi. Reactive Local Search for the Maximum Clique Problem. Algorithmica,29:610\u2013637, 2001.","journal-title":"Algorithmica"},{"key":"11_CR3","volume-title":"Theory of Graphs and its Applications","author":"C Berge","year":"1962","unstructured":"C. Berge. Theory of Graphs and its Applications. Methuen, 1962."},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1090\/dimacs\/026\/05","volume":"26","author":"M Brockington","year":"1996","unstructured":"M. Brockington and J.C. Culberson. Camouflaging Independent Sets in Quasi-Random Graphs. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26:75\u201389, 1996.","journal-title":"DIM ACS Series on Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR5","unstructured":"L. Cavique, C. Rego, and I. Themido. Estruturas de Vizinhanga e Algoritmos de Procura Local para o Problema da Clique M\u00e1xima. To appear in: Revista de Investiga\u00e7\u00e3o Operacional."},{"key":"11_CR6","volume-title":"Graph Theory: An Algorithmic Approach","author":"N Christofides","year":"1975","unstructured":"N. Christofides. Graph Theory: An Algorithmic Approach. Academic Press, 1975."},{"key":"11_CR7","first-page":"165","volume-title":"Proceedings of IEEE International Conference on Evolutionary Computation","author":"V-D Cung","year":"1997","unstructured":"V.-D. Cung, T. Mautor, P. Michelon, and A. Tavares. A Scatter Search Based Approach for the Quadratic Assignment Problem. In: Proceedings of IEEE International Conference on Evolutionary Computation, pages 165\u2013169, 1997."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"TA Feo","year":"1994","unstructured":"T.A. Feo, M.G. Resende, and S.H. Smith. A Greedy Randomized Adaptive Search Procedure for Maximum Independent Set. Operations Research, 42:860\u2013878, 1994.","journal-title":"Operations Research"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"A Hertz","year":"1989","unstructured":"C. Pried, A. Hertz, and D. de Werra. Stabulus: A Technique for Finding Stable Sets in Large Graphs with Tabu Search. Computing, 42:35\u201344,1989.","journal-title":"Computing"},{"key":"11_CR10","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman & Co, 1979."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M Gendreau","year":"1993","unstructured":"M. Gendreau, P. Soriano, and L. Salvail. Solving the Maximum Clique Problem using a Tabu Search Approach. Annals of Operations Research, 41:385\u2013403, 1993.","journal-title":"Annals of Operations Research"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F Glover","year":"1977","unstructured":"F. Glover. Heuristics for Integer Programming using Surrogate Constraints. Decision Science, 8:156\u2013166, 1977.","journal-title":"Decision Science"},{"key":"11_CR13","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"F. Glover. Tabu Search \u2014 Part I. ORSA Journal of Computing, 1:190\u2013206, 1989.","journal-title":"ORSA Journal of Computing"},{"key":"11_CR14","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F Glover","year":"1995","unstructured":"F. Glover. Tabu Thresholding: Improved Search by Nonmonotonic Trajectories. ORSA Journal on Computing, 7:426\u2013442, 1995.","journal-title":"ORSA Journal on Computing"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BFb0026589","volume":"1363","author":"F Glover","year":"1998","unstructured":"F. Glover. A Template for Scatter Search and Path Relinking. Lecture Notes in Computer Science, 1363:13\u201354, 1998.","journal-title":"Lecture Notes in Computer Science"},{"key":"11_CR16","first-page":"297","volume-title":"New Ideas in Optimization","author":"F Glover","year":"1999","unstructured":"F. Glover. Scatter Search and Path Relinking. In: New Ideas in Optimization, D. Corne, M. Dorigo, and F. Glover, editors, pages 297\u2013316, McGraw Hill, 1999."},{"key":"11_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"F. Glover and M. Laguna. Tabu Search. Kluwer, 1997."},{"key":"11_CR18","first-page":"248","volume-title":"IEEE, International Joint Conference on Neural Networks","author":"A Jagota","year":"1992","unstructured":"A. Jagota. Efficient Approximating Max-Clique in a Holpfield-Style Network. In: IEEE, International Joint Conference on Neural Networks, vol. 2, pages 248\u2013253, Baltimore, 1992."},{"key":"11_CR19","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1090\/dimacs\/026\/10","volume":"26","author":"A Jagota","year":"1996","unstructured":"A. Jagota, L. Sanchis, and R. Ganesan. Approximately Solving Maximum Clique using Neural Network Related Heuristics. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26:169\u2013203, 1996.","journal-title":"DIM ACS Series on Discrete Mathematics and Theoretical Computer Science"},{"key":"11_CR20","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"DS Johnson","year":"1974","unstructured":"D.S. Johnson. Approximation Algorithms for Combinatorial Problems. Journal of Computer and System Science, 9:256\u2013278, 1974.","journal-title":"Journal of Computer and System Science"},{"key":"11_CR21","first-page":"26","volume-title":"Clique, Coloring and Satisfiability. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science","year":"1996","unstructured":"D.S. Johnson and M.A. Trick (editors). Clique, Coloring and Satisfiability. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26, 1996."},{"key":"11_CR22","series-title":"Scatter Search","volume-title":"Scatter Search","author":"M Laguna","year":"1999","unstructured":"M. Laguna. Scatter Search. Research Report, University of Colorado, Boulder, 1999."},{"key":"11_CR23","series-title":"Economic Working Papers Series","volume-title":"Meta-Heuristics for the BusDriver Scheduling Problem","author":"H Lourengo","year":"1999","unstructured":"H. Lourengo, J. Paix\u00e3o, and R. Portugal. Meta-Heuristics for the BusDriver Scheduling Problem. Economic Working Papers Series 304, Universitat Pompeu Fabra, Barcelone, 1999."},{"key":"11_CR24","unstructured":"C. Rego and P. Le\u00e3o. A Scatter Search Tutorial for Graph-Based Permutation Problems. Research Paper HCES-10\u201300, Hearin Center for Enterprise Science, University of Mississippi, 2000."},{"key":"11_CR25","volume-title":"Alg\u00e8bre moderne et th\u00e9orie des graphes","author":"B Roy","year":"1970","unstructured":"B. Roy. Alg\u00e8bre moderne et th\u00e9orie des graphes. Tome 2, Dunod, 1970."},{"key":"11_CR26","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1090\/dimacs\/026\/12","volume":"26","author":"P Soriano","year":"1996","unstructured":"P. Soriano and M. Gendreau. Tabu Search Algorithms for the Maximum Clique. DIM ACS Series on Discrete Mathematics and Theoretical Computer Science, 26:221\u2013242, 1996.","journal-title":"DIM ACS Series on Discrete Mathematics and Theoretical Computer Science"}],"container-title":["Operations Research\/Computer Science Interfaces Series","Essays and Surveys in Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4615-1507-4_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,1]],"date-time":"2021-05-01T09:35:13Z","timestamp":1619861713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4615-1507-4_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781461355885","9781461515074"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-1-4615-1507-4_11","relation":{},"ISSN":["1387-666X"],"issn-type":[{"type":"print","value":"1387-666X"}],"subject":[],"published":{"date-parts":[[2002]]}}}