{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:36:00Z","timestamp":1759667760791},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2010,1,10]],"date-time":"2010-01-10T00:00:00Z","timestamp":1263081600000},"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":[[2010,12]]},"DOI":"10.1007\/s10898-009-9507-y","type":"journal-article","created":{"date-parts":[[2010,1,9]],"date-time":"2010-01-09T08:43:33Z","timestamp":1263026613000},"page":"595-632","source":"Crossref","is-referenced-by-count":39,"title":["An efficient combined DCA and B&B using DC\/SDP relaxation for globally solving binary quadratic programs"],"prefix":"10.1007","volume":"48","author":[{"given":"Tao","family":"Pham Dinh","sequence":"first","affiliation":[]},{"given":"Nam","family":"Nguyen Canh","sequence":"additional","affiliation":[]},{"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,10]]},"reference":[{"issue":"1","key":"9507_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0166-218X(92)00119-7","volume":"48","author":"W.P. Adams","year":"1994","unstructured":"Adams W.P., Dearing P.M.: On the equivalence between roof duality and Lagrangian duality for unconstrained 0\u20131 quadratic programming problems. Discrete Appl. Math. 48(1), 1\u201320 (1994)","journal-title":"Discrete Appl. Math."},{"issue":"10","key":"9507_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 0-1 quadratic programming problems. Manag. Sci. 32(10), 1274\u20131290 (1986)","journal-title":"Manag. Sci."},{"key":"9507_CR3","doi-asserted-by":"crossref","unstructured":"Beasley, J.E.: Obtaining test problems via internet. J. Global Optim. 8, 429\u2013433 (1996). http:\/\/people.brunel.ac.uk\/~mastjjb\/jeb\/info.html","DOI":"10.1007\/BF02404002"},{"key":"9507_CR4","unstructured":"Beasley, J.E.: Heuristic algorithms for unconstrained binary quadratic programming problem. Technical report, The management school, Imperial college, London SW7 2AZ, England (1998)"},{"issue":"1, Ser.A","key":"9507_CR5","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 unconstrained quadratic 0\u20131 problem. Math. Program. 109(1, Ser.A), 55\u201368 (2007)","journal-title":"Math. Program."},{"key":"9507_CR6","unstructured":"Delaporte, G., Jouteau, S., Roupin, F.: SDP S :A tool to formulate and solve semidefinite relaxations for bivalent quadratic problems (2002). http:\/\/semidef.free.fr\/"},{"key":"9507_CR7","unstructured":"Fujisawa, K., Kojima, M., Nakata, K., Yamashita, M.: SDPA\u2014Users manual version 6.00. Research reports on Mathematical and Computing Sciences, Tokyo Institue of Technology (2002)"},{"key":"9507_CR8","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. Manag. Sci. 44, 336\u2013345 (1998)","journal-title":"Manag. Sci."},{"key":"9507_CR9","first-page":"330","volume":"6","author":"P.L. Hammer","year":"1968","unstructured":"Hammer P.L.: Plant location\u2014A pseudo-Boolean approach. Isr. J. Technol. 6, 330\u2013332 (1968)","journal-title":"Isr. J. Technol."},{"key":"9507_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research","author":"P.L. Hammer","year":"1968","unstructured":"Hammer P.L., Rudeanu S.: Boolean Methods in Operations Research. Springer, New York (1968)"},{"key":"9507_CR11","unstructured":"Hansen, P., Jaumard, B., Meyer, C.: A simple enumerative method algorithm for unconstrained 0-1 quadratic programming. Technical ReportG-2000-59, Les Cahiers du GERAD (2000)"},{"key":"9507_CR12","unstructured":"Helmberg, C.: Semidefinite programming for combinatorial optimization, ZIB-Report 00-34, Oct (2000)"},{"issue":"3","key":"9507_CR13","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C. Helmberg","year":"1998","unstructured":"Helmberg C., Rendl F.: Solving quadratic 0-1 problem by semidefinite programs and cutting planes. Math. Program. 82(3), 291\u2013315 (1998)","journal-title":"Math. Program."},{"issue":"3","key":"9507_CR14","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1137\/S1052623497328987","volume":"10","author":"C. Helmberg","year":"2000","unstructured":"Helmberg C., Rendl F.: A spectral bundle method for semidefinite programming. SIAM J. Optim. 10(3), 673\u2013696 (2000)","journal-title":"SIAM J. Optim."},{"key":"9507_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms","author":"J.B. Hiriart Urruty","year":"1993","unstructured":"Hiriart Urruty J.B., Lemar\u00e9chal C.: Convex Analysis and Minimization Algorithms. Springer, Berlin, Heidelberg (1993)"},{"key":"9507_CR16","volume-title":"Global Optimization: Deterministic Approaches","author":"R. Horst","year":"2000","unstructured":"Horst R., Tuy H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (2000)","edition":"3"},{"key":"9507_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-0015-5","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"2000","unstructured":"Horst R., Pardalos P.M., Thoai N.: Introduction to Global Optimization, 2nd edn. Kluwer, Dordrecht (2000)","edition":"2"},{"key":"9507_CR18","unstructured":"ILOG. CPLEX 7.5. Ilog cplex 7.5 reference manual. ILOG CPLEX Division, Gentile, France. http:\/\/www.ilog.com\/products\/cplex"},{"issue":"6\/7","key":"9507_CR19","first-page":"107","volume":"21","author":"S. Jha","year":"1991","unstructured":"Jha S., Pardalos P.M.: Graph separation techniques for quadratic 0\u20131 programming. Comput. Math. Appl. 21(6\/7), 107\u2013113 (1991)","journal-title":"Comput. Math. Appl."},{"key":"9507_CR20","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","volume":"14","author":"D.J. Laughunn","year":"1970","unstructured":"Laughunn D.J.: Quadratic binary programming. Oper. Res. 14, 454\u2013461 (1970)","journal-title":"Oper. Res."},{"key":"9507_CR21","unstructured":"Le Thi, H.A.: Contribution \u00e0 l\u2019optimisation non convexe et l\u2019optimisation globale: Th\u00e9orie, Algorithmes et Applications, Habilitation \u00e0 Diriger des recherches, Universit\u00e9 de Rouen, Juin (1997)"},{"key":"9507_CR22","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"H.A. Le Thi","year":"1997","unstructured":"Le Thi H.A., Pham Dinh T.: Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optim. 11, 253\u2013285 (1997)","journal-title":"J. Global Optim."},{"key":"9507_CR23","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"H.A. Le Thi","year":"1998","unstructured":"Le Thi H.A., Pham Dinh T.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"9507_CR24","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009777410170","volume":"2","author":"H.A. Le Thi","year":"1998","unstructured":"Le Thi H.A., Pham Dinh T.: A combined DC optimization \u2014ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. J. Comb. Optim. 2(1), 9\u201329 (1998)","journal-title":"J. Comb. Optim."},{"issue":"3","key":"9507_CR25","first-page":"1","volume":"45","author":"H.A. Le Thi","year":"2001","unstructured":"Le Thi H.A., Pham Dinh T.: A continuous approach for large-scale constrained quadratic zero-one programming. (In honor of Professor ELSTER, Founder of the Journal Optimization) Optimization 45(3), 1\u201328 (2001)","journal-title":"(In honor of Professor ELSTER, Founder of the Journal Optimization) Optimization"},{"issue":"1","key":"9507_CR26","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1137\/S1052623498342794","volume":"14","author":"H.A. Le Thi","year":"2003","unstructured":"Le Thi H.A., Pham Dinh T.: Large scale molecular optimization from distance matrices by a DC optimization approach. SIAM J. Optim. 14(1), 77\u2013117 (2003)","journal-title":"SIAM J. Optim."},{"key":"9507_CR27","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming approaches and DCA for globally solving linear complementarity problems, Research Report, National Institute for Applied Sciences, Rouen (2004)"},{"key":"9507_CR28","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"H.A. Le Thi","year":"2005","unstructured":"Le Thi H.A., Pham Dinh T.: The DC programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133, 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"key":"9507_CR29","unstructured":"Le Thi, H.A., Pham Dinh, T., Huynb Van, N.: Exact penalty techniques in DC programming, Research Report, National Institute for Applied Sciences, Rouen (2005)"},{"key":"9507_CR30","first-page":"169","volume":"2","author":"H.A. Le Thi","year":"1999","unstructured":"Le Thi H.A., Pham Dinh T., Le Dung M.: Exact penalty in DC programming. Vietnam J. Math. 2, 169\u2013178 (1999)","journal-title":"Vietnam J. Math."},{"key":"9507_CR31","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1023\/A:1023993504522","volume":"117","author":"H.A. Le Thi","year":"2003","unstructured":"Le Thi H.A., Pham Dinh T., Le Dung M.: Simplicially constrained D.C. optimization over the efficient and weakly efficient sets. J. Optim. Theory Appl. 117, 503\u2013521 (2003)","journal-title":"J. Optim. Theory Appl."},{"key":"9507_CR32","unstructured":"Le Thi, H.A., Pham Dinh, T., Nguyen Canh, N.: Local and global approaches based on DC programming, branch-and-bound and SDP techniques for nonconvex quadratic programming, Research Report , National Institute for Applied Sciences, Rouen (2005)"},{"key":"9507_CR33","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1007\/978-1-4613-0279-7_6","volume-title":"Advances in Convex Analysis and Global Optimization","author":"C. Lemar\u00e9chal","year":"2001","unstructured":"Lemar\u00e9chal C., Oustry F.: SDP relaxations in combinatorial optimization from a Lagrangian point of view. In: Hadjisavvas, N., Pardalos, P.M. (eds) Advances in Convex Analysis and Global Optimization, pp. 119\u2013134. Kluwer, Dordrecht (2001)"},{"key":"9507_CR34","unstructured":"Nam, N.C.: Approches Locales et Globales bas\u00e9es sur la Programmation DC & DCA et les Techniques B&B avec Relaxation SDP pour certaines classes des programmes non convexes. Simulations Num\u00e9riques et Codes \u00e0 l\u2019Usage Industriel, PhD thesis, National Institute for Applied Sciences-Rouen, France (2007)"},{"key":"9507_CR35","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"},{"issue":"1","key":"9507_CR36","first-page":"289","volume":"70","author":"T. Pham Dinh","year":"1997","unstructured":"Pham Dinh T., Le Thi H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday 70(1), 289\u2013357 (1997)","journal-title":"Acta Math. Vietnamica, dedicated to Professor Hoang Tuy on the occasion of his 70th birthday"},{"key":"9507_CR37","doi-asserted-by":"crossref","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T. Pham Dinh","year":"1998","unstructured":"Pham Dinh T., Le Thi H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8, 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"9507_CR38","doi-asserted-by":"crossref","unstructured":"Pham Dinh, T., Le Thi, H.A., Akoa, F.: Combining DCA and interior point techniques for large-scale nonconvex quadratic programming, optimization, methods and softwares. 23(4), 609\u2013629 (2008)","DOI":"10.1080\/10556780802263990"},{"key":"9507_CR39","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S. Poljak","year":"1995","unstructured":"Poljak S., Rendl F., Wolkowicz H.: A recipe for semidefinite relaxation for (01)-quadratic programming. J. Global Optim. 7, 51\u201373 (1995)","journal-title":"J. Global Optim."},{"key":"9507_CR40","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","volume-title":"Convex Analysis","author":"R.T. Rockafeller","year":"1970","unstructured":"Rockafeller R.T.: Convex Analysis. Princeton University, Princeton (1970)"},{"key":"9507_CR41","first-page":"215","volume":"17","author":"P. Thai Quynh","year":"1996","unstructured":"Thai Quynh P., Le Thi H.A., Pham Dinh T.: Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems. Oper. Res. Lett. 17, 215\u2013222 (1996)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"9507_CR42","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1051\/ro\/1996300100311","volume":"30","author":"P. Thai Quynh","year":"1996","unstructured":"Thai Quynh P., Le Thi H.A., Pham Dinh T.: On the global solution of linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method. RAIRO, Rech. Op\u00e9r. 30(1), 31\u201349 (1996)","journal-title":"RAIRO, Rech. Op\u00e9r."},{"key":"9507_CR43","unstructured":"Wiegele, A.: Big Mac library. http:\/\/biqmac.uni-klu.ac.at\/biqmaclib.html (2007)"},{"key":"9507_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-4381-7","volume-title":"Handbook of Semidefinite Programming\u2014Theory, Algorithms, and Application","author":"H. Wolkowicz","year":"2000","unstructured":"Wolkowicz H., Saigal R., Vandenberghe L.: Handbook of Semidefinite Programming\u2014Theory, Algorithms, and Application. Kluwer, Dordrecht (2000)"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9507-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-009-9507-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9507-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:55Z","timestamp":1559278735000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-009-9507-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,10]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2010,12]]}},"alternative-id":["9507"],"URL":"https:\/\/doi.org\/10.1007\/s10898-009-9507-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,10]]}}}