{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:18:32Z","timestamp":1780345112251,"version":"3.54.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1995,7,1]],"date-time":"1995-07-01T00:00:00Z","timestamp":804556800000},"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":[[1995,7]]},"DOI":"10.1007\/bf01100203","type":"journal-article","created":{"date-parts":[[2005,2,5]],"date-time":"2005-02-05T11:03:01Z","timestamp":1107601381000},"page":"1-31","source":"Crossref","is-referenced-by-count":136,"title":["A reformulation-convexification approach for solving nonconvex quadratic programming problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cihan H.","family":"Tuncbilek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1287\/moor.8.2.273","volume":"8","author":"F. A. Al-Khayyal","year":"1983","unstructured":"Al-Khayyal, F. A. and J. E. Falk (1983), Jointly Constrained Biconvex Programming,Math, of Oper. Res. 8, 273?286.","journal-title":"Math, of Oper. Res."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02283693","volume":"25","author":"F. A. Al-Khayyal","year":"1990","unstructured":"Al-Khayyal, F. A. and C. Larson (1990), Global Minimization of a Quadratic Function Subject to a Bounded Mixed Integer Constraint Set,Annals of Operations Research 25, 169?180.","journal-title":"Annals of Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1137\/0128029","volume":"28","author":"E. Balas","year":"1975","unstructured":"Balas, E. (1975), Nonconvex Quadratic Programming via Generalized Polars,SIAM Journal on Applied Math. 28, 335?349.","journal-title":"SIAM Journal on Applied Math."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/S0304-0208(08)72394-6","volume-title":"Fermat Days 85: Mathematics for Optimization","author":"R. Benacer","year":"1986","unstructured":"Benacer, R. and PhamDinh, Tao (1986), Global Maximization of a Nondefinite Quadratic Function over a Convex Polyhedron, pp. 65?76, inFermat Days 85: Mathematics for Optimization, J. B. Hiriart-Urruty (ed.), North-Holland, Amsterdam."},{"key":"CR5","first-page":"1","volume":"1","author":"I. M. Bomze","year":"1992","unstructured":"Bomze, I. M. (1992), Copositivity Conditions for Global Optimality Indefinite Quadratic Programming Problems,Czechoslovak Journal for Operations Research 1, 1?19.","journal-title":"Czechoslovak Journal for Operations Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M. L. Fisher","year":"1981","unstructured":"Fisher, M. L. (1981), The Lagrangian Relaxation Methods for Solving Integer Programming Problems,Management Science 27, 1?18.","journal-title":"Management Science"},{"key":"CR7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","author":"C. A. Floudas","year":"1990","unstructured":"Floudas, C. A. and P. M. Parsalos (1990),A Collection of Test Problems for Constrained Global Optimization Algorithms, Springer-Verlag, Berlin."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"1419","DOI":"10.1016\/0098-1354(90)80020-C","volume":"14","author":"C. A. Floudas","year":"1990","unstructured":"Floudas, C. A. and V. Visweswaran (1990), A Global Optimization Algorithm (GOP) for Certain Classes of Nonconvex NLP's-1. Theory,Computers and Chemical Engineering 14, 1419.","journal-title":"Computers and Chemical Engineering"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF00939667","volume":"78","author":"C. A. Floudas","year":"1993","unstructured":"Floudas, C. A. and V. Visweswaran (1993), A Primal-Relaxed Dual Global Optimization Approach: Theory,JOTA 78, 187?225.","journal-title":"JOTA"},{"key":"CR10","volume-title":"Matrix Computations","author":"G. H. Golub","year":"1989","unstructured":"Golub, G. H. and C. F. Van Loan (1989),Matrix Computations, Second Edition, The Johns Hopkins University Press, Baltimore.","edition":"Second Edition"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M. Guignard","year":"1987","unstructured":"Guignard, M. and S. Kim (1987), Lagrangian Decomposition: A Model Yielding Stronger Lagrangian Bounds,Mathematical Programming 39, 215?228.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF01582889","volume":"52","author":"P. Hansen","year":"1991","unstructured":"Hansen, P., B. Jaumard, and S. Lu (1991), An Analytical Approach to Global Optimization,Math. Programming 52, 227?254.","journal-title":"Math. Programming"},{"key":"CR13","doi-asserted-by":"crossref","unstructured":"Kough, P. F., The Indefinite Quadratic Programming Problem,Operations Research 27(3), 516?533.","DOI":"10.1287\/opre.27.3.516"},{"key":"CR14","volume-title":"Research Report","author":"T. Larsson","year":"1989","unstructured":"Larsson, T. and Z. Liu (1989), A Primal Convergence Result for Dual Subgradient Optimization with Applications to Multicommunity Network Flows, Research Report, Department of Mathematics, Linkoping Institute of Technology, S-581 83, Linkoping, Sweden."},{"issue":"2","key":"CR15","first-page":"202","volume":"4","author":"M. Manas","year":"1968","unstructured":"Manas, M. (1968), An Algorithm for a Nonconvex Programming Problem,Econ Math Obzor Acad. Nad. Ceskoslov 4(2), 202?212.","journal-title":"Econ Math Obzor Acad. Nad. Ceskoslov"},{"key":"CR16","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/BF01580731","volume":"40","author":"G. G. Meyer","year":"1988","unstructured":"Meyer, G. G. (1988), Convergence of Relaxation Algorithms by Averaging,Mathematical Programming 40, 205?212.","journal-title":"Mathematical Programming"},{"issue":"5","key":"CR17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/mnsc.16.5.333","volume":"16","author":"R. K. Mueller","year":"1970","unstructured":"Mueller, R. K. (1970), A Method for Solving the Indefinite Quadratic Programming Problem,Management Science 16(5), 333?339.","journal-title":"Management Science"},{"key":"CR18","volume-title":"Technical Report Sol 83-20R","author":"B. A. Murtagh","year":"1987","unstructured":"Murtagh, B. A. and M. A. Saunders (1987), MINOS 5.1 User's Guide, Technical Report Sol 83-20R, Systems Optimization Laboratory, Department of Operations Research, Stanford University, Stanford, California."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1016\/0167-6377(91)90004-9","volume":"10","author":"L. D. Muu","year":"1991","unstructured":"Muu, L. D. and W. Oettli (1991), An Algorithm for Indefinite Quadratic Programming with Convex Constraints,Operations Research Letters 10, 323?327.","journal-title":"Operations Research Letters"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0898-1221(91)90163-X","volume":"21","author":"P. M. Pardalos","year":"1991","unstructured":"Pardalos, P. M. (1991), Global Optimization Algorithms for Linearly Constrained Indefinite Quadratic Programs,Computers Math. Applic. 21, 87?97.","journal-title":"Computers Math. Applic."},{"key":"CR21","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1007\/BF02239972","volume":"39","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M., J. H. Glick, and J. B., Rosen (1987), Global Minimization of Indefinite Quadratic Problems,Computing 39, 281?291.","journal-title":"Computing"},{"key":"CR22","doi-asserted-by":"crossref","DOI":"10.1007\/BFb0000035","volume-title":"Constrained Global Optimization: Algorithms and Applications","author":"P. M. Pardalos","year":"1987","unstructured":"Pardalos, P. M. and J. B. Rosen (1987),Constrained Global Optimization: Algorithms and Applications, Springer-Verlag, Berlin."},{"key":"CR23","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1007\/BF00120662","volume":"1","author":"P. M. Pardalos","year":"1991","unstructured":"Pardalos, P. M. and S. A. Vavasis (1991), Quadratic Programming with One Negative Eigenvalue Is NP-Hard,Journal of Global Optimization 1, 15?22.","journal-title":"Journal of Global Optimization"},{"key":"CR24","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1002\/1520-6750(199008)37:4<499::AID-NAV3220370405>3.0.CO;2-9","volume":"37","author":"A. T. Phillips","year":"1990","unstructured":"Phillips, A. T. and J. B. Rosen (1990), Guaranteed?-Approximate Solution for Indefinite Quadratic Global Minimization,Naval Research Logistics 37, 499?514.","journal-title":"Naval Research Logistics"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1007\/BF00539118","volume":"4","author":"K. Ritter","year":"1966","unstructured":"Ritter, K. (1966), A Method for Solving Maximum Problems with a Nonconcave Quadratic Objective Function,Z. Wahrscheinlichkeitstheorie,4, 340?351.","journal-title":"Z. Wahrscheinlichkeitstheorie"},{"issue":"3","key":"CR26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF00122429","volume":"2","author":"H. D. Sherali","year":"1992","unstructured":"Sherali, H. D. and A. R. Alameddine (1992), A New Reformulation-Linearization Technique for Bilinear Programming Problems,Journal of Global Optimization 2(3), 379?410.","journal-title":"Journal of Global Optimization"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02739234","volume":"5","author":"H. D. Sherali","year":"1985\/6","unstructured":"Sherali, H. D. and D. C. Myers (1985\/6), The Design of Branch and Bound Algorithms for a Class of Nonlinear Integer Programs,Annals of Oper. Res. 5, 463?484.","journal-title":"Annals of Oper. Res."},{"key":"CR28","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H. D. Sherali","year":"1992","unstructured":"Sherali, H. D. and C. H. Tuncbilek (1992), A Global Optimization Algorithm for Polynomial Programming Problems Using a Reformulation-Linearization Technique,The Journal of Global Optimization 2, 101?112.","journal-title":"The Journal of Global Optimization"},{"key":"CR29","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01447654","volume":"20","author":"H. D. Sherali","year":"1989","unstructured":"Sherali, H. D. and O. Ulular (1989), A Primal-Dual Conjugate Subgradient Algorithm for Specially Structured Linear and Convex Programming Problems,Appl. Math. Optim. 20, 193?221.","journal-title":"Appl. Math. Optim."},{"key":"CR30","unstructured":"Tuncbilek, C. H. (1994),Polynomial and Indefinite Quadratic Programming Problems: Algorithms and Applications, PhD Dissertation, Industrial and Systems Engineering, Virginia Polytechnic Institute and State University."},{"key":"CR31","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/BFb0121159","volume":"30","author":"H. Tuy","year":"1987","unstructured":"Tuy, H. (1987), Global Minimization of a Difference of Two Convex Functions,Mathematical Programming Study 30, 150?182.","journal-title":"Mathematical Programming Study"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF01581085","volume":"57","author":"S. A. Vavasis","year":"1992","unstructured":"Vavasis, S. A. (1992), Approximation Algorithms for Indefinite Quadratic Programming,Mathematical Programming 57, 279?311.","journal-title":"Mathematical Programming"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"439","DOI":"10.1007\/BF01096414","volume":"3","author":"V. Visweswaran","year":"1993","unstructured":"Visweswaran, V. and C. A. Floudas, (1993), New Properties and Computational Improvement of the GOP Algorithm for Problems with Quadratic Objective Function and Constraints,Journal of Global Optimization 3, 439?462.","journal-title":"Journal of Global Optimization"},{"issue":"6","key":"CR34","doi-asserted-by":"crossref","first-page":"1260","DOI":"10.1287\/opre.21.6.1260","volume":"21","author":"P. B. Zwart","year":"1973","unstructured":"Zwart, P. B. (1973), Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms,Operations Research 21(6), 1260?1266.","journal-title":"Operations Research"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01100203.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01100203\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01100203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T13:07:43Z","timestamp":1556716063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01100203"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,7]]},"references-count":34,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,7]]}},"alternative-id":["BF01100203"],"URL":"https:\/\/doi.org\/10.1007\/bf01100203","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,7]]}}}