{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:26:54Z","timestamp":1778646414087,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":31,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642121388","type":"print"},{"value":"9783642121395","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12139-5_14","type":"book-chapter","created":{"date-parts":[[2010,3,31]],"date-time":"2010-03-31T14:46:40Z","timestamp":1270046800000},"page":"154-165","source":"Crossref","is-referenced-by-count":7,"title":["A Study of Memetic Search with Multi-parent Combination for UBQP"],"prefix":"10.1007","author":[{"given":"Zhipeng","family":"L\u00fc","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"}]}],"member":"297","reference":[{"key":"14_CR1","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"},{"key":"14_CR2","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. Mathematical Programming Study\u00a09, 75\u201394 (1978)","journal-title":"Mathematical Programming Study"},{"key":"14_CR3","first-page":"132","volume":"12","author":"G. Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P., Simeone, B.: Quadratic knapsack problems. Mathematical Programming\u00a012, 132\u2013149 (1980)","journal-title":"Mathematical Programming"},{"key":"14_CR4","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"},{"issue":"4","key":"14_CR5","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"},{"key":"14_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"A.T. Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. Journal of Global Optimization\u00a04, 229\u2013241 (1994)","journal-title":"Journal of Global Optimization"},{"key":"14_CR7","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":"14_CR8","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":"14_CR9","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":"2","key":"14_CR10","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":"14_CR11","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"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"T.M. Alkhamis","year":"1998","unstructured":"Alkhamis, T.M., Hasan, M., Ahmed, M.A.: Simulated annealing for the unconstrained binary quadratic pseudo-boolean function. European Journal of Operational Research\u00a0108, 641\u2013652 (1998)","journal-title":"European Journal of Operational Research"},{"key":"14_CR13","unstructured":"Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. In: Working Paper, The Management School, Imperial College, London, England (1998)"},{"key":"14_CR14","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":"14_CR15","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"},{"key":"14_CR16","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":"14_CR17","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":"14_CR18","doi-asserted-by":"crossref","unstructured":"Glover, F., L\u00fc, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR (2010); doi: 10.1007\/s10288-009-0115-y","DOI":"10.1007\/s10288-009-0115-y"},{"key":"14_CR19","first-page":"417","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 1999)","author":"P. Merz","year":"1999","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, San Francisco (1999)"},{"issue":"3","key":"14_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"},{"key":"14_CR21","first-page":"643","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000)","author":"K. Katayama","year":"2000","unstructured":"Katayama, K., Tani, M., Narihisa, H.: Solving large binary quadratic programming problems by an effective genetic local search algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 643\u2013650. Morgan Kaufmann, San Francisco (2000)"},{"key":"14_CR22","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\u201316 (2005)","journal-title":"Advances in Soft Computing"},{"key":"14_CR23","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":"14_CR24","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":"14_CR25","first-page":"219","volume-title":"New Ideas in Optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: a short introduction. In: New Ideas in Optimization, pp. 219\u2013234. Mcgraw-Hill Ltd., Maidenhead (1999)"},{"key":"14_CR26","unstructured":"Hoos, H., St\u00fctzle, T.: Stochastic Local Search Foundations and Applications. Morgan Kaufmann \/ Elsevier (2004)"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Glover, F., Hao, J.K.: Efficient evaluations for solving large 0-1 unconstrained quadratic optimization problems. To appear in International Journal of Metaheuristics\u00a01(1) (2009)","DOI":"10.1504\/IJMHEUR.2010.033120"},{"key":"14_CR28","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 Publishers, Boston (1997)"},{"key":"14_CR29","unstructured":"Syswerda, G.: Uniform crossover in genetic algorithms. In: Proceedings of the 3rd International Conference on Genetic Algorithms, pp. 2\u20139 (1989)"},{"issue":"1","key":"14_CR30","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Hao, J.K.: A memetic algorithm for graph coloring. European Journal of Operational Research\u00a0203(1), 241\u2013250 (2010)","journal-title":"European Journal of Operational Research"},{"key":"14_CR31","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"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12139-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T23:45:40Z","timestamp":1675899940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-12139-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642121388","9783642121395"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12139-5_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}