{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,12,5]],"date-time":"2023-12-05T17:31:05Z","timestamp":1701797465701},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T00:00:00Z","timestamp":1449792000000},"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":["Ann Oper Res"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10479-015-2076-1","type":"journal-article","created":{"date-parts":[[2015,12,11]],"date-time":"2015-12-11T04:00:26Z","timestamp":1449806426000},"page":"651-657","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["f-Flip strategies for unconstrained binary quadratic programming"],"prefix":"10.1007","volume":"238","author":[{"given":"Fred","family":"Glover","sequence":"first","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":[[2015,12,11]]},"reference":[{"key":"2076_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B Alidaee","year":"1994","unstructured":"Alidaee, B., Kochenberger, G., & Ahmadian, A. (1994). 0\u20131 Quadratic programming approach for the optimal solution of two scheduling problems. International Journal of Systems Science, 25, 401\u2013408.","journal-title":"International Journal of Systems Science"},{"issue":"3","key":"2076_CR2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","volume":"36","author":"F Barahona","year":"1988","unstructured":"Barahona, F., Grotschel, M., Junger, M., & Reinelt, G. (1988). An application of combinatorial optimization to statistical physics and circuit layout design. Operations Research, 36(3), 493\u2013513.","journal-title":"Operations Research"},{"key":"2076_CR3","doi-asserted-by":"crossref","unstructured":"Bomze, I.M., Budinich, M., Pardalos, P.M., & Pelillo M. (1999). The maximum clique problem. In Handbook of Combinatorial Optimization (pp. 1\u201374). Springer.","DOI":"10.1007\/978-1-4757-3023-4_1"},{"issue":"1\u20134","key":"2076_CR4","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E Boros","year":"1991","unstructured":"Boros, E., & Hammer, P. L. (1991). The max-cut problem and quadratic 0\u20131 optimization polyhedral aspects, relaxations and bounds. Annals of Operations Research, 33(1\u20134), 151\u2013180.","journal-title":"Annals of Operations Research"},{"issue":"1","key":"2076_CR5","first-page":"704","volume":"4","author":"P Chardaire","year":"1994","unstructured":"Chardaire, P., & Sutter, A. (1994). A decomposition method for quadratic zero-one programming. Management Science, 4(1), 704\u2013712.","journal-title":"Management Science"},{"key":"2076_CR6","first-page":"132","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P., & Simeone, B. (1980). Quadratic knapsack problems. Mathematical Programming, 12, 132\u2013149.","journal-title":"Mathematical Programming"},{"issue":"1","key":"2076_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1504\/IJMHEUR.2010.033120","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover, F., & Hao, J. K. (2010a). Efficient evaluations for solving large 0\u20131 unconstrained quadratic optimization problems. International Journal of Metaheuristics, 1(1), 1\u201310.","journal-title":"International Journal of Metaheuristics"},{"issue":"2","key":"2076_CR8","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1504\/IJMHEUR.2010.034201","volume":"1","author":"F Glover","year":"2010","unstructured":"Glover, F., & Hao, J. K. (2010a). Fast 2-flip move evaluations for binary unconstrained quadratic optimization problems. International Journal of Metaheuristics, 1(2), 100\u2013107.","journal-title":"International Journal of Metaheuristics"},{"key":"2076_CR9","first-page":"654","volume":"39","author":"F Glover","year":"2000","unstructured":"Glover, F., Laguna, M., & Marti, R. (2000). Fundamentals of scatter search and pathrelinking. Control and Cybernetics, 39, 654\u2013684.","journal-title":"Control and Cybernetics"},{"key":"2076_CR10","first-page":"87","volume-title":"Studies in Fuzziness and Soft Computing","author":"F Glover","year":"2004","unstructured":"Glover, F., Laguna, M., & Marti, R. (2004). Scatter search and path relinking: Foundations and advanced designs, new optimization technologies in engineering. In G. C. Onwubolu & B. V. Babu (Eds.), Studies in Fuzziness and Soft Computing (Vol. 141, pp. 87\u2013100). Berlin: Springer."},{"key":"2076_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean methods in operations research and related areas. Econometrics and operations research","author":"PL Hammer","year":"1968","unstructured":"Hammer, P. L., & Rudeanu, S. (1968). Boolean methods in operations research and related areas. Econometrics and operations research (Vol. 5). Berlin: Springer."},{"key":"2076_CR12","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00291-003-0153-3","volume":"26","author":"G Kochenberger","year":"2004","unstructured":"Kochenberger, G., 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"},{"issue":"4","key":"2076_CR13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10732-011-9189-8","volume":"19","author":"GA Kochenberger","year":"2013","unstructured":"Kochenberger, G. A., Hao, J.-K., L\u00fc, Z., Wang, H., & Glover, F. (2013). Solving large scale max cut problems via tabu search. Journal of Heuristics, 19(4), 565\u2013571.","journal-title":"Journal of Heuristics"},{"key":"2076_CR14","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, J. K., Glover, F., Lewis, M., L\u00fc, Z., Wang, H., et al. (2014). The unconstrained binary quadratic programming problem: A survey. Journal of Combinatorial Optimization, 28, 58\u201381.","journal-title":"Journal of Combinatorial Optimization"},{"key":"2076_CR15","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. Mathematical Programming Study, 9, 75\u201394.","journal-title":"Mathematical Programming Study"},{"key":"2076_CR16","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","volume":"14","author":"DJ Laughunn","year":"1970","unstructured":"Laughunn, D. J. (1970). Quadratic binary programming. Operations Research, 14, 454\u2013461.","journal-title":"Operations Research"},{"issue":"3","key":"2076_CR17","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, G., & Alidaee, B. (2008). A new modeling and solution approach for the set-partitioning problem. Computers and Operations Research, 35(3), 807\u2013813.","journal-title":"Computers and Operations Research"},{"issue":"3","key":"2076_CR18","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.ejor.2012.07.012","volume":"223","author":"Y Wang","year":"2012","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., & Hao, J. K. (2012). Path relinking for unconstrained binary quadratic programming. European Journal of Operational Research, 223(3), 595\u2013604.","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"2076_CR19","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, J. K. (2013). Probabilistic GRASP-tabu search algorithms for the UBQP problem. Computers and Operations Research, 40(12), 3100\u20133107.","journal-title":"Computers and Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2076-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-015-2076-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-015-2076-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:09:17Z","timestamp":1559138957000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-015-2076-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,11]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["2076"],"URL":"https:\/\/doi.org\/10.1007\/s10479-015-2076-1","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,11]]}}}