{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T14:34:47Z","timestamp":1759674887791},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,11,9]],"date-time":"2007-11-09T00:00:00Z","timestamp":1194566400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10589-007-9110-4","type":"journal-article","created":{"date-parts":[[2007,11,8]],"date-time":"2007-11-08T14:54:47Z","timestamp":1194533687000},"page":"349-362","source":"Crossref","is-referenced-by-count":19,"title":["A global continuation algorithm for solving binary quadratic programming problems"],"prefix":"10.1007","volume":"41","author":[{"given":"Shaohua","family":"Pan","sequence":"first","affiliation":[]},{"given":"Tao","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Yuxi","family":"Jiang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,11,9]]},"reference":[{"key":"9110_CR1","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B. Alidaee","year":"1994","unstructured":"Alidaee, B., Kochenberger, G., 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":"9110_CR2","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: Corne, D., Dorigo, M., Glover, F. (eds.) New Methods in Optimization, pp. 317\u2013330. McGraw-Hill, New York (1999)"},{"key":"9110_CR3","doi-asserted-by":"crossref","first-page":"829","DOI":"10.1080\/02331938808843396","volume":"19","author":"M. Borchardt","year":"1988","unstructured":"Borchardt, M.: An exact penalty approach for solving a class of minimization problem with boolean variables. Optimization 19, 829\u2013838 (1988)","journal-title":"Optimization"},{"key":"9110_CR4","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.: Pseudo-boolean optimization. Discrete Appl. Math. 123, 155\u2013255 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9110_CR5","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1137\/S1052623400382467","volume":"12","author":"S. Burer","year":"2001","unstructured":"Burer, S., Monterio, R.D.C., Zhang, Y.: Rank-two relaxation heuristics for Max-Cut and other binary quadratic programs. SIAM J. Optim. 12, 503\u2013521 (2001)","journal-title":"SIAM J. Optim."},{"key":"9110_CR6","doi-asserted-by":"crossref","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. Manag. Sci. 41, 704\u2013712 (1994)","journal-title":"Manag. Sci."},{"key":"9110_CR7","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1109\/99.714603","volume":"5","author":"J. Czyzyk","year":"1998","unstructured":"Czyzyk, J., Mesnier, M., Mor\u00e9, J.: The NEOS server. IEEE J. Comput. Sci. Eng. 5, 68\u201375 (1998)","journal-title":"IEEE J. Comput. Sci. Eng."},{"key":"9110_CR8","doi-asserted-by":"crossref","unstructured":"Dolan, E.: The NEOS Server 4.0 Administrative Guide. Technical Memorandum ANL\/MCS-TM-250, Mathematics and Computer Science Division, Argonne National Laboratory, May 2001","DOI":"10.2172\/822567"},{"key":"9110_CR9","unstructured":"Dongarra, J.J.: Performance of various computers using standard linear equations software. Technical reports CS-89-95, University of Tennessee, Knoxville, and Mathematical Sciences Section, Oak Ridge National Laboratory, Oak Ridge. http:\/\/www.netlib.org\/benchmark\/performance.ps (2006)"},{"key":"9110_CR10","volume-title":"Nonlinear Programming: Sequential Unconstrained Minimization Techniques","author":"A.V. Fiacco","year":"1968","unstructured":"Fiacco, A.V., McCormick, G.P.: Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York (1968)"},{"key":"9110_CR11","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., Kochenberger, G.: One-pass heuristics large-scale unconstrained binary quadratic programs. Eur. J. Oper. Res. 137, 272\u2013287 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9110_CR12","first-page":"1115","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. Appl. Comput. Math. 42, 1115\u20131145 (1995)","journal-title":"J. Appl. Comput. Math."},{"key":"9110_CR13","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1080\/02331939208843795","volume":"24","author":"A. Fischer","year":"1992","unstructured":"Fischer, A.: A special Newton-type optimization methods. Optimization 24, 269\u2013284 (1992)","journal-title":"Optimization"},{"key":"9110_CR14","first-page":"513","volume":"76","author":"A. Fischer","year":"1997","unstructured":"Fischer, A.: Solution of the monotone complementarity problem with locally Lipschitzian functions. Math. Program. 76, 513\u2013532 (1997)","journal-title":"Math. Program."},{"key":"9110_CR15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00291-003-0153-3","volume":"26","author":"G. Kochenberger","year":"2004","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., Rego, C.: A unified modeling and solution framework for combinatorial optimization problems. OR Spectrum 26, 237\u2013250 (2004)","journal-title":"OR Spectrum"},{"key":"9110_CR16","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1109\/4234.951377","volume":"5","author":"J. Luo","year":"2001","unstructured":"Luo, J., Pattipati, K., Willett, P., Hasegawa, F.: Near-optimal multiuser detection in synchronous CDMA using probabilistic data association. IEEE Commun. Lett. 5, 361\u2013363 (2001)","journal-title":"IEEE Commun. Lett."},{"key":"9110_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1137\/0131009","volume":"31","author":"O.L. Mangasarian","year":"1976","unstructured":"Mangasarian, O.L.: Equivalence of the complementarity problem to a system of nonlinear equations. SIAM Appl. Math. 31, 89\u201392 (1976)","journal-title":"SIAM Appl. Math."},{"key":"9110_CR18","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF00122052","volume":"2","author":"P. Michelon","year":"1992","unstructured":"Michelon, P.: Unconstrained nonlinear 0-1 programming: a nondifferentiable approach. J. Glob. Optim. 2, 155\u2013165 (1992)","journal-title":"J. Glob. Optim."},{"key":"9110_CR19","unstructured":"Ng, K.-M.: A continuation approach for solving nonlinear optimization problems with discrete variables. Doctor Dissertation, Department of Management Science and Engineering of Stanford University (2002)"},{"key":"9110_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","volume":"19","author":"P.M. Pardalos","year":"1992","unstructured":"Pardalos, P.M., Rodgers, G.R.: A branch and bound algorithm for maximum clique problem. Comput. Oper. Res. 19, 363\u2013375 (1992)","journal-title":"Comput. Oper. Res."},{"key":"9110_CR21","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. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"key":"9110_CR22","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1287\/moor.20.3.550","volume":"3","author":"S. Polijak","year":"1995","unstructured":"Polijak, S., Wolkowicz, H.: Convex relaxation of (0,1)-quadratic programming. Math. Oper. Res. 3, 550\u2013561 (1995)","journal-title":"Math. Oper. Res."},{"key":"9110_CR23","first-page":"95","volume":"2","author":"I.G. Rosenberg","year":"1972","unstructured":"Rosenberg, I.G.: 0-1 optimization and non-linear programming. Rev. Fr. Autom. Inform. Rech. Oper. (S\u00e9r. Blueu) 2, 95\u201397 (1972)","journal-title":"Rev. Fr. Autom. Inform. Rech. Oper. (S\u00e9r. Blueu)"},{"key":"9110_CR24","unstructured":"Sahinidis, N.V.: BARON: Branch and Reduce Optimization Navigator. http:\/\/archimedes.scs.uiuc.edu\/baron\/manuse.pdf (2000)"},{"key":"9110_CR25","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":"9110_CR26","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"95","author":"M. Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: A theoretical and computational study. Math. Program. 95, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"9110_CR27","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1016\/S0166-218X(01)00352-3","volume":"123","author":"H. Wolkowicz","year":"2003","unstructured":"Wolkowicz, H., Anjos, M.F.: Semidefinite programming for discrete optimization and matrix completion problem. Discrete Appl. Math. 123, 513\u2013577 (2003)","journal-title":"Discrete Appl. Math."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9110-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-007-9110-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-007-9110-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:33Z","timestamp":1559302593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-007-9110-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,11,9]]},"references-count":27,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["9110"],"URL":"https:\/\/doi.org\/10.1007\/s10589-007-9110-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,11,9]]}}}