{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T21:53:04Z","timestamp":1759701184995,"version":"3.38.0"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"2-4","license":[{"start":{"date-parts":[[2011,11,23]],"date-time":"2011-11-23T00:00:00Z","timestamp":1322006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[2012,3]]},"DOI":"10.1007\/s00607-011-0175-7","type":"journal-article","created":{"date-parts":[[2011,11,22]],"date-time":"2011-11-22T03:54:10Z","timestamp":1321934050000},"page":"325-343","source":"Crossref","is-referenced-by-count":22,"title":["Global optimization of mixed-integer nonlinear (polynomial) programming problems: the Bernstein polynomial approach"],"prefix":"10.1007","volume":"94","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"}]},{"given":"Sharad","family":"Bhartiya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,11,23]]},"reference":[{"key":"175_CR1","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 CA (1995) Nonlinear and mixed-integer optimization: fundamentals and applications. Oxford University Press, New York"},{"issue":"3","key":"175_CR2","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA Duran","year":"1986","unstructured":"Duran MA, Grossmann IE (1986) An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math Program 36(3): 307\u2013339","journal-title":"Math Program"},{"issue":"1-3","key":"175_CR3","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R Fletcher","year":"1994","unstructured":"Fletcher R, Leyffer S (1994) Solving mixed-integer programs by outer approximation. Math Program 66(1-3): 327\u2013349","journal-title":"Math Program"},{"issue":"4","key":"175_CR4","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"AM Geoffrion","year":"1972","unstructured":"Geoffrion AM (1972) A generalized Benders decomposition. J Optim Theory Appl 10(4): 237\u2013260","journal-title":"J Optim Theory Appl"},{"issue":"12","key":"175_CR5","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"OK Gupta","year":"1985","unstructured":"Gupta OK, Ravindran A (1985) Branch and bound experiments in convex nonlinear integer programming. Manag Sci 31(12): 1533\u20131546","journal-title":"Manag Sci"},{"issue":"10\u201311","key":"175_CR6","doi-asserted-by":"crossref","first-page":"937","DOI":"10.1016\/0098-1354(92)80028-8","volume":"16","author":"I Quesada","year":"1992","unstructured":"Quesada I, Grossmann IE (1992) An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput Chem Eng 16(10\u201311): 937\u2013947","journal-title":"Comput Chem Eng"},{"key":"175_CR7","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0098-1354(95)87027-X","volume":"19","author":"T Westerlund","year":"1995","unstructured":"Westerlund T, Pettersson F (1995) A extended cutting plane method for solving convex MINLP problems. Comput Chem Eng 19: 131\u2013136","journal-title":"Comput Chem Eng"},{"unstructured":"GAMS Development Corp (2009) GAMS\u2014the solver manuals. Washington, DC","key":"175_CR8"},{"unstructured":"Leyffer S (1999) User manual for MINLP_BB. University of Dundee numerical analysis report NA\/XXX","key":"175_CR9"},{"issue":"2","key":"175_CR10","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami P, Biegler LT, Conn A, Cornu\u00e9jols G, Grossmann IE, Laird C, Lee J, Lodi A, Margot F, Sawaya N, W\u00e4chter A (2008) An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim 5(2): 186\u2013204","journal-title":"Discrete Optim"},{"unstructured":"SCICON Ltd (1989) SCICONIC user guide version 1.40. Milton Keynes, UK","key":"175_CR11"},{"key":"175_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/3-7643-7374-1","volume-title":"Relaxation and decomposition methods for mixed-integer nonlinear programming","author":"I Nowak","year":"2005","unstructured":"Nowak I (2005) Relaxation and decomposition methods for mixed-integer nonlinear programming. Birkh\u00e4user Verlag, Berlin"},{"key":"175_CR13","first-page":"S427","volume":"21","author":"A Vecchietti","year":"1997","unstructured":"Vecchietti A, Grossmann IE (1997) LOGMIP: a disjunctive 0-1 nonlinear optimizer for process system models. Comput Chem Eng 21: S427\u2013S432","journal-title":"Comput Chem Eng"},{"unstructured":"Lindo systems Inc (2009) Lindo API 6.0","key":"175_CR14"},{"issue":"4-5","key":"175_CR15","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti P, Lee J, Liberti L, Margot F, W\u00e4chter A (2009) Branching and bounds tightening techniques for non-convex MINLP. Optim Methods Softw 24(4-5): 597\u2013634","journal-title":"Optim Methods Softw"},{"key":"175_CR16","doi-asserted-by":"crossref","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 (nonconvex optimization and its applications)","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani M, Sahinidis NV (2002) Convexification and global optimization in continuous and mixed-integer nonlinear programming: theory, algorithms, software, and applications (nonconvex optimization and its applications). Kluwer, Dordrecht"},{"issue":"4","key":"175_CR17","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1023\/A:1021296315884","volume":"24","author":"PSV Nataraj","year":"2002","unstructured":"Nataraj PSV, Kotecha K (2002) An algorithm for global optimization using Taylor-Bernstein form as inclusion function. J Glob Optim 24(4): 417\u2013436","journal-title":"J Glob Optim"},{"issue":"1","key":"175_CR18","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1023\/B:REOM.0000003995.08805.2a","volume":"10","author":"PSV Nataraj","year":"2004","unstructured":"Nataraj PSV, Kotecha K (2004) Global optimization with higher order inclusion function forms. Part 1: a combined Taylor-Bernstein form. Reliab Comput 10(1): 27\u201344","journal-title":"Reliab Comput"},{"issue":"4","key":"175_CR19","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s11633-007-0342-7","volume":"4","author":"PSV Nataraj","year":"2007","unstructured":"Nataraj PSV, Arounassalame M (2007) A new subdivision algorithm for the Bernstein polynomial approach to global optimization. Int J Autom Comput 4(4): 342\u2013352","journal-title":"Int J Autom Comput"},{"issue":"2","key":"175_CR20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s12597-009-0009-y","volume":"46","author":"PSV Nataraj","year":"2009","unstructured":"Nataraj PSV, Arounassalame M (2009) An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions. Opsearch 46(2): 133\u2013152","journal-title":"Opsearch"},{"issue":"3","key":"175_CR21","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10898-008-9382-y","volume":"45","author":"S Ray","year":"2009","unstructured":"Ray S, Nataraj PSV (2009) An efficient algorithm for range computation of polynomials using the Bernstein form. J Glob Optim 45(3): 403\u2013426","journal-title":"J Glob Optim"},{"unstructured":"MINLP Library. http:\/\/www.gamsworld.org\/minlp\/minlplib\/minlpstat.htm . Accessed 20 March 2010","key":"175_CR22"},{"issue":"1","key":"175_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.jcss.2004.07.002","volume":"70","author":"W Zhu","year":"2005","unstructured":"Zhu W (2005) A provable better branch and bound method for a nonconvex integer quadratic programming problem. J Comput Syst Sci 70(1): 107\u2013117","journal-title":"J Comput Syst Sci"},{"issue":"2","key":"175_CR24","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/j.cam.2005.08.037","volume":"199","author":"Y Lebbah","year":"2007","unstructured":"Lebbah Y, Michel C, Rueher M (2007) An efficient and safe framework for solving optimization problems. J Comput Appl Math 199(2): 372\u2013377","journal-title":"J Comput Appl Math"},{"unstructured":"Ray S (2007) A new approach to range computation of polynomial problems using the Bernstein form. PhD thesis, Indian Institute of Technology Bombay, India","key":"175_CR25"},{"unstructured":"Garloff J (1985) Convergent bounds for range of multivariate polynomials. In: Nickel K (ed) Interval mathematics. Lecturer notes in computer science, vol 212. Springer, Berlin, pp 37\u201356","key":"175_CR26"},{"issue":"10","key":"175_CR27","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/S0010-4485(03)00021-6","volume":"35","author":"J S\u00e0nchez-Reyes","year":"2003","unstructured":"S\u00e0nchez-Reyes J (2003) Algebraic manipulation in the Bernstein form made simple via convolutions. Computer-Aided Des 35(10): 959\u2013967","journal-title":"Computer-Aided Des"},{"doi-asserted-by":"crossref","unstructured":"Garczarczyk ZA (2002) Parallel schemes of computation for Bernstein coefficients and their application. In: Proceedings of the international conference on parallel computing in electrical engineering, pp 334\u2013337, Warsaw, Poland","key":"175_CR28","DOI":"10.1109\/PCEE.2002.1115288"},{"issue":"2\u20133","key":"175_CR29","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10898-007-9195-4","volume":"43","author":"AP Smith","year":"2009","unstructured":"Smith AP (2009) Fast construction of constant bound functions for sparse polynomials. J Glob Optim 43(2\u20133): 445\u2013458","journal-title":"J Glob Optim"},{"issue":"2","key":"175_CR30","first-page":"154","volume":"6","author":"J Garloff","year":"1993","unstructured":"Garloff J (1993) The Bernstein algorithm. Interval Comput 6(2): 154\u2013168","journal-title":"Interval Comput"},{"key":"175_CR31","volume-title":"New computer methods for global optimization","author":"H Ratschek","year":"1988","unstructured":"Ratschek H, Rokne J (1988) New computer methods for global optimization. Ellis Horwood, Chichester"},{"issue":"3","key":"175_CR32","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1021047328089","volume":"3","author":"JP Goux","year":"2002","unstructured":"Goux JP, Leyffer S (2002) Solving large MINLPs on computational grids. Optim Eng 3(3): 327\u2013346","journal-title":"Optim Eng"},{"issue":"2","key":"175_CR33","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"JT Linderoth","year":"1999","unstructured":"Linderoth JT, Savelsbergh MWP (1999) A computational study of search strategies for mixed integer programming. INFORMS J Comput 11(2): 173\u2013187","journal-title":"INFORMS J Comput"},{"issue":"1","key":"175_CR34","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg T, Koch T, Martin A (2005) Branching rules revisited. Oper Res Lett 33(1): 42\u201354","journal-title":"Oper Res Lett"},{"unstructured":"NEOS server for optimization. http:\/\/www.neos-server.org\/neos\/solvers\/index.html . Accessed 20 March 2010","key":"175_CR35"},{"unstructured":"Kuipers K (2009) Branch-and-bound solver for mixed-integer nonlinear optimization problems. MATLAB Central File Exchange. Retrieved 18 Dec 2009","key":"175_CR36"},{"unstructured":"The Mathworks Inc (2005) MATLAB version 7.1 (R14)","key":"175_CR37"},{"key":"175_CR38","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970906","volume-title":"Methods and applications of interval analysis","author":"RE Moore","year":"1979","unstructured":"Moore RE (1979) Methods and applications of interval analysis. SIAM, Philadelphia"},{"unstructured":"Stahl V (1995) Interval methods for bounding the range of polynomials and solving systems of nonlinear equations. PhD thesis, Johannes Kepler University, Linz","key":"175_CR39"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-011-0175-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00607-011-0175-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00607-011-0175-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,14]],"date-time":"2025-03-14T09:08:44Z","timestamp":1741943324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00607-011-0175-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,23]]},"references-count":39,"journal-issue":{"issue":"2-4","published-print":{"date-parts":[[2012,3]]}},"alternative-id":["175"],"URL":"https:\/\/doi.org\/10.1007\/s00607-011-0175-7","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"type":"print","value":"0010-485X"},{"type":"electronic","value":"1436-5057"}],"subject":[],"published":{"date-parts":[[2011,11,23]]}}}