{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T20:25:13Z","timestamp":1778099113965,"version":"3.51.4"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:00:00Z","timestamp":1489104000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1007\/s11590-017-1128-7","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T15:57:51Z","timestamp":1489161471000},"page":"567-583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":45,"title":["A hybrid iterated local search heuristic for the maximum weight independent set problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Bruno","family":"Nogueira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rian G. S.","family":"Pinheiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,10]]},"reference":[{"key":"1128_CR1","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, Berlin (1972)"},{"issue":"3","key":"1128_CR2","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1089\/cmb.2010.0280","volume":"18","author":"F Ay","year":"2011","unstructured":"Ay, F., Kellis, M., Kahveci, T.: Submap: aligning metabolic pathways with subnetwork mappings. J. Comput. Biol. 18(3), 219\u2013235 (2011)","journal-title":"J. Comput. Biol."},{"key":"1128_CR3","doi-asserted-by":"crossref","unstructured":"Chou, J., Kim, J., Rotem, D.: Energy-aware scheduling in disk storage systems, in 2011 31st International Conference on Distributed Computing Systems (ICDCS), IEEE, pp. 423\u2013433 (2011)","DOI":"10.1109\/ICDCS.2011.40"},{"issue":"3\u20134","key":"1128_CR4","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/00207169108803967","volume":"38","author":"PM Pardalos","year":"1991","unstructured":"Pardalos, P.M., Desai, N.: An algorithm for finding a maximum weighted independent set in an arbitrary graph. Int. J. Comput. Math. 38(3\u20134), 163\u2013175 (1991)","journal-title":"Int. J. Comput. Math."},{"issue":"1","key":"1128_CR5","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF02243394","volume":"52","author":"L Babel","year":"1994","unstructured":"Babel, L.: A fast algorithm for the maximum weight clique problem. Computing 52(1), 31\u201338 (1994)","journal-title":"Computing"},{"issue":"4","key":"1128_CR6","first-page":"424","volume":"8","author":"PR \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd, P.R.: A new algorithm for the maximum-weight clique problem. Nord. J. Comput. 8(4), 424\u2013436 (2001)","journal-title":"Nord. J. Comput."},{"issue":"4","key":"1128_CR7","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1002\/net.20088","volume":"46","author":"D Warrier","year":"2005","unstructured":"Warrier, D., Wilhelm, W.E., Warren, J.S., Hicks, I.V.: A branch-and-price approach for the maximum weight independent set problem. Networks 46(4), 198\u2013209 (2005)","journal-title":"Networks"},{"key":"1128_CR8","unstructured":"Yamaguchi, K., Masuda, S.: A new exact algorithm for the maximum weight clique problem, in 23rd international conference on circuit\/systems, computers and communications (ITC-CSCC08), Vol.\u00a065, p.\u00a068 (2008)"},{"issue":"1\u20132","key":"1128_CR9","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1007\/BF02832348","volume":"25","author":"SMA Nayeem","year":"2007","unstructured":"Nayeem, S.M.A., Pal, M.: Genetic algorithmic approach to find the maximum weight independent set of a graph. J. Appl. Math. Comput. 25(1\u20132), 217\u2013229 (2007)","journal-title":"J. Appl. Math. Comput."},{"issue":"2","key":"1128_CR10","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/s10732-007-9026-2","volume":"14","author":"W Pullan","year":"2008","unstructured":"Pullan, W.: Approximating the maximum vertex\/edge weighted clique using local search. J. Heuristics 14(2), 117\u2013134 (2008)","journal-title":"J. Heuristics"},{"issue":"2","key":"1128_CR11","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/j.disopt.2008.12.001","volume":"6","author":"W Pullan","year":"2009","unstructured":"Pullan, W.: Optimisation of unweighted\/weighted maximum independent sets and minimum vertex covers. Discrete Optim. 6(2), 214\u2013219 (2009)","journal-title":"Discrete Optim."},{"issue":"1","key":"1128_CR12","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1007\/s10479-012-1124-3","volume":"196","author":"Q Wu","year":"2012","unstructured":"Wu, Q., Hao, J.-K., Glover, F.: Multi-neighborhood tabu search for the maximum weight clique problem. Ann. Oper. Res. 196(1), 611\u2013634 (2012)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"1128_CR13","doi-asserted-by":"crossref","first-page":"192","DOI":"10.1016\/j.cor.2012.06.002","volume":"40","author":"U Benlic","year":"2013","unstructured":"Benlic, U., Hao, J.-K.: Breakout local search for maximum clique problems. Comput. Oper. Res. 40(1), 192\u2013206 (2013)","journal-title":"Comput. Oper. Res."},{"key":"1128_CR14","doi-asserted-by":"publisher","unstructured":"Wang, Y., Hao, J.-K., Glover, F., L\u00fc, Z., Wu, Q.: Solving the maximum vertex weight clique problem via binary quadratic programming. J. Comb. Optim. 32(2), 531\u2013549 (2016). doi: 10.1007\/s10878-016-9990-2","DOI":"10.1007\/s10878-016-9990-2"},{"key":"1128_CR15","series-title":"Ch. Iterated Local Search, Framework and Applications","volume-title":"Handbook of Metaheuristics","author":"HR Louren\u00e7o","year":"2010","unstructured":"Louren\u00e7o, H.R., Martin, O.C., St\u00fctzle, T.: Handbook of Metaheuristics. Ch. Iterated Local Search, Framework and Applications. Springer, Berlin (2010)"},{"key":"1128_CR16","series-title":"Ch. Variable Neighborhood Search","volume-title":"Handbook of Metaheuristics","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., Prez, J.: Handbook of Metaheuristics. Ch. Variable Neighborhood Search. Springer, Berlin (2010)"},{"issue":"1","key":"1128_CR17","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10878-014-9756-7","volume":"31","author":"L Bastos","year":"2016","unstructured":"Bastos, L., Ochi, L.S., Protti, F., Subramanian, A., Martins, I.C., Pinheiro, R.G.S.: Efficient algorithms for cluster editing. J. Comb. Optim. 31(1), 347\u2013371 (2016)","journal-title":"J. Comb. Optim."},{"issue":"4","key":"1128_CR18","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1007\/s10732-012-9196-4","volume":"18","author":"DV Andrade","year":"2012","unstructured":"Andrade, D.V., Resende, M.G., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525\u2013547 (2012)","journal-title":"J. Heuristics"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-017-1128-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1128-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-017-1128-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,19]],"date-time":"2019-09-19T15:51:28Z","timestamp":1568908288000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-017-1128-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,10]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["1128"],"URL":"https:\/\/doi.org\/10.1007\/s11590-017-1128-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,10]]}}}