{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T05:52:30Z","timestamp":1725861150272},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319422930"},{"type":"electronic","value":"9783319422947"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-42294-7_66","type":"book-chapter","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T11:00:47Z","timestamp":1468234847000},"page":"745-753","source":"Crossref","is-referenced-by-count":0,"title":["Solving Bi-objective Unconstrained Binary Quadratic Programming Problem with Multi-objective Backbone Guided Search Algorithm"],"prefix":"10.1007","author":[{"given":"Li-Yuan","family":"Xue","sequence":"first","affiliation":[]},{"given":"Rong-Qiang","family":"Zeng","sequence":"additional","affiliation":[]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ming-Sheng","family":"Shang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,12]]},"reference":[{"key":"66_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."},{"key":"66_CR2","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"TM Alkhamis","year":"1998","unstructured":"Alkhamis, T.M., Hasan, M., Ahmed, M.A.: Simulated annealing for the unconstrained binary quadratic pseudo-boolean function. Eur. J. Oper. Res. 108, 641\u2013652 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"66_CR3","first-page":"317","volume-title":"New Methods in Optimization","author":"M Amini","year":"1999","unstructured":"Amini, M., Alidaee, B., Kochenberger, G.: A scatter search approach to unconstrained quadratic binary programs. In: Cone, D., Dorigo, M., Glover, F. (eds.) New Methods in Optimization, pp. 317\u2013330. McGraw-Hill, New York (1999)"},{"issue":"8","key":"66_CR4","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1007\/s00521-011-0588-4","volume":"21","author":"M Basseur","year":"2012","unstructured":"Basseur, M., Zeng, R.-Q., Hao, J.-K.: Hypervolume-based multi-objective local search. Neural Comput. Appl. 21(8), 1917\u20131929 (2012)","journal-title":"Neural Comput. Appl."},{"key":"66_CR5","volume-title":"Evolutionary Algorithms for Solving Multi-objective Problems (Genetic and Evolutionary Computation)","author":"CA Coello","year":"2006","unstructured":"Coello, C.A., Lamont, G.B., Van Veldhuizen, D.A.: Evolutionary Algorithms for Solving Multi-objective Problems (Genetic and Evolutionary Computation). Springer, New York (2006)"},{"key":"66_CR6","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1109\/4235.996017","volume":"6","author":"K Deb","year":"2000","unstructured":"Deb, K., Pratap, A., Agarwal, S., Meyarivan, T.: A fast elitist multi-objective genetic algorithm: NSGA-II. IEEE Trans. Evol. Comput. 6, 182\u2013197 (2000)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"66_CR7","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132\u2013149 (1980)","journal-title":"Math. Program."},{"key":"66_CR8","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"MR Garey","year":"1978","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: A guide to the theory of NP-completeness. Freeman, New York, USA (1978)"},{"key":"66_CR9","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., Alidaee, B.: Adaptive memory tabu search for binary quadratic programs. Manage. Sci. 44, 336\u2013345 (1998)","journal-title":"Manage. Sci."},{"key":"66_CR10","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., Wang, Y.: The unconstrained binary quadratic programming problem: a survey. J. Comb. Optim. 28, 58\u201381 (2014)","journal-title":"J. Comb. Optim."},{"key":"66_CR11","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. Study 9, 75\u201394 (1978)","journal-title":"Math. Program. Study"},{"key":"66_CR12","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1016\/j.asoc.2013.11.008","volume":"16","author":"A Liefooghe","year":"2014","unstructured":"Liefooghe, A., Verel, S., Hao, J.-K.: A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming. Appl. Soft Comput. 16, 10\u201319 (2014)","journal-title":"Appl. Soft Comput."},{"key":"66_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1007\/978-3-319-15934-8_12","volume-title":"Evolutionary Multi-criterion Optimization","author":"A Liefooghe","year":"2015","unstructured":"Liefooghe, A., Verel, S., Paquete, L., Hao, J.-K.: Experiments on local search for bi-objective unconstrained binary quadratic programming. In: Gaspar-Cunha, A., Henggeler Antunes, C., Coello, C.C. (eds.) EMO 2015. LNCS, vol. 9018, pp. 171\u2013186. Springer, Heidelberg (2015)"},{"key":"66_CR14","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, 1254\u20131262 (2010)","journal-title":"Eur. J. Oper. Res."},{"unstructured":"Merz, P., Freisleben, B.: Genetic algorithms for binary quadratic programming. In: Proceedings of the 1st International Conference on Genetic and Evolutionary Computation Conference (GECCO 1999), Orlando, Florida, USA, pp. 417\u2013424 (1999)","key":"66_CR15"},{"key":"66_CR16","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":"66_CR17","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.: Path relinking for unconstrained binary quadratic programming. Eur. J. Oper. Res. 223, 595\u2013604 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"66_CR18","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1007\/s10732-011-9164-4","volume":"19","author":"Y Wang","year":"2013","unstructured":"Wang, Y., L\u00fc, Z.P., Glover, F., Hao, J.K.: Backbone guided tabu search for solving the UBQP problem. J. Heuristics 19, 679\u2013695 (2013)","journal-title":"J. Heuristics"},{"issue":"2","key":"66_CR19","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 the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 199(2), 339\u2013348 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"66_CR20","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 1: satisfiability and maximum satisfiability. Artif. Intell. 158, 1\u201326 (2004)","journal-title":"Artif. Intell."},{"key":"66_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1007\/978-3-540-30217-9_84","volume-title":"Parallel Problem Solving from Nature - PPSN VIII","author":"E Zitzler","year":"2004","unstructured":"Zitzler, E., K\u00fcnzli, S.: Indicator-based selection in multiobjective search. In: Yao, X., Burke, E.K., Lozano, J.A., Smith, J., Merelo-Guerv\u00f3s, J.J., Bullinaria, J.A., Rowe, J.E., Ti\u0148o, P., Kab\u00e1n, A., Schwefel, H.-P. (eds.) PPSN 2004. LNCS, vol. 3242, pp. 832\u2013842. Springer, Heidelberg (2004)"},{"unstructured":"Zitzler, E., Laumanns, M., Thiele, L.: SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. TIK Report 103, Computer Engineering and Networks Laboratory (TIK), ETH Zurich, Zurich, Switzerland (2001)","key":"66_CR22"},{"key":"66_CR23","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1109\/4235.797969","volume":"3","author":"E Zitzler","year":"1999","unstructured":"Zitzler, E., Thiele, L.: Multiobjective evolutionary algorithms: a comparative case study and the strength pareto approach. Evol. Comput. 3, 257\u2013271 (1999)","journal-title":"Evol. Comput."}],"container-title":["Lecture Notes in Computer Science","Intelligent Computing Theories and Application"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42294-7_66","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,10]],"date-time":"2019-09-10T20:33:13Z","timestamp":1568147593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42294-7_66"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319422930","9783319422947"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42294-7_66","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}