{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:02:49Z","timestamp":1742929369016,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319317687"},{"type":"electronic","value":"9783319317694"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.5\/"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.5\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-31769-4_15","type":"book-chapter","created":{"date-parts":[[2016,4,9]],"date-time":"2016-04-09T01:05:44Z","timestamp":1460163944000},"page":"180-198","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Bernstein Branch-and-Bound Unconstrained Global Optimization Algorithm for MINLP Problems"],"prefix":"10.1007","author":[{"given":"Bhagyesh V.","family":"Patil","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. S. V.","family":"Nataraj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,4,9]]},"reference":[{"unstructured":"The Mathworks Inc., MATLAB version 7.1 (R14), Natick, MA (2005)","key":"15_CR1"},{"issue":"2","key":"15_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L.T., Conn, A., Cornuejols, G., Grossmann, I.E., Laird, C., Lee, J., Lodi, A., Margot, F., Sawaya, N., W\u00e4chter, A.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-07557-0_17","volume-title":"Integer Programming and Combinatorial Optimization","author":"C Buchheim","year":"2014","unstructured":"Buchheim, C., D\u2019Ambrosio, C.: Box-constrained mixed-integer polynomial optimization using separable underestimators. In: Lee, J., Vygen, J. (eds.) IPCO 2014. LNCS, vol. 8494, pp. 198\u2013209. Springer, Heidelberg (2014)"},{"issue":"1","key":"15_CR4","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. Ann. Oper. Res. 204(1), 301\u2013320 (2013)","journal-title":"Ann. Oper. Res."},{"key":"15_CR5","doi-asserted-by":"publisher","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)"},{"unstructured":"GAMS Development Corp.: GAMS-The solver manuals, Washington, DC (2009)","key":"15_CR6"},{"key":"15_CR7","first-page":"154","volume":"2","author":"J Garloff","year":"1993","unstructured":"Garloff, J.: The Bernstein algorithm. Interval Comput. 2, 154\u2013168 (1993)","journal-title":"Interval Comput."},{"key":"15_CR8","volume-title":"Global Optimization Using Interval Analysis","author":"E Hansen","year":"2004","unstructured":"Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis. CRC Press, New York (2004)"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s11633-007-0342-7","volume":"4","author":"PSV Nataraj","year":"2007","unstructured":"Nataraj, P.S.V., Arounassalame, M.: A new subdivision algorithm for the Bernstein polynomial approach to global optimization. Int. J. Autom. Comput. 4(4), 342\u2013352 (2007)","journal-title":"Int. J. Autom. Comput."},{"issue":"2","key":"15_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/s10898-009-9485-0","volume":"49","author":"PSV Nataraj","year":"2011","unstructured":"Nataraj, P.S.V., Arounassalame, M.: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. J. Glob. Optim. 49(2), 185\u2013212 (2011)","journal-title":"J. Glob. Optim."},{"issue":"2\u20134","key":"15_CR11","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":"2","key":"15_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/BF01097060","volume":"7","author":"D Ratz","year":"1995","unstructured":"Ratz, D., Csendes, T.: On the selection of subdivision directions in interval branch-and-bound methods for global optimization. J. Glob. Optim. 7(2), 183\u2013207 (1995)","journal-title":"J. Glob. Optim."},{"unstructured":"Stahl, V.: Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. Ph.D. thesis, Johannes Kepler University, Linz (1995)","key":"15_CR13"},{"key":"15_CR14","series-title":"Nonconvex Optimization and its Applications","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3532-1","volume-title":"Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convexification and Global Optimization in Continuous and Mixed-Integer Nonlinear Programming: Theory, Algorithms, Software, and Applications. Nonconvex Optimization and its Applications. Kluwer Academic Publishers, Dordrecht (2002)"},{"unstructured":"Verschelde, J.: PHC pack, the database of polynomial systems. Technical report, Mathematics Department, University of Illinois, Chicago, USA (2001)","key":"15_CR15"}],"container-title":["Lecture Notes in Computer Science","Scientific Computing, Computer Arithmetic, and Validated Numerics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-31769-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,28]],"date-time":"2025-01-28T19:12:09Z","timestamp":1738091529000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-31769-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319317687","9783319317694"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-31769-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}