{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:38:02Z","timestamp":1760708282708},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,3,10]],"date-time":"2011-03-10T00:00:00Z","timestamp":1299715200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10732-011-9164-4","type":"journal-article","created":{"date-parts":[[2011,3,9]],"date-time":"2011-03-09T19:11:55Z","timestamp":1299697915000},"page":"679-695","source":"Crossref","is-referenced-by-count":24,"title":["Backbone guided tabu search for solving the UBQP problem"],"prefix":"10.1007","volume":"19","author":[{"given":"Yang","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fred","family":"Glover","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":[[2011,3,10]]},"reference":[{"key":"9164_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B. Alidaee","year":"1994","unstructured":"Alidaee, B., Kochenberger, G.A., Ahmadian, A.: 0-1 quadratic programming approach for the optimal solution of two scheduling problems. Int. J. Syst. Sci. 25, 401\u2013408 (1994)","journal-title":"Int. J. Syst. Sci."},{"issue":"2","key":"9164_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, G.A., Lewis, K., Lewis, M., Wang, H.: A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 86(2), 504\u2013512 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"9164_CR3","series-title":"New Methods in Optimization","first-page":"317","volume-title":"A Scatter Search Approach to Unconstrained Quadratic Binary Programs","author":"M. Amini","year":"1999","unstructured":"Amini, M., Alidaee, B., Kochenberger, G.A.: A Scatter Search Approach to Unconstrained Quadratic Binary Programs. New Methods in Optimization, pp. 317\u2013330. McGraw\u2013Hill, New York (1999)"},{"key":"9164_CR4","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.: An evolutionary algorithm for the binary quadratic problems. Adv. Soft Comput. 2, 3\u201316 (2005)","journal-title":"Adv. Soft Comput."},{"key":"9164_CR5","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, P.L., Tavares, G.: Local search heuristics for quadratic unconstrained binary optimization (qubo). J. Heuristics 13, 99\u2013132 (2007)","journal-title":"J. Heuristics"},{"issue":"2","key":"9164_CR6","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.disopt.2007.02.001","volume":"5","author":"E. Boros","year":"2008","unstructured":"Boros, E., Hammer, P.L., Sun, R., Tavares, G.: A max-flow approach to improved lower bounds for quadratic 0-1 minimization. Discrete Optim. 5(2), 501\u2013529 (2008)","journal-title":"Discrete Optim."},{"issue":"4","key":"9164_CR7","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.: A decomposition method for quadratic zero-one programming. Manag. Sci. 41(4), 704\u2013712 (1994)","journal-title":"Manag. Sci."},{"key":"9164_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"issue":"1","key":"9164_CR9","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1111\/j.1540-5915.1977.tb01074.x","volume":"8","author":"F. Glover","year":"1977","unstructured":"Glover, F.: Heuristics for integer programming using surrogate constraints. Decis. Sci. 8(1), 156\u2013166 (1977)","journal-title":"Decis. Sci."},{"key":"9164_CR10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/0-387-23667-8_19","volume-title":"Metaheuristic Optimization Via Memory and Evolution","author":"F. Glover","year":"2005","unstructured":"Glover, F.: Adaptive memory projection methods for integer programming. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization Via Memory and Evolution, pp. 425\u2013440. Kluwer Academic, Dordrecht (2005)"},{"issue":"1","key":"9164_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1504\/IJMHEUR.2010.033120","volume":"1","author":"F. Glover","year":"2010","unstructured":"Glover, F., Hao, J.K.: Efficient evaluations for solving large 0-1 unconstrained quadratic optimization problems. Int. J. Metaheuristics 1(1), 3\u201310 (2010)","journal-title":"Int. J. Metaheuristics"},{"key":"9164_CR12","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.: Tabu Search. Kluwer Academic, Boston (1997)"},{"key":"9164_CR13","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, G.A., Alidaee, B.: Adaptive memory tabu search for binary quadratic programs. Manag. Sci. 44, 336\u2013345 (1998)","journal-title":"Manag. Sci."},{"key":"9164_CR14","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(01)00209-0","volume":"137","author":"F. Glover","year":"2002","unstructured":"Glover, F., Alidaee, B., Rego, C., Kochenberger, G.A.: One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur. J. Oper. Res. 137, 272\u2013287 (2002)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"9164_CR15","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10288-009-0115-y","volume":"8","author":"F. Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR, Q. J. Oper. Res. 8(3), 239\u2013253 (2010)","journal-title":"4OR, Q. J. Oper. Res."},{"key":"9164_CR16","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F. Harary","year":"1953","unstructured":"Harary, F.: On the notion of balance of a signed graph. Mich. Math. J. 2, 143\u2013146 (1953)","journal-title":"Mich. Math. J."},{"key":"9164_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"2000","unstructured":"Horst, R., Pardalos, P.M., Thoai, N.V.: Introduction to Global Optimization. Kluwer Academic, Boston (2000)"},{"key":"9164_CR18","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.: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur. J. Oper. Res. 134, 103\u2013119 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9164_CR19","first-page":"1368","volume-title":"Proceedings of AAAI-2005","author":"P. Kilby","year":"2005","unstructured":"Kilby, P., Slaney, J.K., Thiebaux, S.T.: Backbones and backdoors in satisfiability. In: Proceedings of AAAI-2005, pp. 1368\u20131373 (2005)"},{"key":"9164_CR20","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00291-003-0153-3","volume":"26","author":"G.A. Kochenberger","year":"2004","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: A unified modeling and solution framework for combinatorial optimization problems. OR Spektrum 26, 237\u2013250 (2004)","journal-title":"OR Spektrum"},{"key":"9164_CR21","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G.A. Kochenberger","year":"2005","unstructured":"Kochenberger, G.A., Glover, F., Alidaee, B., Rego, C.: An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann. Oper. Res. 139, 229\u2013241 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9164_CR22","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, A.: Computer aided layout design. Math. Program. Stud. 9, 75\u201394 (1978)","journal-title":"Math. Program. Stud."},{"issue":"3","key":"9164_CR23","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.A., Alidaee, B.: A new modeling and solution approach for the set-partitioning problem. Comput. Oper. Res. 35(3), 807\u2013813 (2008)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"9164_CR24","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1504\/IJOR.2009.025005","volume":"5","author":"M. Lewis","year":"2009","unstructured":"Lewis, M., Alidaee, B., Glover, F., Kochenberger, G.A.: A note on xqx as a modelling and solution framework for the linear ordering problem. Int. J. Oper. Res. 5(2), 152\u2013162 (2009)","journal-title":"Int. J. Oper. Res."},{"issue":"3","key":"9164_CR25","doi-asserted-by":"crossref","first-page":"1254","DOI":"10.1016\/j.ejor.2010.06.039","volume":"207","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Glover, F., Hao, J.K.: A hybrid metaheuristic approach to solving the ubqp problem. Eur. J. Oper. Res. 207(3), 1254\u20131262 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"9164_CR26","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"R.D. McBride","year":"1980","unstructured":"McBride, R.D., Yormark, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26, 282\u2013296 (1980)","journal-title":"Manag. Sci."},{"key":"9164_CR27","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.: Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems 78, 99\u2013118 (2004)","journal-title":"Biosystems"},{"key":"9164_CR28","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1038\/22055","volume":"400","author":"R. Monasson","year":"1998","unstructured":"Monasson, R., Zecchina, R., Kirkpatrick, S., Selman, B., Troyansky, L.: Determining computational complexity for characteristic \u2018phase transitions\u2019. Nature 400, 133\u2013137 (1998)","journal-title":"Nature"},{"key":"9164_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.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9164_CR30","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G. Palubeckis","year":"2006","unstructured":"Palubeckis, G.: Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2), 279\u2013296 (2006)","journal-title":"Informatica"},{"key":"9164_CR31","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/j.ejor.2008.11.036","volume":"199","author":"C. Wilbaut","year":"2009","unstructured":"Wilbaut, C., Salhi, S., Hanafi, S.: An iterative variable-based fixation heuristic for 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 199, 339\u2013348 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"9164_CR32","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2004.04.001","volume":"158","author":"W. Zhang","year":"2004","unstructured":"Zhang, W.: Configuration landscape analysis and backbone guided local search. Part\u00a01: Satisfiability and maximum satisfiability. Artif. Intell. 158, 1\u201326 (2004)","journal-title":"Artif. Intell."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9164-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9164-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9164-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,17]],"date-time":"2020-06-17T06:44:17Z","timestamp":1592376257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9164-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,10]]},"references-count":32,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9164"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9164-4","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,10]]}}}