{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T21:56:54Z","timestamp":1778882214389,"version":"3.51.4"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Global Optimization"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1023\/a:1013886408463","type":"journal-article","created":{"date-parts":[[2002,12,28]],"date-time":"2002-12-28T18:50:27Z","timestamp":1041101427000},"page":"17-37","source":"Crossref","is-referenced-by-count":37,"title":["Branch-and-bound approaches to standard quadratic optimization problems"],"prefix":"10.1007","volume":"22","author":[{"given":"Immanuel M.","family":"Bomze","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"383088_CR1","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1008288411710","volume":"11","author":"L. T. H. An","year":"1997","unstructured":"An, L. T. H. and Tao, P. D. Solving a class of linearly constrained indefinite quadratic problems by DC algorithms. J. Global Optimiz. 11: 253\u2013285, 1997.","journal-title":"J. Global Optimiz."},{"key":"383088_CR2","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. and Tao, P. D. A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems. J. Global Optimiz. 13: 171\u2013206, 1998.","journal-title":"J. Global Optimiz."},{"key":"383088_CR3","volume-title":"Nonlinear programming - theory and algorithms","author":"M. S. Bazaraa","year":"1979","unstructured":"Bazaraa, M. S. and Shetty, C. M. Nonlinear programming - theory and algorithms. Wiley, New York, 1979."},{"key":"383088_CR4","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1023\/A:1008369322970","volume":"13","author":"I. M. Bomze","year":"1998","unstructured":"Bomze, I. M. On standard quadratic optimization problems. J. Global Optimiz. 13: 369\u2013387, 1998.","journal-title":"J. Global Optimiz."},{"key":"383088_CR5","first-page":"1","volume-title":"Handbook of Combinatorial Optimization","author":"I. M. Bomze","year":"1999","unstructured":"Bomze, I. M., Budinich, M., Pardalos, P. M. and Pelillo, M. The maximum clique problem. In D.-Z. Du and P. M. Pardalos, editors, Handbook of Combinatorial Optimization suppl. Vol. A:1\u201374. Kluwer, Dordrecht, 1999."},{"key":"383088_CR6","doi-asserted-by":"crossref","unstructured":"Bomze, I. M., Budinich, M., Pelillo, M. and Rossi, C. Annealed replication: a new heuristic for the maximum clique problem. To appear in: Discrete Applied Math., 2001.","DOI":"10.1007\/978-1-4757-3145-3_6"},{"key":"383088_CR7","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I. M. Bomze","year":"2000","unstructured":"Bomze, I. M., D\u00fcr, M., de Klerk, E., Quist, A. J., Roos, C. and Terlaky, T. On copositive programming and standard quadratic optimization problems. J. Global Optimiz. 18: 301\u2013320, 2000.","journal-title":"J. Global Optimiz."},{"key":"383088_CR8","first-page":"279","volume":"89","author":"I. M. Bomze","year":"1999","unstructured":"Bomze, I. M. and Stix, V. Genetical engineering via negative fitness: evolutionary dynamics for global optimization. Annals of O.R. 89: 279\u2013318, 1999.","journal-title":"Annals of O.R."},{"key":"383088_CR9","first-page":"155","volume":"13","author":"A. Cegielski","year":"1993","unstructured":"Cegielski, A. The Polyak subgradient projection method in matrix games. Discuss. Math. 13: 155\u2013166, 1993.","journal-title":"Discuss. Math."},{"key":"383088_CR10","unstructured":"D\u00fcr, M. A Note on Local and Global Optimality Conditions in D.C.-Programming. Research Report No. 56, Dept. of Statistics, Vienna Univ. Econ., 1999."},{"key":"383088_CR11","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P. Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Ruiz, M. and Xiong, J. Global minimization of indefinite quadratic functions subject to box constraints. Nav. Res. Logist. 40: 373\u2013392, 1993.","journal-title":"Nav. Res. Logist."},{"key":"383088_CR12","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1090\/S0025-5718-97-00809-0","volume":"66","author":"R. Horst","year":"1997","unstructured":"Horst, R. On generalized bisection of n-simplices. Math. of Comput. 66: 691\u2013698, 1997.","journal-title":"Math. of Comput."},{"key":"383088_CR13","volume-title":"Introduction to Global Optimization","author":"R. Horst","year":"1995","unstructured":"Horst, R., Pardalos, P. M. and Thoai, V. N. Introduction to Global Optimization. Kluwer, Dordrecht, 1995. BRANCH-AND-BOUND FOR STANDARD QUADRATIC OPTIMIZATION 37"},{"key":"383088_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF02239754","volume":"42","author":"R. Horst","year":"1989","unstructured":"Horst, R. and Thoai, V. N. Modification, implementation and comparison of three algorithms for globally solving linearly constrained concave minimization problems. Computing 42: 271\u2013289, 1989.","journal-title":"Computing"},{"key":"383088_CR15","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00429750","volume":"5","author":"R. Horst","year":"1996","unstructured":"Horst, R. and Thoai, V. N. A new algorithm for solving the general quadratic programming problem. Comput. Optim. Appl. 5: 39\u201348, 1996.","journal-title":"Comput. Optim. Appl."},{"key":"383088_CR16","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1080\/02331939208843807","volume":"25","author":"R. Horst","year":"1992","unstructured":"Horst, R., Thoai, V. N. and de Vries, J. On geometry and convergence of a class of simplicial covers. Optimization 25: 53\u201364, 1992.","journal-title":"Optimization"},{"key":"383088_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02947-3","volume-title":"Global Optimization","author":"R. Horst","year":"1993","unstructured":"Horst, R. and Tuy, H. Global Optimization. Springer, Heidelberg, 1993."},{"key":"383088_CR18","series-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge","year":"1996","unstructured":"Johnson, D. S. and Trick, M. A. (editors). Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26. American Mathematical Society, Providence, RI, 1996."},{"key":"383088_CR19","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1023\/A:1012395712371","volume":"21","author":"A. Kuznetsova","year":"2001","unstructured":"Kuznetsova, A. and Strekalovsky, A. On solving the maximum clique problem. J. Global Optimiz. 21: 265\u2013288, 2001.","journal-title":"J. Global Optimiz."},{"key":"383088_CR20","doi-asserted-by":"crossref","unstructured":"Massaro, A., Pelillo, M. and Bomze, I. M. A complementary pivoting approach to the maximum weight clique problem. To appear in: SIAM J. Optimiz., 2001.","DOI":"10.1007\/978-1-4613-0279-7_23"},{"key":"383088_CR21","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K. G. Murty","year":"1987","unstructured":"Murty, K. G. and Kabadi, S. N. Some NP-complete problems in quadratic and linear programming. Math. Programming 39: 117\u2013129, 1987.","journal-title":"Math. Programming"},{"key":"383088_CR22","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1023\/A:1008315627883","volume":"14","author":"I. Nowak","year":"1999","unstructured":"Nowak, I. A new semidefinite programming bound for indefinite quadratic forms over a simplex. J. Global Optimiz. 14: 357\u2013364, 1999.","journal-title":"J. Global Optimiz."},{"key":"383088_CR23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1051\/ro\/1996300100311","volume":"30","author":"T. Q. Phong","year":"1996","unstructured":"Phong, T. Q., An, L. T. H. and Tao, P. D. On globally solving linearly constrained indefinite quadratic minimization problems by decomposition branch and bound method. RAIRO, Rech. Oper. 30: 31\u201349, 1996.","journal-title":"RAIRO, Rech. Oper."},{"key":"383088_CR24","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1080\/10556789808805692","volume":"9","author":"A. J. Quist","year":"1998","unstructured":"Quist, A. J., de Klerk, E., Roos, C. and Terlaky, T. Copositive relaxation for general quadratic programming. Optimization Methods and Software 9: 185\u2013209, 1998.","journal-title":"Optimization Methods and Software"},{"key":"383088_CR25","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1008377529330","volume":"13","author":"U. Raber","year":"1998","unstructured":"Raber, U. A simplicial branch-and-bound method for solving nonconvex all-quadratic programs. J. Global Optimiz. 13: 417\u2013432, 1998.","journal-title":"J. Global Optimiz."},{"key":"383088_CR26","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718812","volume-title":"A mathematical view of interior-point methods in convex optimization","author":"J. Renegar","year":"2001","unstructured":"Renegar, J. A mathematical view of interior-point methods in convex optimization. Forthcoming, SIAM, Philadelphia, PA, 2001."},{"key":"383088_CR27","unstructured":"Stix, V. Global optimization of standard quadratic problems including parallel approaches. Ph.D. thesis, Univ. Vienna, 2000."},{"key":"383088_CR28","unstructured":"Stix, V. Target-oriented branch-and-bound method for global optimization. Preprint, Univ. Vienna, 2001."},{"key":"383088_CR29","volume-title":"Evolutionary Game Theory","author":"J. W. Weibull","year":"1995","unstructured":"Weibull, J. W. Evolutionary Game Theory. MIT Press, Cambridge, MA, 1995."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013886408463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013886408463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013886408463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:38:25Z","timestamp":1751366305000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013886408463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":29,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["383088"],"URL":"https:\/\/doi.org\/10.1023\/a:1013886408463","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}