{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T20:40:06Z","timestamp":1774557606290,"version":"3.50.1"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,9,1]],"date-time":"1998-09-01T00:00:00Z","timestamp":904608000000},"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":[[1998,9]]},"DOI":"10.1023\/a:1008293029350","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T13:47:34Z","timestamp":1040564854000},"page":"151-170","source":"Crossref","is-referenced-by-count":41,"title":["A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints"],"prefix":"10.1007","volume":"13","author":[{"given":"Yasutoshi","family":"Yajima","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tetsuya","family":"Fujie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"160332_CR1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","volume":"5","author":"W.F. Alizadeh","year":"1995","unstructured":"Alizadeh, W.F. (1995), Interior point methods in semidefinite programming with application to combinatorial optimization, SIAM Journal on Optimization 5: 13\u201351.","journal-title":"SIAM Journal on Optimization"},{"key":"160332_CR2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F. Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M. and Reinelt, G. (1989), Experiments in quadratic 0\u20131 programming, Mathematical Programming 44: 127\u2013137.","journal-title":"Mathematical Programming"},{"key":"160332_CR3","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F. Barahona","year":"1986","unstructured":"Barahona, F. and Mahjoub, A.R. (1986), On the cut polytope, Mathematical Programming 36: 157\u2013173.","journal-title":"Mathematical Programming"},{"key":"160332_CR4","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M. Bazaraa","year":"1993","unstructured":"Bazaraa, M., Sherali, H.D. and Shetty, C.M. (1993), Nonlinear Programming: Theory and Algorithms, John Wiley & Sons, New York."},{"key":"160332_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/BF02115753","volume":"33","author":"E. Boros","year":"1991","unstructured":"Boros, E. and Hammer, P.L. (1991), The max\u2013cut problem and quadratic 0\u20131 optimization; polyhedral aspect, relaxations and bounds, Annals of Operations Research 33: 151\u2013180.","journal-title":"Annals of Operations Research"},{"key":"160332_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1287\/moor.18.1.245","volume":"18","author":"E. Boros","year":"1993","unstructured":"Boros, E. and Hammer, P.L. (1993), Cut polytopes, Boolean quadric polytopes and nonnegative pseudo\u2013Boolean functions, Mathematics of Operations Research 18: 245\u2013253.","journal-title":"Mathematics of Operations Research"},{"key":"160332_CR7","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF01589112","volume":"45","author":"T.F. Coleman","year":"1989","unstructured":"Coleman, T.F. and Hulbert, L.A. (1989), A direct active set algorithm for large sparse quadratic programs with simple bounds, Mathematical Programming, 45: 373\u2013406.","journal-title":"Mathematical Programming"},{"key":"160332_CR8","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-1-4757-2600-8_5","volume-title":"Developments in Global Optimization","author":"P.L. De Angelis","year":"1997","unstructured":"De Angelis, P.L., Pardalos, P.M. and Toraldo, G. (1997), Quadratic Programming with box constraints, in I.M. Bomze et al. (eds.), Developments in Global Optimization (pp. 73\u201393), Kluwer Academic Publishers, Dordrecht, Boston, London."},{"key":"160332_CR9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"C. Delorme","year":"1993","unstructured":"Delorme, C. and Poljak, S. (1993), Laplacian eigenvalues and the maximum cut problem, Mathematical Programming 62: 557\u2013574.","journal-title":"Mathematical Programming"},{"key":"160332_CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T. Fujie","year":"1997","unstructured":"Fujie, T. and Kojima, M. (1997), Semidefinite programming relaxation for nonconvex quadratic programs, Journal of Global Optimization 10: 367\u2013380.","journal-title":"Journal of Global Optimization"},{"key":"160332_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. (1993), Global minimization of indefinite quadratic functions subject to box constraints, Naval Research Logistics Quarterly 40: 373\u2013392.","journal-title":"Naval Research Logistics Quarterly"},{"key":"160332_CR12","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1137\/0806020","volume":"6","author":"C. Helmberg","year":"1996","unstructured":"Helmberg, C., Rendl, F., Vanderbei, R.J. and Wolkowicz, H. (1996), An interior-point method for semidefinite programming, SIAM Journal on Optimization 6: 342\u2013361.","journal-title":"SIAM Journal on Optimization"},{"key":"160332_CR13","unstructured":"Helmberg, C. and Rendl, F. (1995), Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, ZIB Preprint SC\u201395-35."},{"key":"160332_CR14","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. and Bagchi, A. (1990), An algorithm for quadratic zero\u2013one programs, Naval Research Logistics Quarterly 37: 527\u2013538.","journal-title":"Naval Research Logistics Quarterly"},{"key":"160332_CR15","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1137\/S1052623494269035","volume":"7","author":"M. Kojima","year":"1997","unstructured":"Kojima, M., Shindoh, S. and Hara, S. (1997), Interior-point methods for the monotone linear complementarity problem in symmetric matrices, SIAM Journal on Optimization 7: 86\u2013125.","journal-title":"SIAM Journal on Optimization"},{"key":"160332_CR16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"M. Padberg","year":"1989","unstructured":"Padberg, M. (1989), The Boolean quadric polytope: Some characteristics, facets and relatives, Mathematical Programming 45: 139\u2013172.","journal-title":"Mathematical Programming"},{"key":"160332_CR17","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P.M. Pardalos","year":"1990","unstructured":"Pardalos, P.M. and Rodgers, G.P. (1990), Computational aspects of a branch and bound algorithm for quadratic zero\u2013one programming, Computing 45: 131\u2013144.","journal-title":"Computing"},{"key":"160332_CR18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P.M. Pardalos","year":"1991","unstructured":"Pardalos, P.M. and Vavasis, S.A. (1991), Quadratic programming with one negative eigenvalue is NP\u2013hard, Journal of Global Optimization 1: 15\u201322.","journal-title":"Journal of Global Optimization"},{"key":"160332_CR19","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0166-218X(94)00155-7","volume":"62","author":"S. Poljak","year":"1995","unstructured":"Poljak, S. and Rendl, F. (1995), Solving the max\u2013cut problem using eigenvalues, Discrete Applied Mathematics 62: 249\u2013278.","journal-title":"Discrete Applied Mathematics"},{"key":"160332_CR20","volume-title":"An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems","author":"M. Ramana","year":"1993","unstructured":"Ramana, M. (1993), An Algorithmic Analysis of Multiquadratic and Semidefinite Programming Problems, PhD thesis, Johns Hopkins University, Baltimore, MD."},{"key":"160332_CR21","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/BF02283695","volume":"25","author":"H. Sherali","year":"1990","unstructured":"Sherali, H. and Alameddine, A. (1990), An explicit characterization of the convex envelope of a bivariate bilinear function over special polytopes, Annals of Operations Research 25: 197\u2013214.","journal-title":"Annals of Operations Research"},{"key":"160332_CR22","first-page":"397","volume":"2","author":"H. Sherali","year":"1992","unstructured":"Sherali, H. and Alameddine, A. (1992), A new reformulation\u2013linearization for solving bilinear programming problems, Journal of Global Optimization 2: 397\u2013410.","journal-title":"Journal of Global Optimization"},{"key":"160332_CR23","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0167-6377(94)00065-E","volume":"17","author":"H. Sherali","year":"1995","unstructured":"Sherali, H., Lee, Y. and Adams, W.P. (1995), A simultaneous lifting strategy for identifying new class of facets for Boolean quadric polytope, Operations Research Letters 17: 19\u201326.","journal-title":"Operations Research Letters"},{"key":"160332_CR24","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"H. Sherali","year":"1995","unstructured":"Sherali, H. and Tuncbilek, C.H. (1995), A reformulation\u2013convexification approach for solving nonconvex quadratic programming problems, Journal of Global Optimization 7: 1\u201331.","journal-title":"Journal of Global Optimization"},{"key":"160332_CR25","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C.D. Simone","year":"1989","unstructured":"Simone, C.D. (1989), The cut polytope and the Boolean quadric polytope, Discrete Mathematics 79: 71\u201375.","journal-title":"Discrete Mathematics"},{"key":"160332_CR26","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"S.A. Vavasis","year":"1992","unstructured":"Vavasis, S.A. (1992), Approximate algorithms for indefinite quadratic programming, Mathematical Programming 57: 279\u2013311.","journal-title":"Mathematical Programming"},{"key":"160332_CR27","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"Y. Ye","year":"1992","unstructured":"Ye, Y. (1992), On the affine scaling algorithm for nonconvex quadratic programming, Mathematical Programming 56: 285\u2013300.","journal-title":"Mathematical Programming"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008293029350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008293029350\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008293029350.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T10:39:46Z","timestamp":1751366386000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008293029350"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,9]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,9]]}},"alternative-id":["160332"],"URL":"https:\/\/doi.org\/10.1023\/a:1008293029350","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,9]]}}}