{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:17:05Z","timestamp":1743059825315,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319328584"},{"type":"electronic","value":"9783319328591"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32859-1_48","type":"book-chapter","created":{"date-parts":[[2016,4,15]],"date-time":"2016-04-15T15:12:06Z","timestamp":1460733126000},"page":"560-575","source":"Crossref","is-referenced-by-count":0,"title":["The Bernstein Branch-and-Prune Algorithm for Constrained Global Optimization of Multivariate Polynomial MINLPs"],"prefix":"10.1007","author":[{"given":"Bhagyesh V.","family":"Patil","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,16]]},"reference":[{"key":"48_CR1","unstructured":"The Mathworks Inc., MATLAB version 7.1 (R14), Natick, MA (2005)"},{"issue":"1","key":"48_CR2","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10479-012-1272-5","volume":"204","author":"C D\u2019Ambrosio","year":"2013","unstructured":"D\u2019Ambrosio, C., Lodi, A.: Mixed integer nonlinear programming tools: an updated practical overview. Annals of Operations Research 204(1), 301\u2013320 (2013)","journal-title":"Annals of Operations Research"},{"key":"48_CR3","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"CA Floudas","year":"1995","unstructured":"Floudas, C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, New York (1995)"},{"key":"48_CR4","first-page":"154","volume":"2","author":"J Garloff","year":"1993","unstructured":"Garloff, J.: The Bernstein algorithm. Interval Computations 2, 154\u2013168 (1993)","journal-title":"Interval Computations"},{"key":"48_CR5","volume-title":"Global Optimization Using Interval Analysis","author":"ER Hansen","year":"2005","unstructured":"Hansen, E.R., Walster, G.W.: Global Optimization Using Interval Analysis, 2nd edn. Marcel Dekker, New York (2005)","edition":"2"},{"key":"48_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033036","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J Hooker","year":"2000","unstructured":"Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction. Wiley, New York (2000)"},{"key":"48_CR7","unstructured":"Kuipers, K.: Branch-and-bound solver for mixed-integer nonlinear optimization problems. MATLAB Central for File Exchange. Accessed 18 Dec. 2009"},{"key":"48_CR8","unstructured":"GAMS Minlp Model Library: http:\/\/www.gamsworld.org\/minlp\/minlplib\/minlpstat.htm . Accessed 20 March 2015"},{"issue":"2","key":"48_CR9","first-page":"109","volume":"15","author":"PSV Nataraj","year":"2011","unstructured":"Nataraj, P.S.V., Arounassalame, M.: An interval Newton method based on the Bernstein form for bounding the zeros of polynomial systems. Reliable Comput. 15(2), 109\u2013119 (2011)","journal-title":"Reliable Comput."},{"key":"48_CR10","unstructured":"NEOS server for optimization.: http:\/\/www.neos-server.org\/neos\/solvers\/index.html . Accessed 20 March 2015"},{"issue":"3\u20134","key":"48_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11786-014-0198-5","volume":"8","author":"BV Patil","year":"2014","unstructured":"Patil, B.V., Nataraj, P.S.V.: An improved Bernstein global optimization algorithm for MINLP problems with application in process industry. Math. Comput. Sci. 8(3\u20134), 357\u2013377 (2014)","journal-title":"Math. Comput. Sci."},{"issue":"2\u20134","key":"48_CR12","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1007\/s00607-011-0175-7","volume":"94","author":"BV Patil","year":"2012","unstructured":"Patil, B.V., Nataraj, P.S.V., Bhartiya, S.: Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach. Computing 94(2\u20134), 325\u2013343 (2012)","journal-title":"Computing"},{"issue":"1","key":"48_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/j.jcss.2004.07.002","volume":"70","author":"W Zhu","year":"2005","unstructured":"Zhu, W.: A provable better branch and bound method for a nonconvex integer quadratic programming problem. J. Comput. Syst. Sci. 70(1), 107\u2013117 (2005)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Mathematical Aspects of Computer and Information Sciences"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-32859-1_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,17]],"date-time":"2022-06-17T22:56:55Z","timestamp":1655506615000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32859-1_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319328584","9783319328591"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32859-1_48","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}