{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T02:21:53Z","timestamp":1771467713087,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T00:00:00Z","timestamp":1453334400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-016-9990-2","type":"journal-article","created":{"date-parts":[[2016,1,21]],"date-time":"2016-01-21T07:51:34Z","timestamp":1453362694000},"page":"531-549","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Solving the maximum vertex weight clique problem via binary quadratic programming"],"prefix":"10.1007","volume":"32","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qinghua","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,21]]},"reference":[{"key":"9990_CR1","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1016\/j.ejor.2006.06.035","volume":"181","author":"B Alidaee","year":"2007","unstructured":"Alidaee B, Glover F, Kochenberger GA, Wang H (2007) Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur J Oper Res 181:592\u2013597","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9990_CR2","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 GA, Lewis K, Lewis M, Wang H (2008) A new approach for modeling and solving set packing problem. Eur J Oper Res 86(2):504\u2013512","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9990_CR3","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(1):31\u201338","journal-title":"Computing"},{"key":"9990_CR4","volume-title":"Computer vision","author":"D Ballard","year":"1983","unstructured":"Ballard D, Brown C (1983) Computer vision. Prentice-Hall, Englewood Cliffs"},{"issue":"1","key":"9990_CR5","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 JK (2013) Breakout local search for maximum clique problems. Comput Oper Res 40(1):192\u2013206","journal-title":"Comput Oper Res"},{"key":"9990_CR6","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/72.883403","volume":"11","author":"IM Bomze","year":"2000","unstructured":"Bomze IM, Pelillo M, Stix V (2000) Approximating the maximum weight clique using replicator dynamics. IEEE Trans Neural Netw 11:1228\u20131241","journal-title":"IEEE Trans Neural Netw"},{"key":"9990_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. Discret Appl Math 154:2080\u20132096","journal-title":"Discret Appl Math"},{"issue":"6","key":"9990_CR8","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0167-6377(90)90057-C","volume":"9","author":"R Carraghan","year":"1990","unstructured":"Carraghan R, Pardalos PM (1990) An exact algorithm for the maximum clique problem. Oper Res Lett 9(6):375\u2013382","journal-title":"Oper Res Lett"},{"issue":"1","key":"9990_CR9","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evolut Comput 1(1):53\u201366","journal-title":"IEEE Trans Evolut Comput"},{"key":"9990_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-Completeness. Freeman, San Francisco"},{"issue":"3","key":"9990_CR11","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover F (1989) Tabu search\u2014Part I. ORSA J Comput 1(3):190\u2013206","journal-title":"ORSA J Comput"},{"issue":"1","key":"9990_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1504\/IJMHEUR.2010.033120","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover F, Hao JK (2010) Efficient evaluation for solving 0\u20131 unconstrained quadratic optimization problems. Int J Metaheuristics 1(1):3\u201310","journal-title":"Int J Metaheuristics"},{"issue":"2","key":"9990_CR13","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1504\/IJMHEUR.2010.034201","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover F, Hao JK (2010) Fast 2-flip move evaluations for binary unconstrained quadratic optimization problems. Int J Metaheuristics 1(2):100\u2013107","journal-title":"Int J Metaheuristics"},{"key":"9990_CR14","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. Kluwer Academic Publishers, Norwell"},{"issue":"3","key":"9990_CR15","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen P, Mladenovi\u0107 N (2001) Variable neighborhood search: principles and applications. Eur J Oper Res 130(3):449\u2013467","journal-title":"Eur J Oper Res"},{"issue":"12","key":"9990_CR16","doi-asserted-by":"crossref","first-page":"2389","DOI":"10.1007\/s11432-010-4112-8","volume":"53","author":"K He","year":"2010","unstructured":"He K, Huang W (2010) A quasi-human algorithm for solving the three-dimensional rectangular packing problem. Sci China Inf Sci 53(12):2389\u20132398","journal-title":"Sci China Inf Sci"},{"key":"9990_CR17","volume-title":"Introduction to global optimization, nonconvex optimization and its applications","author":"R Horst","year":"1995","unstructured":"Horst R, Pardalos PM, Thoai NV (1995) Introduction to global optimization, nonconvex optimization and its applications, vol 3. Kluwer Academic Publishers, Norwell"},{"key":"9990_CR18","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00291-003-0153-3","volume":"26","author":"GA Kochenberger","year":"2004","unstructured":"Kochenberger GA, Glover F, Alidaee B, Rego C (2004) A unified modeling and solution framework for combinatorial optimization problems. OR Spectr 26:237\u2013250","journal-title":"OR Spectr"},{"key":"9990_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s11590-006-0007-4","volume":"1","author":"G Kochenberger","year":"2007","unstructured":"Kochenberger G, Alidaee B, Glover F, Wang HB (2007) An effective modeling and solution approach for the generalized independent set problem. Optim Lett 1:111\u2013117","journal-title":"Optim Lett"},{"issue":"4","key":"9990_CR20","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10732-011-9189-8","volume":"19","author":"G Kochenberger","year":"2013","unstructured":"Kochenberger G, Hao JK, L\u00fc Z, Wang H, Glover F (2013) Solving large scale max cut problems via tabu search. J Heuristics 19(4):565\u2013571","journal-title":"J Heuristics"},{"issue":"1","key":"9990_CR21","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/s10878-014-9734-0","volume":"28","author":"G Kochenberger","year":"2014","unstructured":"Kochenberger G, Hao JK, Glover F, Lewis M, L\u00fc Z, Wang H, Wang Y (2014) The unconstrained binary quadratic programming problem: a survey. J Comb Optim 28(1):58\u201381","journal-title":"J Comb Optim"},{"key":"9990_CR22","first-page":"569","volume":"58","author":"J Konc","year":"2007","unstructured":"Konc J, Jan\u0115zic\u0306 D (2007) An improved branch and bound algorithm for the maximum clique problem. MATCH Commun Math Comput Chem 58:569\u2013590","journal-title":"MATCH Commun Math Comput Chem"},{"key":"9990_CR23","doi-asserted-by":"crossref","unstructured":"Li C, Quan Z (2010) An efficient branch-and-bound algorithm based on MAXSAT for the maximum clique problem. In: Proceedings of the 24th AAAI conference on artificial intelligence, pp 128\u2013133","DOI":"10.1609\/aaai.v24i1.7536"},{"key":"9990_CR24","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/j.cor.2006.04.002","volume":"2008","author":"M Lewis","year":"2008","unstructured":"Lewis M, Kochenberger G, Alidaee B (2008) A new modeling and solution approach for the set-partitioning problem. Comput Oper Res 2008:807\u2013813","journal-title":"Comput Oper Res"},{"issue":"4","key":"9990_CR25","doi-asserted-by":"crossref","first-page":"618","DOI":"10.3390\/a6040618","volume":"6","author":"C Macreesh","year":"2013","unstructured":"Macreesh C, Prosser P (2013) Multi-threading a state-of-the-art maximum clique algorithm. Algorithms 6(4):618\u2013635","journal-title":"Algorithms"},{"key":"9990_CR26","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1026456624746","volume":"14","author":"C Manninno","year":"1999","unstructured":"Manninno C, Stefanutti E (1999) An augmentation algorithm for the maximum weighted stable set problem. Comput Optim Appl 14:367\u2013381","journal-title":"Comput Optim Appl"},{"issue":"4","key":"9990_CR27","first-page":"424","volume":"8","author":"PRJ \u00d6sterg\u00e5rd","year":"2001","unstructured":"\u00d6sterg\u00e5rd PRJ (2001) A new algorithm for the maximum weight clique problem. Nordic J Comput 8(4):424\u2013436","journal-title":"Nordic J Comput"},{"issue":"1","key":"9990_CR28","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/S0166-218X(01)00290-6","volume":"120","author":"PRJ \u00d6sterg\u00e5rd","year":"2002","unstructured":"\u00d6sterg\u00e5rd PRJ (2002) A fast algorithm for the maximum clique problem. Discret Appl Math 120(1):197\u2013207","journal-title":"Discret Appl Math"},{"issue":"4","key":"9990_CR29","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10732-011-9171-5","volume":"19","author":"FM Pajouh","year":"2013","unstructured":"Pajouh FM, Balasumdaram B, Prokopyev O (2013) On characterization of maximal independent sets via quadratic optimization. J Heuristics 19(4):629\u2013644","journal-title":"J Heuristics"},{"issue":"5","key":"9990_CR30","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","volume":"19","author":"PM Pardalos","year":"1992","unstructured":"Pardalos PM, Rodgers GP (1992) A branch and bound algorithm for the maximum clique problem. Comput Oper Res 19(5):363\u2013375","journal-title":"Comput Oper Res"},{"key":"9990_CR31","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. J Heuristics 14:117\u2013134","journal-title":"J Heuristics"},{"issue":"4","key":"9990_CR32","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1007\/s10878-009-9264-3","volume":"21","author":"S Rebennack","year":"2011","unstructured":"Rebennack S, Oswald M, Theis D, Seitz H, Reinelt G, Pardalos PM (2011) A branch and cut solver for the maximum stable set problem. J Comb Optim 21(4):434\u2013457","journal-title":"J Comb Optim"},{"issue":"1\u20132","key":"9990_CR33","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1111\/j.1475-3995.2011.00805.x","volume":"19","author":"S Rebennack","year":"2012","unstructured":"Rebennack S, Reinelt G, Pardalos PM (2012) A tutorial on branch and cut algorithms for the maximum stable set problem. Int Trans Oper Res 19(1\u20132):161\u2013199","journal-title":"Int Trans Oper Res"},{"issue":"2","key":"9990_CR34","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1016\/j.cor.2010.07.019","volume":"38","author":"PS Segundo","year":"2011","unstructured":"Segundo PS, Rodr\u00edguez-Losada D, Jim\u00e9nez A (2011) An exact bitparallel algorithm for the maximum clique problem. Comput Oper Res 38(2):571\u2013581","journal-title":"Comput Oper Res"},{"key":"9990_CR35","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1007\/s007770050063","volume":"51","author":"NS Sengor","year":"1999","unstructured":"Sengor NS, Cakir Y, Guzelis C, Pekergin F, Morgul O (1999) An analysis of maximum clique formulations and saturated linear dynamical network. ARI 51:268\u2013276","journal-title":"ARI"},{"issue":"1","key":"9990_CR36","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E Tomita","year":"2007","unstructured":"Tomita E, Kameda T (2007) An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J Glob Optim 37(1):95\u2013111","journal-title":"J Glob Optim"},{"issue":"12","key":"9990_CR37","doi-asserted-by":"crossref","first-page":"3100","DOI":"10.1016\/j.cor.2011.12.006","volume":"40","author":"Y Wang","year":"2013","unstructured":"Wang Y, L\u00fc Z, Glover F, Hao JK (2013) Probabilistic GRASP-tabu search algorithms for the UBQP problem. Comput Oper Res 40(12):3100\u20133107","journal-title":"Comput Oper Res"},{"key":"9990_CR38","unstructured":"Warren JS, Hicks IV (2006) Combinatorial branch-and-bound for the maximum weight independent set problem. Technical Report, Texas A&M University"},{"key":"9990_CR39","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1016\/j.ejor.2014.09.064","volume":"242","author":"Q Wu","year":"2015","unstructured":"Wu Q, Hao JK (2015) A review on algorithms for maximum clique problems. Eur J Oper Res 242:693\u2013709","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9990_CR40","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 JK, Glover F (2012) Multi-neighborhood tabu search for the maximum weight clique problem. Ann Oper Res 196(1):611\u2013634","journal-title":"Ann Oper Res"},{"issue":"2","key":"9990_CR41","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/S0377-2217(02)00129-7","volume":"141","author":"Y Wu","year":"2002","unstructured":"Wu Y, Huang W, Lau S, Wong CK, Young GH (2002) An effective quasi-human based heuristic for solving the rectangle packing problem. Eur J Oper Res 141(2):341\u2013358","journal-title":"Eur J Oper Res"},{"issue":"1","key":"9990_CR42","first-page":"69","volume":"1","author":"JF Xu","year":"1996","unstructured":"Xu JF, Chiu SY, Glover F (1996) Probabilistic tabu search for telecommunications network design. Comb Optim Theory Pract 1(1):69\u201394","journal-title":"Comb Optim Theory Pract"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9990-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-016-9990-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-016-9990-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,16]],"date-time":"2023-08-16T15:22:15Z","timestamp":1692199335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-016-9990-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,1,21]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9990"],"URL":"https:\/\/doi.org\/10.1007\/s10878-016-9990-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,1,21]]}}}