{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T15:03:19Z","timestamp":1750950199475},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3-4","license":[{"start":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T00:00:00Z","timestamp":1406592000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math.Comput.Sci."],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s11786-014-0198-5","type":"journal-article","created":{"date-parts":[[2014,7,28]],"date-time":"2014-07-28T05:51:39Z","timestamp":1406526699000},"page":"357-377","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An Improved Bernstein Global Optimization Algorithm for MINLP Problems with Application in Process Industry"],"prefix":"10.1007","volume":"8","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":[[2014,7,29]]},"reference":[{"issue":"1","key":"198_CR1","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.: Branching rules revisited. Oper. Res. Lett. 33(1), 42\u201354 (2005)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"198_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1007\/BF01099647","volume":"7","author":"I.P. Androulakis","year":"1995","unstructured":"Androulakis I.P., Maranas C.D., Floudas C.A.: \u03b1-BB: a global optimization method for general constrained nonconvex problems. J. Glob. Optim. 7(4), 337\u2013363 (1995)","journal-title":"J. Glob. Optim."},{"issue":"4\u20135","key":"198_CR3","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.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Method Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Method Softw."},{"issue":"2","key":"198_CR4","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 L.T., Conn A.R., Cornu\u00e9jols G., Grossmann I.E., Laird C.D., 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."},{"issue":"2","key":"198_CR5","first-page":"97","volume":"17","author":"S. Burer","year":"2012","unstructured":"Burer S., Letchford A.N.: Non-convex mixed-integer nonlinear programming: a survey. Surv. Oper. Res. Manag. Sci. 17(2), 97\u2013106 (2012)","journal-title":"Surv. Oper. Res. Manag. Sci."},{"issue":"1","key":"198_CR6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1287\/ijoc.15.1.114.15159","volume":"15","author":"M.R. Bussieck","year":"2003","unstructured":"Bussieck M.R., Drud A.S., Meeraus A.: MINLPLibA collection of test models for mixed-integer nonlinear programming. INFORMS J. Comput. 15(1), 114\u2013119 (2003)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"198_CR7","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"M.A. Duran","year":"1986","unstructured":"Duran M.A., Grossmann I.E.: An outer approximation algorithm for a class of mixed-integer nonlinear programs. Math. Program 36(3), 307\u2013339 (1986)","journal-title":"Math. Program"},{"issue":"1\u20133","key":"198_CR8","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/BF01581153","volume":"66","author":"R. Fletcher","year":"1994","unstructured":"Fletcher R., Leyffer S.: Solving mixed-integer programs by outer approximation. Math. Program 66(1\u20133), 327\u2013349 (1994)","journal-title":"Math. Program"},{"key":"198_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780195100563.001.0001","volume-title":"Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications","author":"C.A. Floudas","year":"1995","unstructured":"Floudas C.A.: Nonlinear and Mixed-Integer Optimization: Fundamentals and Applications. Oxford University Press, New York (1995)"},{"key":"198_CR10","unstructured":"GAMS Development Corporation: GAMS\u2014The Solver Manuals. GAMS Development Corporation, Washington, DC (2009)"},{"key":"198_CR11","doi-asserted-by":"crossref","unstructured":"Garczarczyk, Z.A.: Parallel schemes of computation for Bernstein coefficients and their application. In: Proceedings of the International Conference on Parallel Computing in Electrical Engineering, Warsaw, pp. 334\u2013337 (2002)","DOI":"10.1109\/PCEE.2002.1115288"},{"key":"198_CR12","doi-asserted-by":"crossref","unstructured":"Garloff, J.: Convergent bounds for range of multivariate polynomials, in interval mathematics. In: Nickel, K. (ed.) Lecturer Notes in Computer Science, vol. 212. Springer, Berlin, pp. 37\u201356 (1985)","DOI":"10.1007\/3-540-16437-5_5"},{"issue":"2","key":"198_CR13","first-page":"154","volume":"6","author":"J. Garloff","year":"1993","unstructured":"Garloff J.: The Bernstein algorithm. Interval Comput. 6(2), 154\u2013168 (1993)","journal-title":"Interval Comput."},{"issue":"4","key":"198_CR14","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion A.M.: A generalized Benders decomposition. J. Optim. Theory Appl. 10(4), 237\u2013260 (1972)","journal-title":"J. Optim. Theory Appl."},{"issue":"3","key":"198_CR15","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1023\/A:1021047328089","volume":"3","author":"J.P. Goux","year":"2002","unstructured":"Goux J.P., Leyffer S.: Solving large MINLPs on computational grids. Optim. Eng. 3(3), 327\u2013346 (2002)","journal-title":"Optim. Eng."},{"key":"198_CR16","unstructured":"Gropp, W., More, J.: Optimization environments and the NEOS server. In: Buhmann, M.D., Iserles, A. (eds.) Approximation Theory and Optimization. Cambridge University Press, Cambridge, pp. 167\u2013182 (1997)"},{"issue":"12","key":"198_CR17","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1287\/mnsc.31.12.1533","volume":"31","author":"O.K. Gupta","year":"1985","unstructured":"Gupta O.K., Ravindran A.: Branch and bound experiments in convex nonlinear integer programming. Manag. Sci. 31(12), 1533\u20131546 (1985)","journal-title":"Manag. Sci."},{"issue":"10","key":"198_CR18","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1016\/S0098-1354(99)00310-5","volume":"23","author":"I. Harjunkoski","year":"1999","unstructured":"Harjunkoski I., Westerlund T., P\u00f6rn R.: Numerical and environmental considerations on a complex industrial mixed integer non-linear programming (MINLP) problem. Comput. Chem. Eng. 23(10), 1545\u20131561 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"198_CR19","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1016\/S0377-2217(97)00066-0","volume":"105","author":"I. Harjunkoski","year":"1998","unstructured":"Harjunkoski I., Westerlund T., P\u00f6rn R., Skrifvars H.: Different transformations for solving non-convex trim-loss problems by MINLP. Eur. J. Oper. Res. 105(3), 594\u2013603 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"198_CR20","unstructured":"Kuipers, K.: Branch-and-bound solver for mixed-integer nonlinear optimization problems. In: MATLAB Central for File Exchange (2003)"},{"key":"198_CR21","unstructured":"Leyffer, S.: User manual for INLP_BB. In: University of Dundee Numerical Analysis Report NA\/XXX (1999)"},{"issue":"2","key":"198_CR22","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1287\/ijoc.11.2.173","volume":"11","author":"J.T. Linderoth","year":"1999","unstructured":"Linderoth J.T., Savelsbergh M.W.P.: A computational study of search strategies for mixed integer programming. INFORMS J. Comput. 11(2), 173\u2013187 (1999)","journal-title":"INFORMS J. Comput."},{"key":"198_CR23","unstructured":"LINGO User\u2019s Manual. Lindo systems, Inc., Chicago IL (2009)"},{"key":"198_CR24","unstructured":"Mathworks: The Mathworks Inc., MATLAB version 7.1 (R14). Mathworks, Natick (2005)"},{"issue":"4","key":"198_CR25","first-page":"342","volume":"4","author":"P.S.V. Nataraj","year":"2007","unstructured":"Nataraj P.S.V., Arounassalame M.: A new subdivision algorithm for the Bernstein polynomial approach to global optimization. IJAC 4(4), 342\u2013352 (2007)","journal-title":"IJAC"},{"issue":"2","key":"198_CR26","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/s12597-009-0009-y","volume":"46","author":"P.S.V. Nataraj","year":"2009","unstructured":"Nataraj P.S.V., Arounassalame M.: An algorithm for constrained global optimization of multivariate polynomials using the Bernstein form and John optimality conditions. Opsearch 46(2), 133\u2013152 (2009)","journal-title":"Opsearch"},{"issue":"2","key":"198_CR27","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10898-009-9485-0","volume":"49","author":"P.S.V. Nataraj","year":"2011","unstructured":"Nataraj P.S.V., Arounassalame M.: Constrained global optimization of multivariate polynomials using Bernstein branch and prune algorithm. J. Global Optim. 49(2), 185\u2013212 (2011)","journal-title":"J. Global Optim."},{"key":"198_CR28","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.: Relaxation and Decomposition Methods for Mixed-Integer Nonlinear Programming. Birkh\u00e4user Verlag, Berlin (2005)"},{"issue":"2\u20134","key":"198_CR29","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s00607-011-0175-7","volume":"94","author":"B.V. Patil","year":"2012","unstructured":"Patil B.V., Nataraj P.S.V., Bhatiya 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":"10\u201311","key":"198_CR30","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 I.E.: An LP\/NLP based branch and bound algorithm for convex MINLP optimization problems. Comput. Chem. Eng. 16(10\u201311), 937\u2013947 (1992)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"198_CR31","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 P.S.V.: An efficient algorithm for range computation of polynomials using the Bernstein form. J. Global Optim. 45(3), 403\u2013426 (2009)","journal-title":"J. Global Optim."},{"issue":"10","key":"198_CR32","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1016\/S0010-4485(03)00021-6","volume":"35","author":"J. Sanchez-Reyes","year":"2003","unstructured":"Sanchez-Reyes J.: Algebraic manipulation in the Bernstein form made simple via convolutions. Comput. Aided Des. 35(10), 959\u2013967 (2003)","journal-title":"Comput. Aided Des."},{"key":"198_CR33","unstructured":"Schluter, M., Gerdts, M., Ruckmann, J.J.: MIDACO: New Global Optimization Software for MINLP. http:\/\/www.midaco-solver.com\/about.html (2012). Accessed 20 Dec 2012"},{"key":"198_CR34","unstructured":"SCICON Ltd.: SCICONIC User Guide Version 1.40. Milton Keynes, UK (1989)"},{"issue":"2\u20133","key":"198_CR35","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10898-007-9195-4","volume":"43","author":"A.P. Smith","year":"2009","unstructured":"Smith A.P.: Fast construction of constant bound functions for sparse polynomials. J. Global Optim. 43(2\u20133), 445\u2013458 (2009)","journal-title":"J. Global Optim."},{"key":"198_CR36","unstructured":"Stahl, V.: Interval Methods for Bounding the Range of Polynomials and Solving Systems of Nonlinear Equations. PhD thesis, Johannes Kepler University, Linz (1995)"},{"key":"198_CR37","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","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. Kluwer Academic Publishers, Dordrecht (2002)"},{"issue":"3","key":"198_CR38","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1016\/j.ejor.2013.03.042","volume":"229","author":"J.P. Telesa","year":"2013","unstructured":"Telesa J.P., Castro P.M., Matos H.A.: Univariate parameterization for global optimization of mixed-integer polynomial problems. Eur. J. Oper. Res. 229(3), 613\u2013625 (2013)","journal-title":"Eur. J. Oper. Res."},{"key":"198_CR39","first-page":"S427","volume":"21","author":"A. Vecchietti","year":"1997","unstructured":"Vecchietti A., Grossmann I.E.: LOGMIP: a disjunctive 0\u20131 nonlinear optimizer for process system models. Comput. Chem. Eng. 21, S427\u2013S432 (1997)","journal-title":"Comput. Chem. Eng."},{"key":"198_CR40","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.: A extended cutting plane method for solving convex MINLP problems. Comput. Chem. Eng. 19, 131\u2013136 (1995)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"198_CR41","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1109\/9.661615","volume":"43","author":"M. Zettler","year":"1998","unstructured":"Zettler M., Garloff J.: Robustness analysis of polynomials with polynomial parameter dependency using Bernstein expansion. IEEE Trans. Autom. Control 43(3), 425\u2013431 (1998)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"198_CR42","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.: 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":["Mathematics in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-014-0198-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11786-014-0198-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11786-014-0198-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T20:06:50Z","timestamp":1649794010000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11786-014-0198-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7,29]]},"references-count":42,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["198"],"URL":"https:\/\/doi.org\/10.1007\/s11786-014-0198-5","relation":{},"ISSN":["1661-8270","1661-8289"],"issn-type":[{"value":"1661-8270","type":"print"},{"value":"1661-8289","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7,29]]}}}