{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T09:00:02Z","timestamp":1781341202564,"version":"3.54.1"},"reference-count":102,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,4,18]],"date-time":"2014-04-18T00:00:00Z","timestamp":1397779200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10878-014-9734-0","type":"journal-article","created":{"date-parts":[[2014,4,17]],"date-time":"2014-04-17T12:47:11Z","timestamp":1397738831000},"page":"58-81","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":411,"title":["The unconstrained binary quadratic programming problem: a survey"],"prefix":"10.1007","volume":"28","author":[{"given":"Gary","family":"Kochenberger","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jin-Kao","family":"Hao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Fred","family":"Glover","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mark","family":"Lewis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhipeng","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Haibo","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2014,4,18]]},"reference":[{"issue":"2","key":"9734_CR1","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1155\/JAMDS.2005.113","volume":"2005","author":"B Alidaee","year":"2005","unstructured":"Alidaee B, Glover F, Kochenberger GA, Rego C (2005) A new modeling and solution approach for the number partitioning problem. J Appl Math Decis Sci 2005(2):113\u2013121. doi: 10.1155\/JAMDS.2005.113","journal-title":"J Appl Math Decis Sci"},{"issue":"2","key":"9734_CR2","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B Alidaee","year":"2008","unstructured":"Alidaee B, Kochenberger G, Lewis K, Lewis M, Wang H (2008) A new approach for modeling and solving set packing problems. Eur J Oper Res 186(2):504\u2013512. doi: 10.1016\/j.ejor.2006.12.068","journal-title":"Eur J Oper Res"},{"issue":"2","key":"9734_CR3","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B Alidaee","year":"1994","unstructured":"Alidaee B, Kochenberger GA, Ahmadian A (1994) 0\u20131 Quadratic programming approach for optimum solutions of two scheduling problems. Int J Syst Sci 25(2):401\u2013408. doi: 10.1080\/00207729408928968","journal-title":"Int J Syst Sci"},{"issue":"3","key":"9734_CR4","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"TM Alkhamis","year":"1998","unstructured":"Alkhamis TM, Hasan M, Ahmed MA (1998) Simulated annealing for the unconstrained quadratic pseudo-Boolean function. Eur J Oper Res 108(3):641\u2013652. doi: 10.1016\/S0377-2217(97)00130-6","journal-title":"Eur J Oper Res"},{"key":"9734_CR5","unstructured":"Amini MM, Alidaee B, Kochenberger GA (eds) (1999) A scatter search approach to unconstrained quadratic binary programs. New ideas in optimization. McGraw-Hill Ltd., London"},{"issue":"1","key":"9734_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F Barahona","year":"1986","unstructured":"Barahona F (1986) A solvable case of quadratic 0\u20131 programming. Discret Appl Math 13(1):23\u201326. doi: 10.1016\/0166-218X(86)90065-X","journal-title":"Discret Appl Math"},{"issue":"3","key":"9734_CR7","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. Oper Res 36(3):493","journal-title":"Oper Res"},{"key":"9734_CR8","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona F, Junger M, Reinelt G (1989) Experiments in quadratic 0\u20131 programming. Math Program 44:127\u2013137","journal-title":"Math Program"},{"issue":"1","key":"9734_CR9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/S1052623498336930","volume":"11","author":"A Beck","year":"2000","unstructured":"Beck A, Teboulle M (2000) Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J Optim 11(1):179\u2013188","journal-title":"SIAM J Optim"},{"key":"9734_CR10","unstructured":"Beasley JE (1998) Heuristic algorithms for the unconstrained binary quadratic programming problem. PhD thesis, Imperial College, England"},{"issue":"1","key":"9734_CR11","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet A, Elloumi S (2007) Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math Program 109(1):55\u201368","journal-title":"Math Program"},{"issue":"1","key":"9734_CR12","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/0377-2217(94)90125-2","volume":"78","author":"A Billionnet","year":"1994","unstructured":"Billionnet A, Sutter A (1994) Minimization of a quadratic pseudo-Boolean function. Eur J Oper Res 78(1):106\u2013115. doi: 10.1016\/0377-2217(94)90125-2","journal-title":"Eur J Oper Res"},{"key":"9734_CR13","doi-asserted-by":"crossref","unstructured":"Bomze IM, Budinich M, Pardalos PM, Pelillo M (1999) The maximum clique problem. In: Handbook of combinatorial optimization. Springer, Berlin, pp 1\u201374","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"9734_CR14","unstructured":"Boros E, Hammer P, Sun X (1989) The DDT method for quadratic 0\u20131 minimization. RUTCOR Research Center, RRR:39\u201389"},{"issue":"1\u20134","key":"9734_CR15","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E Boros","year":"1991","unstructured":"Boros E, Hammer PL (1991) The max-cut problem and quadratic 0\u20131 optimization polyhedral aspects, relaxations and bounds. Ann Oper Res 33(1\u20134):151\u2013180","journal-title":"Ann Oper Res"},{"issue":"1\u20133","key":"9734_CR16","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E Boros","year":"2002","unstructured":"Boros E, Hammer PL (2002) Pseudo-Boolean optimization. Discret Appl Math 123(1\u20133):155\u2013225. doi: 10.1016\/S0166-218X(01)00341-9","journal-title":"Discret Appl Math"},{"key":"9734_CR17","unstructured":"Boros E, Hammer PL, Tavares G (2006) Preprocessing of Unconstrained Quadratic Binary Optimization. Rutcor Research Report, vol 13"},{"issue":"2","key":"9734_CR18","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 PL, Tavares G (2007) Local search heuristics for quadratic unconstrained binary optimization (QUBO). J Heuristics 13(2):99\u2013132","journal-title":"J Heuristics"},{"issue":"6","key":"9734_CR19","doi-asserted-by":"crossref","first-page":"7817","DOI":"10.1016\/j.eswa.2010.12.124","volume":"38","author":"Y Cai","year":"2011","unstructured":"Cai Y, Wang J, Yin J, Zhou Y (2011) Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems. Expert Syst Appl 38(6):7817\u20137827. doi: 10.1016\/j.eswa.2010.12.124","journal-title":"Expert Syst Appl"},{"key":"9734_CR20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01432506","volume":"42","author":"P Carraesi","year":"1995","unstructured":"Carraesi P, Malucelli F, Farinaccio F (1995) Testing optimality for quadratic 0-1 unconstrained problems. ZOR-Math Methods Oper Res 42:295\u2013311","journal-title":"ZOR-Math Methods Oper Res"},{"key":"9734_CR21","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s101070050064","volume":"85","author":"P Carraesi","year":"1999","unstructured":"Carraesi P, Farinaccio F, Malucelli F (1999) Testing optimality for quadratic 0-1 problems. Math Program 85:407\u2013421","journal-title":"Math Program"},{"issue":"1","key":"9734_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"MW Carter","year":"1984","unstructured":"Carter MW (1984) The indefinite zero-one quadratic problem. Discret Appl Math 7(1):23\u201344","journal-title":"Discret Appl Math"},{"issue":"1\u20132","key":"9734_CR23","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1007\/BF02178370","volume":"80","author":"C Simone De","year":"1995","unstructured":"De Simone C, Diehl M, J\u00fcnger M, Mutzel P, Reinelt G, Rinaldi G (1995) Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm. J Stat Phys 80(1\u20132):487\u2013496","journal-title":"J Stat Phys"},{"issue":"9","key":"9734_CR24","doi-asserted-by":"crossref","first-page":"26","DOI":"10.5539\/mas.v6n9p26","volume":"6","author":"SM Douiri","year":"2012","unstructured":"Douiri SM, Elbernouss S (2012) The unconstrained binary quadratic programming for the sum coloring problem. Mod Appl Sci 6(9):26\u201333. doi: 10.5539\/mas.v6n9p26","journal-title":"Mod Appl Sci"},{"key":"9734_CR25","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10898-009-9469-0","volume":"47","author":"D Gao","year":"2010","unstructured":"Gao D, Ruan N (2010) Solutions to quadratic minimization problems with box and integer constraints. J Global Optim 47:463\u2013484. doi: 10.1007\/s10898-009-9469-0","journal-title":"J Global Optim"},{"issue":"2","key":"9734_CR26","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 (2002) One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur J Oper Res 137(2):272\u2013287. doi: 10.1016\/S0377-2217(01)00209-0","journal-title":"Eur J Oper Res"},{"key":"9734_CR27","doi-asserted-by":"crossref","unstructured":"Glover F, Kochenberger G, Alidaee B, Amini M (1999) Tabu search with critical event memory: an enhanced application for binary quadratic programs. In: Meta-Heuristics. Springer, Berlin, pp 93\u2013109","DOI":"10.1007\/978-1-4615-5775-3_7"},{"issue":"3","key":"9734_CR28","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 GA, Alidaee B (1998) Adaptive memory tabu search for binary quadratic programs. Manag Sci 44(3):336\u2013345","journal-title":"Manag Sci"},{"issue":"3","key":"9734_CR29","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 (2010) Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR 8(3):239\u2013253","journal-title":"4OR"},{"issue":"6","key":"9734_CR30","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1016\/j.dam.2008.01.028","volume":"157","author":"S Gueye","year":"2009","unstructured":"Gueye S, Michelon P (2009) A linearization framework for unconstrained quadratic (0-1) problems. Discret Appl Math 157(6):1255\u20131266. doi: 10.1016\/j.dam.2008.01.028","journal-title":"Discret Appl Math"},{"issue":"1","key":"9734_CR31","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","volume":"15","author":"VP Gulati","year":"1984","unstructured":"Gulati VP, Gupta SK, Mittal AK (1984) Unconstrained quadratic bivalent programming problem. Eur J Oper Res 15(1):121\u2013125. doi: 10.1016\/0377-2217(84)90055-9","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9734_CR32","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1007\/BF00139572","volume":"1","author":"P Hammer","year":"1971","unstructured":"Hammer P, Shlifer E (1971) Applications of pseudo-Boolean methods to economic problems. Theor Decis 1(3):296\u2013308. doi: 10.1007\/BF00139572","journal-title":"Theor Decis"},{"key":"9734_CR33","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean methods in operations research and related areas","author":"PL Hammer","year":"1968","unstructured":"Hammer PL, Rudeanu S (1968) Boolean methods in operations research and related areas, vol 5. Springer, Berlin"},{"issue":"4","key":"9734_CR34","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1007\/s10732-011-9169-z","volume":"19","author":"S Hanafi","year":"2013","unstructured":"Hanafi S, Rebai AR, Vasquez M (2013) Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. J Heuristics 19(4):645\u2013677","journal-title":"J Heuristics"},{"key":"9734_CR35","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/S0167-5060(08)70343-1","volume":"5","author":"P Hansen","year":"1979","unstructured":"Hansen P (1979) Methods of nonlinear 0-1 programming. Ann Discret Math 5:53\u201370. doi: 10.1016\/S0167-5060(08)70343-1","journal-title":"Ann Discret Math"},{"issue":"4","key":"9734_CR36","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02241270","volume":"44","author":"P Hansen","year":"1990","unstructured":"Hansen P, Jaumard B (1990) Algorithms for the maximum satisfiability problem. Computing 44(4):279\u2013303","journal-title":"Computing"},{"issue":"2","key":"9734_CR37","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","volume":"5","author":"P Hansen","year":"1993","unstructured":"Hansen P, Jaumard B, Mathon V (1993) State-of-the-art survey-constrained nonlinear 0-1 programming. ORSA J Comput 5(2):97\u2013119","journal-title":"ORSA J Comput"},{"key":"9734_CR38","volume-title":"Exact sequential algorithms for additive clustering","author":"P Hansen","year":"2000","unstructured":"Hansen P, Jaumard B, Meyer C (2000) Exact sequential algorithms for additive clustering. Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions, Montr\u00e9al"},{"issue":"3","key":"9734_CR39","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C Helmberg","year":"1998","unstructured":"Helmberg C, Rendl F (1998) Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes. Math Program Ser B 82(3):291\u2013315","journal-title":"Math Program Ser B"},{"issue":"2\u20133","key":"9734_CR40","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/s10589-005-3062-3","volume":"33","author":"H-X Huang","year":"2006","unstructured":"Huang H-X, Pardalos PM, Prokopyev OA (2006) Lower bound improvement and forcing rule for quadratic binary programming. Comput Optim Appl 33(2\u20133):187\u2013208","journal-title":"Comput Optim Appl"},{"issue":"1","key":"9734_CR41","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009877331765","volume":"5","author":"L Iasemidis","year":"2001","unstructured":"Iasemidis L, Pardalos P, Sackellares J, Shiau D-S (2001) Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures. J Comb Optim 5(1):9\u201326","journal-title":"J Comb Optim"},{"key":"9734_CR42","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10107-006-0012-5","volume":"110","author":"V Jeyakumar","year":"2007","unstructured":"Jeyakumar V, Rubinov AM, Wu ZY (2007) Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions. Math Program Ser A 110:521\u2013541. doi: 10.1007\/s10107-006-0012-5","journal-title":"Math Program Ser A"},{"issue":"4","key":"9734_CR43","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1002\/1520-6750(199008)37:4<527::AID-NAV3220370407>3.0.CO;2-P","volume":"37","author":"B Kalantari","year":"1990","unstructured":"Kalantari B, Bagchi A (1990) An algorithm for quadratic zero-one programs. Naval Res Logist (NRL) 37(4):527\u2013538","journal-title":"Naval Res Logist (NRL)"},{"issue":"1","key":"9734_CR44","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 (2001) Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur J Oper Res 134(1):103\u2013119. doi: 10.1016\/S0377-2217(00)00242-3","journal-title":"Eur J Oper Res"},{"key":"9734_CR45","unstructured":"Katayama K, Tani M, Narihisa H (2000) Solving large binary quadratic programming problems by effective genetic local search algorithm. In: Proceedings of 2000 Genetic and Evolutionary Computation Conference, pp 643\u2013650"},{"key":"9734_CR46","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B Kernighan","year":"1970","unstructured":"Kernighan B, Lin S (1970) An eflicient heuristic procedure for partitioning graphs. Bell Syst Tech J 49:291\u2013307","journal-title":"Bell Syst Tech J"},{"issue":"1","key":"9734_CR47","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/s11590-006-0007-4","volume":"1","author":"G Kochenberger","year":"2007","unstructured":"Kochenberger G, Alidaee B, Glover F, Wang H (2007) An effective modeling and solution approach for the generalized independent set problem. Optim Lett 1(1):111\u2013117","journal-title":"Optim Lett"},{"issue":"1","key":"9734_CR48","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1504\/IJOR.2005.007435","volume":"1","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, Lewis K (2005a) Using the unconstrained quadratic program to model and solve Max 2-SAT problems. Int J Oper Res 1(1):89\u2013100","journal-title":"Int J Oper Res"},{"issue":"1\u20134","key":"9734_CR49","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10479-005-3449-7","volume":"139","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, Rego C (2005b) An unconstrained quadratic binary programming approach to the vertex coloring problem. Ann Oper Res 139(1\u20134):229\u2013241. doi: 10.1007\/s10479-005-3449-7","journal-title":"Ann Oper Res"},{"issue":"1","key":"9734_CR50","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10878-005-1861-1","volume":"10","author":"G Kochenberger","year":"2005","unstructured":"Kochenberger G, Glover F, Alidaee B, Wang H (2005c) Clustering of microarray data via clique partitioning. J Comb Optim 10(1):77\u201392","journal-title":"J Comb Optim"},{"issue":"4","key":"9734_CR51","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s10732-011-9189-8","volume":"19","author":"GA Kochenberger","year":"2013","unstructured":"Kochenberger GA, Hao J-K, L\u00fc Z, Wang H, Glover F (2013) Solving large scale max cut problems via tabu search. J Heuristics 19(4):565\u2013571","journal-title":"J Heuristics"},{"key":"9734_CR52","doi-asserted-by":"crossref","unstructured":"Krarup J, Pruzan P (1978) Computer-aided layout design. In: Balinski ML, Lemarechal C (eds) Mathematical Programming in Use, vol 9. Mathematical Programming Studies. Springer, Berlin, pp 75\u201394. doi: 10.1007\/BFb0120827","DOI":"10.1007\/BFb0120827"},{"issue":"3","key":"9734_CR53","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","volume":"18","author":"D Laughhunn","year":"1970","unstructured":"Laughhunn D (1970) Quadratic binary programming with application to capital-budgeting problems. Oper Res 18(3):454\u2013461","journal-title":"Oper Res"},{"issue":"2","key":"9734_CR54","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 (2009) A note on xQx as a modelling and solution framework for the Linear Ordering Problem. Int J Oper Res 5(2):152\u2013162","journal-title":"Int J Oper Res"},{"issue":"2","key":"9734_CR55","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1016\/j.orl.2004.04.014","volume":"33","author":"M Lewis","year":"2005","unstructured":"Lewis M, Alidaee B, Kochenberger G (2005) Using xQx to model and solve the uncapacitated task allocation problem. Oper Res Lett 33(2):176\u2013182. doi: 10.1016\/j.orl.2004.04.014","journal-title":"Oper Res Lett"},{"issue":"3","key":"9734_CR56","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. Comput Oper Res 35(3):807\u2013813. doi: 10.1016\/j.cor.2006.04.002","journal-title":"Comput Oper Res"},{"key":"9734_CR57","unstructured":"Lewis M, Kochenberger G, Wang H, Glover F (2013) Exact Solutions to Generalized Vertex Covering Problems: A Comparison of Two Models. working paper"},{"issue":"4","key":"9734_CR58","doi-asserted-by":"crossref","first-page":"797","DOI":"10.1007\/s10898-011-9713-2","volume":"52","author":"D Li","year":"2012","unstructured":"Li D, Sun XL, Liu CL (2012) An exact solution method for unconstrained quadratic 0 1 programming: a geometric approach. J Global Optim 52(4):797\u2013829","journal-title":"J Global Optim"},{"key":"9734_CR59","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1007\/s10957-011-9930-3","volume":"52","author":"G Li","year":"2012","unstructured":"Li G (2012) Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition. J Optim Theory 52:710\u2013726. doi: 10.1007\/s10957-011-9930-3","journal-title":"J Optim Theory"},{"issue":"3","key":"9734_CR60","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A Lodi","year":"1999","unstructured":"Lodi A, Allemand K, Liebling TM (1999) An evolutionary heuristic for quadratic 0\u20131 programming. Eur J Oper Res 119(3):662\u2013670. doi: 10.1016\/S0377-2217(98)00359-2","journal-title":"Eur J Oper Res"},{"issue":"4","key":"9734_CR61","doi-asserted-by":"crossref","first-page":"1475","DOI":"10.1137\/100793955","volume":"21","author":"C Lu","year":"2011","unstructured":"Lu C, Fang A, Jin Q, Wang Z, Xing W (2011) KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J Optim 21(4):1475\u20131490","journal-title":"SIAM J Optim"},{"issue":"3","key":"9734_CR62","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 (2010a) A hybrid metaheuristic approach to solving the UBQP problem. Eur J Oper Res 207(3):1254\u20131262. doi: 10.1016\/j.ejor.2010.06.039","journal-title":"Eur J Oper Res"},{"key":"9734_CR63","doi-asserted-by":"crossref","unstructured":"L\u00fc Z, Hao J-K, Glover F (2010b) A study of memetic search with multi-parent combination for UBQP. In: Evolutionary Computation in Combinatorial Optimization. Springer, Berlin, pp 154\u2013165","DOI":"10.1007\/978-3-642-12139-5_14"},{"issue":"2","key":"9734_CR64","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10732-010-9128-0","volume":"17","author":"Z L\u00fc","year":"2011","unstructured":"L\u00fc Z, Hao J-K, Glover F (2011) Neighborhood analysis: a case study on curriculum-based course timetabling. J Heuristics 17(2):97\u2013118. doi: 10.1007\/s10732-010-9128-0","journal-title":"J Heuristics"},{"issue":"4","key":"9734_CR65","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1007\/s10732-011-9171-5","volume":"19","author":"F Mahdavi Pajouh","year":"2013","unstructured":"Mahdavi Pajouh F, Balasundaram B, Prokopyev OA (2013) On characterization of maximal independent sets via quadratic optimization. J Heuristics 19(4):629\u2013644","journal-title":"J Heuristics"},{"issue":"2","key":"9734_CR66","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1111\/j.1475-3995.2009.00743.x","volume":"18","author":"GR Mauri","year":"2011","unstructured":"Mauri GR, Lorena LAN (2011) Lagrangean decompositions for the unconstrained binary quadratic programming problem. Int Trans Oper Res 18(2):257\u2013270. doi: 10.1111\/j.1475-3995.2009.00743.x","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"9734_CR67","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/j.ejor.2011.09.016","volume":"217","author":"GR Mauri","year":"2012","unstructured":"Mauri GR, Lorena LAN (2012a) A column generation approach for the unconstrained binary quadratic programming problem. Eur J Oper Res 217(1):69\u201374. doi: 10.1016\/j.ejor.2011.09.016","journal-title":"Eur J Oper Res"},{"issue":"7","key":"9734_CR68","doi-asserted-by":"crossref","first-page":"1577","DOI":"10.1016\/j.cor.2011.09.008","volume":"39","author":"GR Mauri","year":"2012","unstructured":"Mauri GR, Lorena LAN (2012b) Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem. Comput Oper Res 39(7):1577\u20131581. doi: 10.1016\/j.cor.2011.09.008","journal-title":"Comput Oper Res"},{"key":"9734_CR69","unstructured":"Merz P, Freisleben B (1999) Genetic algorithms for binary quadratic programming. In: Proceedings of the genetic and evolutionary computation conference, Citeseer, pp 417\u2013424"},{"issue":"2","key":"9734_CR70","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P Merz","year":"2002","unstructured":"Merz P, Freisleben B (2002) Greedy and local search heuristics for unconstrained binary quadratic programming. J Heuristics 8(2):197\u2013213","journal-title":"J Heuristics"},{"issue":"1\u20133","key":"9734_CR71","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 (2004) Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems 78(1\u20133):99\u2013118. doi: 10.1016\/j.biosystems.2004.08.002","journal-title":"Biosystems"},{"key":"9734_CR72","unstructured":"Neven H, Rose G, Macready WG (2008) Image recognition with an adiabatic quantum computer I. Mapping to quadratic unconstrained binary optimization. arXiv:0804.4457"},{"issue":"4","key":"9734_CR73","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1002\/net.10004","volume":"38","author":"M Oosten","year":"2001","unstructured":"Oosten M, Rutten J, Spieksma F (2001) The Clique partitioning problem: facets and patching facets. Networks 38(4):209\u2013226","journal-title":"Networks"},{"issue":"4","key":"9734_CR74","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02238228","volume":"54","author":"G Palubeckis","year":"1995","unstructured":"Palubeckis G (1995) A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming. Computing 54(4):283\u2013301. doi: 10.1007\/BF02238228","journal-title":"Computing"},{"issue":"1\u20134","key":"9734_CR75","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 (2004) Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann Oper Res 131(1\u20134):259\u2013282. doi: 10.1023\/B:ANOR.0000039522.58036.68","journal-title":"Ann Oper Res"},{"issue":"2","key":"9734_CR76","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G Palubeckis","year":"2006","unstructured":"Palubeckis G (2006) Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2):279\u2013296","journal-title":"Informatica"},{"key":"9734_CR77","first-page":"14","volume":"24","author":"G Palubeckis","year":"2002","unstructured":"Palubeckis G, Tomkevicius A (2002) GRASP implementations for the unconstrained binary quadratic optimization problem. Inf Technol Control 24:14\u201320","journal-title":"Inf Technol Control"},{"issue":"3","key":"9734_CR78","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1007\/s10589-007-9110-4","volume":"41","author":"S Pan","year":"2008","unstructured":"Pan S, Tan T, Jiang Y (2008) A global continuation algorithm for solving binary quadratic programming problems. Comput Optim Appl 41(3):349\u2013362. doi: 10.1007\/s10589-007-9110-4","journal-title":"Comput Optim Appl"},{"issue":"6\u20137","key":"9734_CR79","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0898-1221(91)90165-Z","volume":"21","author":"PM Pardalos","year":"1991","unstructured":"Pardalos PM, Jha S (1991) Graph separation techniques for quadratic zero-one programming. Comput Math Appl 21(6\u20137):107\u2013113. doi: 10.1016\/0898-1221(91)90165-Z","journal-title":"Comput Math Appl"},{"issue":"2","key":"9734_CR80","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","volume":"11","author":"PM Pardalos","year":"1992","unstructured":"Pardalos PM, Jha S (1992) Complexity of uniqueness and local search in quadratic 0-1 programming. Oper Res Lett 11(2):119\u2013123. doi: 10.1016\/0167-6377(92)90043-3","journal-title":"Oper Res Lett"},{"key":"9734_CR81","doi-asserted-by":"crossref","unstructured":"Pardalos PM, Prokopyev OA, Busygin S (2006) Continuous approaches for solving discrete optimization problems. In: Handbook on modelling for discrete optimization. Springer, Berlin, pp 39\u201360","DOI":"10.1007\/0-387-32942-0_2"},{"issue":"2","key":"9734_CR82","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers GP (1990a) Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45(2):131\u2013144","journal-title":"Computing"},{"issue":"1\u20134","key":"9734_CR83","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02023057","volume":"22","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Rodgers GP (1990b) Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture. Ann Oper Res 22(1\u20134):271\u2013292","journal-title":"Ann Oper Res"},{"issue":"5","key":"9734_CR84","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","volume":"19","author":"PM Pardalos","year":"1992","unstructured":"Pardalos PM, Rodgers GP (1992) A branch and bound algorithm for the maximum clique problem. Comput Oper Res 19(5):363\u2013375. doi: 10.1016\/0305-0548(92)90067-F","journal-title":"Comput Oper Res"},{"issue":"3","key":"9734_CR85","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"PM Pardalos","year":"1994","unstructured":"Pardalos PM, Xue J (1994) The maximum clique problem. J Global Optim 4(3):301\u2013328","journal-title":"J Global Optim"},{"issue":"4","key":"9734_CR86","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10898-009-9507-y","volume":"48","author":"T Pham Dinh","year":"2010","unstructured":"Pham Dinh T, Nguyen Canh N, Le Thi HA (2010) An efficient combined DCA and B&B using DC\/SDP relaxation for globally solving binary quadratic programs. J Global Optim 48(4):595\u2013632","journal-title":"J Global Optim"},{"issue":"11","key":"9734_CR87","doi-asserted-by":"crossref","first-page":"1268","DOI":"10.1287\/mnsc.22.11.1268","volume":"22","author":"J-C Picard","year":"1976","unstructured":"Picard J-C (1976) Maximal closure of a graph and applications to combinatorial problems. Manag Sci 22(11):1268\u20131272. doi: 10.2307\/2630227","journal-title":"Manag Sci"},{"issue":"2","key":"9734_CR88","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1023\/B:JOTA.0000042530.24671.80","volume":"122","author":"MC Pinar","year":"2004","unstructured":"Pinar MC (2004) Sufficient global optimality conditions for bivalent quadratic optimization. J Optim Theory Appl 122(2):433\u2013440","journal-title":"J Optim Theory Appl"},{"issue":"335","key":"9734_CR89","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1080\/01621459.1971.10482319","volume":"66","author":"MR Rao","year":"1971","unstructured":"Rao MR (1971) Cluster analysis and mathematical programming. J Am Stat Assoc 66(335):622\u2013626. doi: 10.1080\/01621459.1971.10482319","journal-title":"J Am Stat Assoc"},{"issue":"3","key":"9734_CR90","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1287\/mnsc.17.3.200","volume":"17","author":"J Rhys","year":"1970","unstructured":"Rhys J (1970) A selection problem of shared fixed costs and network flows. Manag Sci 17(3):200\u2013207","journal-title":"Manag Sci"},{"issue":"6","key":"9734_CR91","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1007\/s10559-011-9368-5","volume":"47","author":"V Shylo","year":"2011","unstructured":"Shylo V, Shylo O (2011) Systems analysis solving unconstrained binary quadratic programming problem by global equilibrium search. Cybern Syst Anal 47(6):889\u2013897. doi: 10.1007\/s10559-011-9368-5","journal-title":"Cybern Syst Anal"},{"key":"9734_CR92","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s10898-011-9683-4","volume":"53","author":"XL Sun","year":"2012","unstructured":"Sun XL, Liu CL, Li D, Gao JJ (2012) On duality gap in binary quadratic programming. J Global Optim 53:255\u2013269. doi: 10.1007\/s10898-011-9683-4","journal-title":"J Global Optim"},{"issue":"4","key":"9734_CR93","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/s10732-011-9180-4","volume":"19","author":"F Wang","year":"2013","unstructured":"Wang F, Xu Z (2013) Metaheuristics for robust graph coloring. J Heuristics 19(4):529\u2013548","journal-title":"J Heuristics"},{"issue":"2","key":"9734_CR94","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10696-006-9011-3","volume":"18","author":"H Wang","year":"2006","unstructured":"Wang H, Alidaee B, Glover F, Kochenberger G (2006) Solving group technology problems via clique partitioning. Int J Flex Manuf Syst 18(2):77\u201377","journal-title":"Int J Flex Manuf Syst"},{"issue":"12","key":"9734_CR95","doi-asserted-by":"crossref","first-page":"14870","DOI":"10.1016\/j.eswa.2011.05.060","volume":"38","author":"J Wang","year":"2011","unstructured":"Wang J, Zhou Y, Yin J (2011) Combining tabu Hopfield network and estimation of distribution for unconstrained binary quadratic programming problem. Expert Syst Appl 38(12):14870\u201314881. doi: 10.1016\/j.eswa.2011.05.060","journal-title":"Expert Syst Appl"},{"key":"9734_CR96","doi-asserted-by":"crossref","unstructured":"Wang Y, L\u00fc Z, Glover F, Hao J-K (2012a) A multilevel algorithm for large unconstrained binary quadratic optimization. In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems. Springer, Berlin, pp 395\u2013408","DOI":"10.1007\/978-3-642-29828-8_26"},{"issue":"3","key":"9734_CR97","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 (2012b) Path relinking for unconstrained binary quadratic programming. Eur J Oper Res 223(3):595\u2013604. doi: 10.1016\/j.ejor.2012.07.012","journal-title":"Eur J Oper Res"},{"key":"9734_CR98","doi-asserted-by":"crossref","first-page":"3100","DOI":"10.1016\/j.cor.2011.12.006","volume":"40","author":"Y Wang","year":"2012","unstructured":"Wang Y, L\u00fc Z, Glover F, Hao J-K (2012c) Probabilistic GRASP-tabu search algorithms for the UBQP problem. Comput Oper Res 40:3100\u20133107","journal-title":"Comput Oper Res"},{"key":"9734_CR99","doi-asserted-by":"crossref","unstructured":"Williams HP (1985) Model building in linear and integer programming. In: Schittkowski K (ed) Computational mathematical programming, vol 15. NATO ASI Series. Springer, Berlin, pp 25\u201353. doi: 10.1007\/978-3-642-82450-0_2","DOI":"10.1007\/978-3-642-82450-0_2"},{"key":"9734_CR100","doi-asserted-by":"crossref","unstructured":"Witzgall C (1975) Mathematical methods of site selection for Electronic Message Systems (EMS). NBS Internal report, NBS","DOI":"10.6028\/NBS.IR.75-737"},{"key":"9734_CR101","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1007\/s11590-008-0105-6","volume":"3","author":"Y Xia","year":"2009","unstructured":"Xia Y (2009) New optimality conditions for quadratic optimization problems with binary constraints. Optim Lett 3:253\u2013263. doi: 10.1007\/s11590-008-0105-6","journal-title":"Optim Lett"},{"key":"9734_CR102","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/s10898-011-9660-y","volume":"52","author":"XJ Zheng","year":"2012","unstructured":"Zheng XJ, Sun XL, Li D, Xu YF (2012) On zero duality gap in nonconvex quadratic programming problems. J Global Optim 52:229\u2013242. doi: 10.1007\/s10898-011-9660-y","journal-title":"J Global Optim"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9734-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9734-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9734-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,17]],"date-time":"2020-08-17T23:40:47Z","timestamp":1597707647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9734-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,4,18]]},"references-count":102,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9734"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9734-0","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,4,18]]}}}