{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T22:54:06Z","timestamp":1758840846325},"reference-count":12,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2011,1,5]],"date-time":"2011-01-05T00:00:00Z","timestamp":1294185600000},"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":[[2011,11]]},"DOI":"10.1007\/s10898-010-9639-0","type":"journal-article","created":{"date-parts":[[2011,1,4]],"date-time":"2011-01-04T14:40:43Z","timestamp":1294152043000},"page":"377-393","source":"Crossref","is-referenced-by-count":6,"title":["Combined bound-grid-factor constraints for enhancing RLT relaxations for polynomial programs"],"prefix":"10.1007","volume":"51","author":[{"given":"Hanif D.","family":"Sherali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Evrim","family":"Dalkiran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,1,5]]},"reference":[{"issue":"1","key":"9639_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1137\/S0036144504446096","volume":"47","author":"P.E. Gill","year":"2005","unstructured":"Gill P.E., Murray W., Saunders M.A.: SNOPT: an SQP algorithm for large-scale constrained optimization. SIAM Rev. 47(1), 99\u2013131 (2005)","journal-title":"SIAM Rev."},{"issue":"1","key":"9639_CR2","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"G.P. McCormick","year":"1976","unstructured":"McCormick G.P.: Computability of global solutions to factorable nonconvex programs: part I\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"2","key":"9639_CR3","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1007\/s11590-009-0156-3","volume":"4","author":"R. Paulavi\u010dius","year":"2010","unstructured":"Paulavi\u010dius R., \u017dilinskas J., Grothey A.: Investigation of selection strategies in branch and bound algorithm with simplicial partitions and combination of Lipschitz bounds. Optim. Lett. 4(2), 173\u2013183 (2010)","journal-title":"Optim. Lett."},{"key":"9639_CR4","unstructured":"Sahinidis, N.V., Tawarmalani, M.: BARON 9.0.6: global optimization of mixed-integer nonlinear programs. User\u2019s manual. In: http:\/\/www.gams.com\/dd\/docs\/solvers\/baron.pdf (2010)"},{"key":"9639_CR5","unstructured":"Sherali, H.D., Dalkiran, E., Desai, J.: Enhancing RLT-Based Relaxations for Polynomial Programming Problems Via a New Class of v-Semidefinite Cuts. Manuscript, Grado Department of Industrial and Systems Engineering, Virginia Polytechnic and State University, Blacksburg, VA"},{"issue":"1","key":"9639_CR6","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF00121304","volume":"2","author":"H.D. Sherali","year":"1992","unstructured":"Sherali H.D., Tuncbilek C.H.: A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique. J. Global Optim. 2(1), 101\u2013112 (1992)","journal-title":"J. Global Optim."},{"issue":"4","key":"9639_CR7","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1023\/A:1008237515535","volume":"10","author":"H.D. Sherali","year":"1997","unstructured":"Sherali H.D., Tuncbilek C.H.: Comparison of two reformulation-linearization technique based linear programming relaxations for polynomial programming problems. J. Global Optim. 10(4), 381\u2013390 (1997)","journal-title":"J. Global Optim."},{"issue":"1","key":"9639_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(97)00013-8","volume":"21","author":"H.D. Sherali","year":"1997","unstructured":"Sherali H.D., Tuncbilek C.H.: New reformulation linearization\/convexification relaxations for univariate and multivariate polynomial programming problems. Oper. Res. Lett. 21(1), 1\u20139 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"9639_CR9","doi-asserted-by":"crossref","first-page":"459","DOI":"10.1007\/PL00011409","volume":"89","author":"H.D. Sherali","year":"2001","unstructured":"Sherali H.D., Wang H.: Global optimization of nonconvex factorable programming problems. Math. Program. 89(3), 459\u2013478 (2001)","journal-title":"Math. Program."},{"key":"9639_CR10","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"N.Z. Shor","year":"1990","unstructured":"Shor N.Z.: Dual quadratic estimates in polynomial and Boolean programming. Ann. Oper. Res. 25, 163\u2013168 (1990)","journal-title":"Ann. Oper. Res."},{"issue":"3","key":"9639_CR11","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","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. 99(3), 563\u2013591 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"9639_CR12","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M. Tawarmalani","year":"2005","unstructured":"Tawarmalani M., Sahinidis N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103(2), 225\u2013249 (2005)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9639-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-010-9639-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-010-9639-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:58:57Z","timestamp":1559278737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-010-9639-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,1,5]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9639"],"URL":"https:\/\/doi.org\/10.1007\/s10898-010-9639-0","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,1,5]]}}}