{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:28:39Z","timestamp":1761488919569},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642298271"},{"type":"electronic","value":"9783642298288"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29828-8_26","type":"book-chapter","created":{"date-parts":[[2012,5,14]],"date-time":"2012-05-14T07:59:40Z","timestamp":1336982380000},"page":"395-408","source":"Crossref","is-referenced-by-count":8,"title":["A Multilevel Algorithm for Large Unconstrained Binary Quadratic Optimization"],"prefix":"10.1007","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","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","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. International Journal of Systems Science\u00a025, 401\u2013408 (1994)","journal-title":"International Journal of Systems Science"},{"key":"26_CR2","first-page":"317","volume-title":"New Methods in Optimization","author":"M. Amini","year":"1999","unstructured":"Amini, M., Alidaee, B., Kochenberger, G.A.: A scatter search approach to unconstrained quadratic binary programs. In: New Methods in Optimization, pp. 317\u2013330. McGraw-Hill, New York (1999)"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/BF02404002","volume":"8","author":"J.E. Beasley","year":"1996","unstructured":"Beasley, J.E.: Obtaining test problems via internet. Journal of Global Optimization\u00a08, 429\u2013433 (1996)","journal-title":"Journal of Global Optimization"},{"key":"26_CR4","unstructured":"Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Working Paper, The Management School, Imperial College, London, England (1998)"},{"issue":"5","key":"26_CR5","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1109\/TEVC.2011.2136346","volume":"15","author":"U. Benlic","year":"2011","unstructured":"Benlic, U., Hao, J.K.: A Multilevel Memetic Approach for Improving Graph k-Partitions. IEEE Transactions on Evolutionary Computation\u00a015(5), 624\u2013642 (2011)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"26_CR6","doi-asserted-by":"publisher","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. Advances in Soft Computing\u00a02, 3\u20136 (2005)","journal-title":"Advances in Soft Computing"},{"issue":"2","key":"26_CR7","doi-asserted-by":"publisher","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 Optimization\u00a05(2), 501\u2013529 (2008)","journal-title":"Discrete Optimization"},{"key":"26_CR8","doi-asserted-by":"publisher","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). Journal of Heuristics\u00a013, 99\u2013132 (2007)","journal-title":"Journal of Heuristics"},{"issue":"4","key":"26_CR9","doi-asserted-by":"publisher","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. Management Science\u00a041(4), 704\u2013712 (1994)","journal-title":"Management Science"},{"issue":"1","key":"26_CR10","doi-asserted-by":"publisher","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. Decision Sciences\u00a08(1), 156\u2013166 (1977)","journal-title":"Decision Sciences"},{"key":"26_CR11","doi-asserted-by":"publisher","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. Management Science\u00a044, 336\u2013345 (1998)","journal-title":"Management Science"},{"issue":"1","key":"26_CR12","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1504\/IJMHEUR.2010.033120","volume":"1","author":"F. Glover","year":"2010","unstructured":"Glover, F., Hao, J.K.: Efficient Evaluation for Solving 0-1 Unconstrained Quadratic Optimization Problems. International Journal of Metaheuristics\u00a01(1), 3\u201310 (2010)","journal-title":"International Journal of Metaheuristics"},{"issue":"3","key":"26_CR13","doi-asserted-by":"publisher","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: A Quarterly Journal of Operations Research\u00a08(3), 239\u2013253 (2010)","journal-title":"4OR: A Quarterly Journal of Operations Research"},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F. Harary","year":"1953","unstructured":"Harary, F.: On the notion of balanced of a signed graph. Michigan Mathematical Journal\u00a02, 143\u2013146 (1953)","journal-title":"Michigan Mathematical Journal"},{"key":"26_CR15","first-page":"388","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg, C., Rendl, F.: Solving quadratic (0,1)-problem by semidefinite programs and cutting planes. Mathematical Programming\u00a082, 388\u2013399 (1998)","journal-title":"Mathematical Programming"},{"key":"26_CR16","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a0134, 103\u2013119 (2001)","journal-title":"European Journal of Operational Research"},{"key":"26_CR17","unstructured":"Kilby, P., Slaney, J.K., Thiebaux, S., Walsh, T.: Backbones and backdoors in satisablity. In: Proceedings of AAAI 2005, pp. 1368\u20131373 (2005)"},{"key":"26_CR18","doi-asserted-by":"publisher","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 Spectrum\u00a026, 237\u2013250 (2004)","journal-title":"OR Spectrum"},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, A.: Computer aided layout design. Mathematical Programming Study\u00a09, 75\u201384 (1978)","journal-title":"Mathematical Programming Study"},{"issue":"3","key":"26_CR20","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A. Lodi","year":"1999","unstructured":"Lodi, A., Allemand, K., Liebling, T.M.: An evolutionary heuristic for quadratic 0-1 programming. European Journal of Operational Research\u00a0119(3), 662\u2013670 (1999)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"26_CR21","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a0207(3), 1254\u20131262 (2010)","journal-title":"European Journal of Operational Research"},{"key":"26_CR22","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 phase transitions. Nature\u00a0400, 133\u2013137 (1998)","journal-title":"Nature"},{"key":"26_CR23","doi-asserted-by":"publisher","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. Management Science\u00a026, 282\u2013296 (1980)","journal-title":"Management Science"},{"issue":"9","key":"26_CR24","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1016\/j.jpdc.2009.04.005","volume":"69","author":"H. Meyerhenke","year":"2009","unstructured":"Meyerhenke, H., Monien, B., Sauerwald, T.: A New Diffusion-based Multilevel Algorithm for Computing Graph Partitions of Very High Quality. Journal of Parallel and Distributed Computing\u00a069(9), 750\u2013761 (2009)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"26_CR25","unstructured":"Merz, P., Freisleben, B.: Genetic algorithms for binary quadratic programming. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999), pp. 417\u2013424. Morgan Kaufmann (1999)"},{"key":"26_CR26","doi-asserted-by":"publisher","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\u00a078, 99\u2013118 (2004)","journal-title":"BioSystems"},{"key":"26_CR27","doi-asserted-by":"publisher","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. Annals of Operations Research\u00a0131, 259\u2013282 (2004)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"26_CR28","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\u00a017(2), 279\u2013296 (2006)","journal-title":"Informatica"},{"key":"26_CR29","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P. Pardalos","year":"1990","unstructured":"Pardalos, P., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing\u00a045, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"26_CR30","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2\u20139 (1989)"},{"key":"26_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/3-540-48311-X_75","volume-title":"Euro-Par\u201999 Parallel Processing","author":"M. Toulouse","year":"1999","unstructured":"Toulouse, M., Thulasiraman, K., Glover, F.: Multi-level Cooperative Search: A New Paradigm for Combinatorial Optimization and an Application to Graph Partitioning. In: Amestoy, P.R., Berger, P., Dayd\u00e9, M., Duff, I.S., Frayss\u00e9, V., Giraud, L., Ruiz, D. (eds.) Euro-Par 1999. LNCS, vol.\u00a01685, pp. 533\u2013542. Springer, Heidelberg (1999)"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.K.: Backbone guided Tabu Search for solving the UBQP problem. Journal of Heuristics (2011), doi:10.1007\/s10732-011-9164-4","DOI":"10.1007\/s10732-011-9164-4"},{"key":"26_CR33","series-title":"Lecture Notes in Computer Science","first-page":"72","volume-title":"EvoCOP 2011","author":"Y. Wang","year":"2011","unstructured":"Wang, Y., L\u00fc, Z., Glover, F., Hao, J.-K.: Effective Variable Fixing and Scoring Strategies for Binary Quadratic Programming. In: Hao, J.-K. (ed.) EvoCOP 2011. LNCS, vol.\u00a06622, pp. 72\u201383. Springer, Heidelberg (2011)"},{"key":"26_CR34","unstructured":"Wang, J., Zhou, Y., Yin, J.: Combining tabu hopfield network and estimation of distribution for unconstrained binary quadratic programming problem. Expert System With Applications (2011), doi:10.1016\/j.eswa.2011.05060"},{"issue":"1","key":"26_CR35","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1137\/S1064827598337373","volume":"22","author":"C. Walshaw","year":"2000","unstructured":"Walshaw, C., Cross, M.: Mesh Partitioning: A Multilevel Balancing and Refinement Algorithm. SIAM Journal on Scientific Computing\u00a022(1), 63\u201380 (2000)","journal-title":"SIAM Journal on Scientific Computing"},{"key":"26_CR36","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1023\/B:ANOR.0000039525.80601.15","volume":"131","author":"C. Walshaw","year":"2004","unstructured":"Walshaw, C.: Multilevel refinement for combinatorial optimisation problems. Annals of Operations Research\u00a0131, 325\u2013372 (2004)","journal-title":"Annals of Operations Research"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29828-8_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:17:44Z","timestamp":1620127064000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29828-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642298271","9783642298288"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29828-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}