{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:26:34Z","timestamp":1778646394855,"version":"3.51.4"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,5]],"date-time":"2010-01-05T00:00:00Z","timestamp":1262649600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2010,10]]},"DOI":"10.1007\/s10288-009-0115-y","type":"journal-article","created":{"date-parts":[[2010,1,4]],"date-time":"2010-01-04T06:04:10Z","timestamp":1262585050000},"page":"239-253","source":"Crossref","is-referenced-by-count":74,"title":["Diversification-driven tabu search for unconstrained binary quadratic problems"],"prefix":"10.1007","volume":"8","author":[{"given":"Fred","family":"Glover","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,1,5]]},"reference":[{"key":"115_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B Alidaee","year":"1994","unstructured":"Alidaee B, Kochenberger GA, Ahmadian A (1994) 0\u20131 quadratic programming approach for the optimal solution of two scheduling problems. Int J Syst Sci 25: 401\u2013408","journal-title":"Int J Syst Sci"},{"issue":"2","key":"115_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 problems. Eur J Oper Res 86(2): 504\u2013512","journal-title":"Eur J Oper Res"},{"key":"115_CR3","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"TM Alkhamis","year":"1998","unstructured":"Alkhamis TM, Hasan M, Ahmed MA (1998) Simulated annealing for the unconstrained binary quadratic pseudo-boolean function. Eur J Oper Res 108: 641\u2013652","journal-title":"Eur J Oper Res"},{"key":"115_CR4","unstructured":"Amini M, Alidaee B, Kochenberger GA (1999) A scatter search approach to unconstrained quadratic binary programs. McGraw-Hill, New York, pp 317\u2013330. New Methods in Optimization"},{"key":"115_CR5","doi-asserted-by":"crossref","first-page":"429","DOI":"10.1007\/BF02404002","volume":"8","author":"JE Beasley","year":"1996","unstructured":"Beasley JE (1996) Obtaining test problems via internet. J Glob Optim 8: 429\u2013433","journal-title":"J Glob Optim"},{"key":"115_CR6","unstructured":"Beasley JE (1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. Working Paper, The Management School, Imperial College, London, England"},{"key":"115_CR7","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-31182-3_1","volume":"2","author":"I Borgulya","year":"2005","unstructured":"Borgulya I (2005) An evolutionary algorithm for the binary quadratic problems. Adv Soft Comput 2: 3\u201316","journal-title":"Adv Soft Comput"},{"key":"115_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","volume":"13","author":"E Boros","year":"2007","unstructured":"Boros E, Hammer PL, Tavares G (2007) Local search heuristics for quadratic unconstrained binary optimization (QUBO). J Heuristics 13: 99\u2013132","journal-title":"J Heuristics"},{"issue":"4","key":"115_CR9","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P Chardaire","year":"1994","unstructured":"Chardaire P, Sutter A (1994) A decomposition method for quadratic zero-one programming. Manage Sci 41(4): 704\u2013712","journal-title":"Manage Sci"},{"key":"115_CR10","first-page":"132","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo G, Hammer P, Simeone B (1980) Quadratic knapsack problems. Math Programm 12: 132\u2013149","journal-title":"Math Programm"},{"key":"115_CR11","doi-asserted-by":"crossref","unstructured":"Glover F, Hao JK (2009a) Efficient evaluations for solving large 0-1 unconstrained quadratic optimization problems. To appear in Int J Metaheuristics, 1(1)","DOI":"10.1504\/IJMHEUR.2010.033120"},{"key":"115_CR12","doi-asserted-by":"crossref","unstructured":"Glover F, Hao JK (2009b) Fast 2-flip move evaluations for binary unconstrained quadratic optimization problems. To appear in Int J Metaheuristics","DOI":"10.1504\/IJMHEUR.2010.034201"},{"key":"115_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. Kluwer, Boston"},{"key":"115_CR14","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"F Glover","year":"1998","unstructured":"Glover F, Kochenberger GA, Alidaee B (1998) Adaptive memory tabu search for binary quadratic programs. Manag Sci 44: 336\u2013345","journal-title":"Manag Sci"},{"key":"115_CR15","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F Harary","year":"1953","unstructured":"Harary F (1953) On the notion of balanced of a signed graph. Mich Math J 2: 143\u2013146","journal-title":"Mich Math J"},{"key":"115_CR16","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0377-2217(00)00242-3","volume":"134","author":"K Katayama","year":"2001","unstructured":"Katayama K, Narihisa H (2001) Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur J Oper Res 134: 103\u2013119","journal-title":"Eur J Oper Res"},{"key":"115_CR17","unstructured":"Katayama K, Tani M, Narihisa H (2000) Solving large binary quadratic programming problems by an effective genetic local search algorithm. In: Proceedings of the genetic and evolutionary computation conference (GECCO\u201900). Morgan Kaufmann, pp 643\u2013650"},{"key":"115_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 Spectrum 26: 237\u2013250","journal-title":"OR Spectrum"},{"key":"115_CR19","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"GA Kochenberger","year":"2005","unstructured":"Kochenberger GA, Glover F, Alidaee B, Rego C (2005) An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann Oper Res 139: 229\u2013241","journal-title":"Ann Oper Res"},{"key":"115_CR20","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J Krarup","year":"1978","unstructured":"Krarup J, Pruzan A (1978) Computer aided layout design. Math Programm Study 9: 75\u201394","journal-title":"Math Programm Study"},{"key":"115_CR21","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","volume":"14","author":"DJ Laughunn","year":"1970","unstructured":"Laughunn DJ (1970) Quadratic binary programming. Oper Res 14: 454\u2013461","journal-title":"Oper Res"},{"issue":"3","key":"115_CR22","doi-asserted-by":"crossref","first-page":"807","DOI":"10.1016\/j.cor.2006.04.002","volume":"35","author":"M Lewis","year":"2008","unstructured":"Lewis M, Kochenberger GA, Alidaee B (2008) A new modeling and solution approach for the set-partitioning problem. Comput Oper Res 35(3): 807\u2013813","journal-title":"Comput Oper Res"},{"issue":"3","key":"115_CR23","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A Lodi","year":"1999","unstructured":"Lodi A, Allemand K, Liebling TM (1999) An evolutionary heuristic for quadratic 0-1 programming. Eur J Oper Res 119(3): 662\u2013670","journal-title":"Eur J Oper Res"},{"key":"115_CR24","unstructured":"L\u00fc Z, Hao JK (2009) A critical element-guided perturbation strategy for iterated local search. In: Cotta C, Cowling P (eds) Ninth European conference on evolutionary computation in combinatorial optimization (EvoCop 2009). Springer, LNCS 5482, pp 1\u201312"},{"key":"115_CR25","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"RD McBride","year":"1980","unstructured":"McBride RD, Yormark JS (1980) An implicit enumeration algorithm for quadratic integer programming. Manag Sci 26: 282\u2013296","journal-title":"Manag Sci"},{"key":"115_CR26","unstructured":"Merz P, Freisleben B (1999) Genetic algorithms for binary quadratic programming. In: Proceedings of the genetic and evolutionary computation conference (GECCO\u201999). Morgan Kaufmann, pp 417\u2013424"},{"key":"115_CR27","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P Merz","year":"2002","unstructured":"Merz P, Freisleben B (2002) Greedy and local search heuristics for unconstrained binary quadratic programming. J Heuristics 8: 197\u2013213","journal-title":"J Heuristics"},{"key":"115_CR28","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.biosystems.2004.08.002","volume":"78","author":"P Merz","year":"2004","unstructured":"Merz P, Katayama K (2004) Memetic algorithms for the unconstrained binary quadratic programming problem. BioSystems 78: 99\u2013118","journal-title":"BioSystems"},{"key":"115_CR29","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G Palubeckis","year":"2004","unstructured":"Palubeckis G (2004) Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann Oper Res 131: 259\u2013282","journal-title":"Ann Oper Res"},{"issue":"2","key":"115_CR30","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G Palubeckis","year":"2006","unstructured":"Palubeckis G (2006) Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2): 279\u2013296","journal-title":"Informatica"},{"key":"115_CR31","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P Pardalos","year":"1990","unstructured":"Pardalos P, Rodgers GP (1990) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45: 131\u2013144","journal-title":"Computing"},{"key":"115_CR32","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P Pardalos","year":"1994","unstructured":"Pardalos P, Xue J (1994) The maximum clique problem. J Glob Optim 4: 301\u2013328","journal-title":"J Glob Optim"},{"key":"115_CR33","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"AT Phillips","year":"1994","unstructured":"Phillips AT, Rosen JB (1994) A quadratic assignment formulation of the molecular conformation problem. J Glob Optim 4: 229\u2013241","journal-title":"J Glob Optim"},{"key":"115_CR34","doi-asserted-by":"crossref","unstructured":"Witsgall C (1975) Mathematical methods of site selection for electronic system (ems). NBS Internal Report","DOI":"10.6028\/NBS.IR.75-737"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0115-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-009-0115-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-009-0115-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,26]],"date-time":"2020-05-26T11:05:01Z","timestamp":1590491101000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-009-0115-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,5]]},"references-count":34,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["115"],"URL":"https:\/\/doi.org\/10.1007\/s10288-009-0115-y","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,5]]}}}