{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:29:44Z","timestamp":1759667384600},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,4,9]],"date-time":"2011-04-09T00:00:00Z","timestamp":1302307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s10898-011-9713-2","type":"journal-article","created":{"date-parts":[[2011,4,8]],"date-time":"2011-04-08T13:33:45Z","timestamp":1302269625000},"page":"797-829","source":"Crossref","is-referenced-by-count":18,"title":["An exact solution method for unconstrained quadratic 0\u20131 programming: a geometric approach"],"prefix":"10.1007","volume":"52","author":[{"given":"D.","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X. L.","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C. L.","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,4,9]]},"reference":[{"key":"9713_CR1","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1023\/A:1011968411281","volume":"21","author":"J. Abello","year":"2001","unstructured":"Abello J., Butenko S., Pardalos P.M., Resende M.G.C.: Finding independent sets in a graph using continuous multivariable polynomial formulations. J. Global Optim. 21, 111\u2013137 (2001)","journal-title":"J. Global Optim."},{"key":"9713_CR2","doi-asserted-by":"crossref","first-page":"1274","DOI":"10.1287\/mnsc.32.10.1274","volume":"32","author":"W.P. Adams","year":"1986","unstructured":"Adams W.P., Sherali H.D.: A tight linearization and an algorithm for zero-one quadratic programming problems. Manage. Sci. 32, 1274\u20131290 (1986)","journal-title":"Manage. Sci."},{"key":"9713_CR3","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1023\/A:1008240227198","volume":"13","author":"L.T.H. An","year":"1998","unstructured":"An L.T.H., Tao P.D.: A branch and bound method via D.C. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optim. 13, 171\u2013206 (1998)","journal-title":"J. Global Optim."},{"key":"9713_CR4","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona F., J\u00fcnger M., Reinelt G.: Experiments in quadratic 0\u20131 programming. Math. Program. 44, 127\u2013137 (1989)","journal-title":"Math. Program."},{"key":"9713_CR5","unstructured":"Beasley, E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Technical report, Imperial College, (1998)"},{"key":"9713_CR6","unstructured":"Beasley J.E.: OR-Library (1990), http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html"},{"key":"9713_CR7","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1137\/S1052623498336930","volume":"11","author":"A. Beck","year":"2000","unstructured":"Beck A., Teboulle M.: Global optimality conditions for quadratic optimization problems with binary constraints. SIAM J. Optim. 11, 179\u2013188 (2000)","journal-title":"SIAM J. Optim."},{"key":"9713_CR8","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.: Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Math. Program. 109, 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"9713_CR9","unstructured":"Billionnet, A., Elloumi, S., Plateau, M.C.: Convex quadratic progrmaming for exact solution of 0\u20131 quadratic programs. Technical report, CEDRIC 856 (2005). http:\/\/cedric.cnam.fr\/publis\/rc856.pdf"},{"key":"9713_CR10","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.: Minimization of a quadratic pseudo-Boolean function. Eur. J. Oper. Res. 78, 106\u2013115 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9713_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4757-3023-4_1","volume-title":"Handbook of Combinatorial Optimization","author":"I.M. Bomze","year":"1999","unstructured":"Bomze I.M., Budinich M., Pardalos P.M., Pelillo M.: The maximum clique problem. In: Du, D.Z., Pardalos, P.M. (eds) Handbook of Combinatorial Optimization, pp. 1\u201374. Kluwer, Dordrecht (1999)"},{"key":"9713_CR12","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 P.L.: Pseudo-Boolean optimization. Discr. Appl. Math. 123, 155\u2013225 (2002)","journal-title":"Discr. Appl. Math."},{"key":"9713_CR13","unstructured":"Boros, E., Hammer, P.L., Tavares, G.: Local search heuristics for unconstrained quadratic binary optimization. Technical report, RUTCOR, Rutgers University. Rutcor Research Report (2005)"},{"key":"9713_CR14","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(84)90111-2","volume":"7","author":"M.W. Carter","year":"1984","unstructured":"Carter M.W.: The indefinite zero-one quadratic problem. Discr. Appl. Math. 7, 23\u201344 (1984)","journal-title":"Discr. Appl. Math."},{"key":"9713_CR15","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P. Chardaire","year":"1995","unstructured":"Chardaire P., Sutter A.: A decomposition method for quadratic zero-one programming. Manage. Sci. 41, 704\u2013712 (1995)","journal-title":"Manage. Sci."},{"key":"9713_CR16","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/0166-218X(90)90142-Y","volume":"29","author":"Y. Crama","year":"1990","unstructured":"Crama Y., Hansen P., Jaumard B.: The basic algorithm for pseudo-Boolean programming revisited. Discr. Appl. Math. 29, 171\u2013185 (1990)","journal-title":"Discr. Appl. Math."},{"key":"9713_CR17","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C. Delorme","year":"1993","unstructured":"Delorme C., Poljak S.: Laplacian eigenvalues and the maximum cut problem. Math. Program. 62, 557\u2013574 (1993)","journal-title":"Math. Program."},{"key":"9713_CR18","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"Fortet R.: Applications de lalgebre de Boole en recherche operationelle. Rev. Franc. Recherche Oper. 4, 17\u201326 (1960)","journal-title":"Rev. Franc. Recherche Oper."},{"key":"9713_CR19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF03006558","volume":"11","author":"R. Fortet","year":"1960","unstructured":"Fortet R.: L\u2032algebre de boole et ses applications en recherche operationnelle. Trabajos estad\u00edstica 11, 111\u2013118 (1960)","journal-title":"Trabajos estad\u00edstica"},{"key":"9713_CR20","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G. Gallo","year":"1980","unstructured":"Gallo G., Hammer P.L., Simeone B.: Quadratic knapsack problems. Math. Program. 12, 132\u2013149 (1980)","journal-title":"Math. Program."},{"key":"9713_CR21","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. Manage. Sci. 44, 336\u2013345 (1998)","journal-title":"Manage. Sci."},{"key":"9713_CR22","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/opre.21.1.156","volume":"21","author":"F. Glover","year":"1973","unstructured":"Glover F., Woolsey R.E.D.: Further reduction of zero-one polynomial programs to zero-one linear programming problems. Oper. Res. 21, 156\u2013161 (1973)","journal-title":"Oper. Res."},{"key":"9713_CR23","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover F., Woolsey R.E.D.: Note on converting the 0\u20131 polynomial programming problem into a 0\u20131 linear program. Oper. Res. 22, 180\u2013181 (1974)","journal-title":"Oper. Res."},{"key":"9713_CR24","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"M.X. Goemans","year":"1995","unstructured":"Goemans M.X., Williamson D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"9713_CR25","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0377-2217(84)90055-9","volume":"15","author":"V.P. Gulati","year":"1984","unstructured":"Gulati V.P., Gupta S.K., Mittal A.K.: Unconstrained quadratic bsivalent programming problem. Eur. J. Oper. Res. 15, 121\u2013125 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9713_CR26","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P.L. Hammer","year":"1984","unstructured":"Hammer P.L., Hansen P., Simeone B.: Roof duality, complementation and persistency in quadratic 0\u20131 optimization. Math. Program. 28, 121\u2013155 (1984)","journal-title":"Math. Program."},{"key":"9713_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"P.L. Hammer","year":"1968","unstructured":"Hammer P.L., Rudeanu S.: Boolean Methods in Operations Research and Related Areas. Springer, Berlin (1968)"},{"key":"9713_CR28","unstructured":"Hansen, P., Jaumard, B., Christophe, C.M.: A simple enumerative algorithm for unconstrained 0\u20131 quadratic programming. Technical report, Groupe d\u2019\u00e9tudes et de recherche en analyse des d\u00e9cisions. Cahiers du GERAD G-2000-59 (2000)"},{"key":"9713_CR29","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.: Constrained nonlinear 0\u20131 programming. ORSA J. Comput. 5, 97\u2013119 (1993)","journal-title":"ORSA J. Comput."},{"key":"9713_CR30","first-page":"291","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg C., Rendl F.: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes. Math. Program. 82, 291\u2013315 (1998)","journal-title":"Math. Program."},{"key":"9713_CR31","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 P.M.: Lower bound improvement and forcing rule for quadratic binary programming. Comput. Optim. Appl. 33, 187\u2013208 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"9713_CR32","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009877331765","volume":"5","author":"L.D. Iasemidis","year":"2001","unstructured":"Iasemidis L.D., Pardalos P.M., Sackellares J.C., Shiau D.-S.: Quadratic binary programming and dynamical system approach to determine the predictability of epileptic seizures. J. Combin. Optim. 5, 9\u201326 (2001)","journal-title":"J. Combin. Optim."},{"key":"9713_CR33","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.: An algorithm for quadratic zero-one programs. Naval Res. Logist. 37, 527\u2013538 (1990)","journal-title":"Naval Res. Logist."},{"key":"9713_CR34","doi-asserted-by":"crossref","first-page":"171","DOI":"10.15807\/jorsj.23.171","volume":"23","author":"H. Konno","year":"1980","unstructured":"Konno H.: Maximizing a convex quadratic function over a hypercube. J. Oper. Res. Soc. Jpn. 23, 171\u2013189 (1980)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"9713_CR35","volume-title":"Nonlinear Integer Programming","author":"D. Li","year":"2006","unstructured":"Li D., Sun X.L.: Nonlinear Integer Programming. Springer, New York (2006)"},{"key":"9713_CR36","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1137\/040606193","volume":"17","author":"D. Li","year":"2006","unstructured":"Li D., Sun X.L., Wang F.L.: Convergent Lagrangian and contour-cut method for nonlinear integer programming with a quadratic objective function. SIAM J. Optim. 17, 372\u2013400 (2006)","journal-title":"SIAM J. Optim."},{"key":"9713_CR37","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1111\/j.1467-9965.2006.00262.x","volume":"16","author":"D. Li","year":"2006","unstructured":"Li D., Sun X.L., Wang J.: Optimal lot solution to cardinality constrained mean-variance formulation for portfolio selection. Math. Finance 16, 83\u2013101 (2006)","journal-title":"Math. Finance"},{"key":"9713_CR38","unstructured":"Liu, W., Wilkins, D., Alidaee B.: A hybrid multi-exchange local search for unconstrained binary quadratic program. Technical report, Hearin Center for Enterprose Science, The University of Mississippi, Working Paper, HCES-09-05 (2005)"},{"key":"9713_CR39","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/0377-2217(84)90054-7","volume":"15","author":"S.H. Lu","year":"1984","unstructured":"Lu S.H.: An improved enumerative algorithm for solving quadratic zero-one programming. Eur. J. Oper. Res. 15, 110\u2013120 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9713_CR40","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. Manage. Sci. 26, 282\u2013296 (1980)","journal-title":"Manage. Sci."},{"key":"9713_CR41","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02238228","volume":"54","author":"G. Palubeckis","year":"1995","unstructured":"Palubeckis G.: A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming. Computing 54, 283\u2013301 (1995)","journal-title":"Computing"},{"key":"9713_CR42","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-004-0529-4","volume":"101","author":"P.M. Pardalos","year":"2004","unstructured":"Pardalos P.M., Chaovalitwongse W., Iasemidis L.D., Sackellares J.C., Shiau D.-S., Carney P.R., Prokopyev O.A., Yatsenko V.A.: Seizure warning algorithm based on optimization and nonlinear dynamics. Math. Program. Ser. B 101, 365\u2013385 (2004)","journal-title":"Math. Program. Ser. B"},{"key":"9713_CR43","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos P.M., Rodgers G.P.: Computational aspects of a branch-and-bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"9713_CR44","doi-asserted-by":"crossref","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. J. Global Optim. 4, 229\u2013241 (1994)","journal-title":"J. Global Optim."},{"key":"9713_CR45","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/978-3-540-72792-7_23","volume":"4513","author":"F. Rendl","year":"2007","unstructured":"Rendl F., Rinaldi G., Wiegele A.: Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations. Lect. Notes Comput. Sci. 4513, 295\u2013309 (2007)","journal-title":"Lect. Notes Comput. Sci."},{"key":"9713_CR46","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"J.F. Sturm","year":"1999","unstructured":"Sturm J.F.: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11, 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"9713_CR47","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1023\/A:1018364802456","volume":"10","author":"N.V. Thoai","year":"1998","unstructured":"Thoai N.V.: Global optimization techniques for solving the general quadratic integer programming problem. Comput. Optim. Appl. 10, 149\u2013163 (1998)","journal-title":"Comput. Optim. Appl."},{"key":"9713_CR48","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-004-0531-x","volume":"102","author":"D. Vanderbussche","year":"2005","unstructured":"Vanderbussche D., Nemhauser G.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102, 371\u2013405 (2005)","journal-title":"Math. Program."},{"key":"9713_CR49","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D. Vanderbussche","year":"2005","unstructured":"Vanderbussche D., Nemhauser G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102, 531\u2013557 (2005)","journal-title":"Math. Program."},{"key":"9713_CR50","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L.J. Watters","year":"1967","unstructured":"Watters L.J.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper. Res. 15, 1171\u20131174 (1967)","journal-title":"Oper. Res."},{"key":"9713_CR51","unstructured":"Williams, A.C.: Quadratic 0-1 programming using the roof dual with computational results. Technical report, RUTCOR, Rutgers University, RUTCOR Research Report RRR 8-1985 (1985)"},{"key":"9713_CR52","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1023\/A:1008293029350","volume":"13","author":"Y. Yajima","year":"1998","unstructured":"Yajima Y., Fujie T.: A polyhedral approach for nonconvex quadratic programming problems with box constraints. J. Global Optim. 13, 151\u2013170 (1998)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9713-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-011-9713-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-011-9713-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T21:18:40Z","timestamp":1560115120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-011-9713-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4,9]]},"references-count":52,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["9713"],"URL":"https:\/\/doi.org\/10.1007\/s10898-011-9713-2","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4,9]]}}}