{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:56:57Z","timestamp":1773385017396,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T00:00:00Z","timestamp":1333497600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2012,7]]},"DOI":"10.1007\/s10479-012-1124-3","type":"journal-article","created":{"date-parts":[[2012,4,3]],"date-time":"2012-04-03T07:26:40Z","timestamp":1333438000000},"page":"611-634","source":"Crossref","is-referenced-by-count":81,"title":["Multi-neighborhood tabu search for the maximum weight clique problem"],"prefix":"10.1007","volume":"196","author":[{"given":"Qinghua","family":"Wu","sequence":"first","affiliation":[]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,4,4]]},"reference":[{"issue":"2","key":"1124_CR1","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"86","author":"B. Alidaee","year":"2008","unstructured":"Alidaee, B., Kochenberger, G. A., Lewis, K., Lewis, M., & Wang, H. (2008). A new approach for modelling and solving set packing problems. European Journal of Operational Research, 86(2), 504\u2013512.","journal-title":"European Journal of Operational Research"},{"key":"1124_CR2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02243394","volume":"52","author":"L. Babel","year":"1994","unstructured":"Babel, L. (1994). A fast algorithm for the maximum weight clique problem. Computing, 52, 31\u201338.","journal-title":"Computing"},{"key":"1124_CR3","volume-title":"Computer vision","author":"D. Ballard","year":"1982","unstructured":"Ballard, D., & Brown, C. (1982). Computer vision. Englewood Cliffs: Prentice-Hall."},{"key":"1124_CR4","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1016\/j.cor.2009.02.013","volume":"37","author":"R. Battiti","year":"2010","unstructured":"Battiti, R., & Mascia, F. (2010). Reactive and dynamic local search for the Max-Clique problem: engineering effective building blocks. Computers & Operations Research, 37, 534\u2013542.","journal-title":"Computers & Operations Research"},{"issue":"4","key":"1124_CR5","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1007\/s004530010074","volume":"29","author":"R. Battiti","year":"2001","unstructured":"Battiti, R., & Protasi, M. (2001). Reactive local search for the maximum clique problem. Algorithmica, 29(4), 610\u2013637.","journal-title":"Algorithmica"},{"key":"1124_CR6","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/72.883403","volume":"11","author":"I. M. Bomze","year":"2000","unstructured":"Bomze, I. M., Pelillo, M., & Stix, V. (2000). Approximating the maximum weight clique using replicator dynamics. IEEE Transactions on Neural Networks, 11, 1228\u20131241.","journal-title":"IEEE Transactions on Neural Networks"},{"key":"1124_CR7","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.dam.2005.04.010","volume":"154","author":"S. Busygin","year":"2006","unstructured":"Busygin, S. (2006). A new trust region technique for the maximum weight clique problem. Discrete Applied Mathematics, 154, 2080\u20132096.","journal-title":"Discrete Applied Mathematics"},{"issue":"9\u201310","key":"1124_CR8","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S. Cai","year":"2011","unstructured":"Cai, S., Su, K., & Chen, Q. (2011). Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artificial Intelligence, 175(9\u201310), 1672\u20131696.","journal-title":"Artificial Intelligence"},{"key":"1124_CR9","doi-asserted-by":"crossref","first-page":"564","DOI":"10.1016\/S0377-2217(03)00263-7","volume":"153","author":"X. Delorme","year":"2004","unstructured":"Delorme, X., Gandibleux, X., & Rodriguez, J. (2004). GRASP for set packing problems. European Journal of Operational Research, 153, 564\u2013580.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"1124_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10852-005-9032-z","volume":"5","author":"L. Gaspero Di","year":"2006","unstructured":"Di Gaspero, L., & Schaerf, A. (2006). Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modelling and Algorithms, 5(1), 65\u201389.","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"1124_CR11","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BF02243141","volume":"42","author":"C. Friden","year":"1989","unstructured":"Friden, C., Hertz, A., & de Werra, D. (1989). Stabulus: a technique for finding stable sets in large graphs with tabu search. Computing, 42, 35\u201344.","journal-title":"Computing"},{"key":"1124_CR12","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF02023002","volume":"41","author":"M. Gendreau","year":"1993","unstructured":"Gendreau, M., Soriano, P., & Salvail, L. (1993). Solving the maximum clique problem using a tabu search approach. Annals of Operations Research, 41, 385\u2013403.","journal-title":"Annals of Operations Research"},{"key":"1124_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F. Glover","year":"1997","unstructured":"Glover, F., & Laguna, M. (1997). Tabu search. Boston: Kluwer Academic."},{"key":"1124_CR14","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., & Croce, F. D. (2004). Combining swaps and node weights in an adaptive greedy approach for the maximum clique problem. Journal of Heuristics, 10, 135\u2013152.","journal-title":"Journal of Heuristics"},{"key":"1124_CR15","volume-title":"Cliques, coloring, and satisfiability: second DIMACS Implementation Challenge. DIMACS series in discrete mathematics and theoretical computer science","year":"1996","unstructured":"Johnson, D. S., & Trick, M. A. (Eds.) (1996). Cliques, coloring, and satisfiability: second DIMACS Implementation Challenge. DIMACS series in discrete mathematics and theoretical computer science (Vol.\u00a026). Providence: AMS."},{"key":"1124_CR16","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of computer computations","author":"R. M. Karp","year":"1972","unstructured":"Karp, R. M. (1972). Reducibility among combinatorial problems. In R. E. Miller & J. W. Thatcher (Eds.), Complexity of computer computations (pp. 85\u2013103). New York: Plenum Press."},{"key":"1124_CR17","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. (2005). An effective local search for the maximum clique problem. Information Processing Letters, 95, 503\u2013511.","journal-title":"Information Processing Letters"},{"issue":"1","key":"1124_CR18","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1016\/j.ejor.2004.01.049","volume":"167","author":"R. H. Kwon","year":"2005","unstructured":"Kwon, R. H. (2005). Data dependent worst case bounds for weighted set packing. European Journal of Operational Research, 167(1), 68\u201376.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"1124_CR19","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"Z. L\u00fc","year":"2011","unstructured":"L\u00fc, Z., Hao, J. K., & Glover, F. (2011). Neighborhood analysis: a case study on curriculum-based course timetabling. Journal of Heuristics, 17(2), 97\u2013118.","journal-title":"Journal of Heuristics"},{"key":"1124_CR20","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1026456624746","volume":"14","author":"C. Mannino","year":"1999","unstructured":"Mannino, C., & Stefanutti, E. (1999). An augmentation algorithm for the maximum weighted stable set problem. Computational Optimization and Applications, 14, 367\u2013381.","journal-title":"Computational Optimization and Applications"},{"key":"1124_CR21","first-page":"424","volume":"8","author":"P. R. J. \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P. R. J. (2001). A new algorithm for the maximum weight clique problem. Nordic Journal of Computing, 8, 424\u2013436.","journal-title":"Nordic Journal of Computing"},{"issue":"2","key":"1124_CR22","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W. Pullan","year":"2008","unstructured":"Pullan, W. (2008). Approximating the maximum vertex\/edge weighted clique using local search. Journal of Heuristics, 14(2), 117\u2013134.","journal-title":"Journal of Heuristics"},{"key":"1124_CR23","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. (2006). Dynamic local search for the maximum clique problem. The Journal of Artificial Intelligence Research, 25, 159\u2013185.","journal-title":"The Journal of Artificial Intelligence Research"},{"key":"1124_CR24","author":"Q. Wu","year":"2012","unstructured":"Wu, Q., & Hao, J. K. (2012). An adaptive multistart tabu search approach to solve the maximum clique problem. Journal of Combinatorial Optimization. doi: 10.1007\/s10878-011-9437-8 .","journal-title":"Journal of Combinatorial Optimization"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1124-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-012-1124-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-012-1124-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,26]],"date-time":"2019-06-26T15:58:54Z","timestamp":1561564734000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-012-1124-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,4,4]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["1124"],"URL":"https:\/\/doi.org\/10.1007\/s10479-012-1124-3","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,4,4]]}}}