{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,14]],"date-time":"2026-05-14T10:36:34Z","timestamp":1778754994982,"version":"3.51.4"},"reference-count":89,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,9,3]],"date-time":"2015-09-03T00:00:00Z","timestamp":1441238400000},"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":["J Glob Optim"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1007\/s10898-015-0358-4","type":"journal-article","created":{"date-parts":[[2015,9,2]],"date-time":"2015-09-02T08:30:46Z","timestamp":1441182646000},"page":"401-439","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Global optimization with spline constraints: a new branch-and-bound method based on B-splines"],"prefix":"10.1007","volume":"65","author":[{"given":"Bjarne","family":"Grimstad","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anders","family":"Sandnes","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,3]]},"reference":[{"key":"358_CR1","doi-asserted-by":"crossref","first-page":"S445","DOI":"10.1016\/S0098-1354(97)87542-4","volume":"21","author":"C Adjiman","year":"1997","unstructured":"Adjiman, C., Androulakis, I., Floudas, C.: Global optimization of MINLP problems in process synthesis and design. Comput. Chem. Eng. 21, S445\u2013S450 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"9","key":"358_CR2","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: A global optimization method, $$\\alpha $$ \u03b1 BB, for general twice-differentiable constrained NLPs-II. Implementation and computational results. Comput. Chem. Eng. 22(9), 1159\u20131179 (1998)","journal-title":"Comput. Chem. Eng."},{"key":"358_CR3","doi-asserted-by":"crossref","first-page":"1769","DOI":"10.1002\/aic.690460908","volume":"46","author":"CS Adjiman","year":"2000","unstructured":"Adjiman, C.S., Androulakis, I.P., Floudas, C.A.: Global optimization of mixed-integer nonlinear problems. AIChE J. 46, 1769\u20131797 (2000)","journal-title":"AIChE J."},{"issue":"9","key":"358_CR4","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","volume":"22","author":"CS Adjiman","year":"1998","unstructured":"Adjiman, C.S., Dallwig, S., Floudas, C.A., Neumaier, A.: A global optimization method, $$\\alpha $$ \u03b1 BB, for general twice-differentiable constrained NLPs-I. Theoretical advances. Comput. Chem. Eng. 22(9), 1137\u20131158 (1998)","journal-title":"Comput. Chem. Eng."},{"issue":"5","key":"358_CR5","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(78)90003-0","volume":"7","author":"SG Akl","year":"1978","unstructured":"Akl, S.G., Toussaint, G.T.: A fast convex hull algorithm. Inf. Process. Lett. 7(5), 219\u2013222 (1978)","journal-title":"Inf. Process. Lett."},{"issue":"4\u20135","key":"358_CR6","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. Methods Softw. 24(4\u20135), 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"9","key":"358_CR7","doi-asserted-by":"crossref","first-page":"1914","DOI":"10.1016\/j.compchemeng.2005.04.003","volume":"29","author":"ML Bergamini","year":"2005","unstructured":"Bergamini, M.L., Aguirre, P., Grossmann, I.: Logic-based outer approximation for globally optimal synthesis of process networks. Comput. Chem. Eng. 29(9), 1914\u20131933 (2005)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"358_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1016\/0010-4485(80)90154-2","volume":"12","author":"W Boehm","year":"1980","unstructured":"Boehm, W.: Inserting new knots into B-spline curves. Comput. Aided Des. 12(4), 199\u2013201 (1980)","journal-title":"Comput. Aided Des."},{"issue":"2","key":"358_CR9","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., et al.: An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optim. 5(2), 186\u2013204 (2008)","journal-title":"Discrete Optim."},{"key":"358_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"2","key":"358_CR11","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":"2","key":"358_CR12","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/B:JOGO.0000042114.11969.bb","volume":"29","author":"E Carrizosa","year":"2004","unstructured":"Carrizosa, E., Hansen, P., Messine, F.: Improving interval analysis bounds by translations. J. Global Optim. 29(2), 157\u2013172 (2004)","journal-title":"J. Global Optim."},{"issue":"2","key":"358_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0146-664X(80)90040-4","volume":"14","author":"E Cohen","year":"1980","unstructured":"Cohen, E., Lyche, T., Riesenfeld, R.: Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics. Comput. Graph. Image Process. 14(2), 87\u2013111 (1980)","journal-title":"Comput. Graph. Image Process."},{"issue":"1","key":"358_CR14","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0167-8396(85)90029-9","volume":"2","author":"E Cohen","year":"1985","unstructured":"Cohen, E., Schumaker, L.L.: Rates of convergence of control polygons. Comput. Aided Geom. Des. 2(1), 229\u2013235 (1985)","journal-title":"Comput. Aided Geom. Des."},{"issue":"2","key":"358_CR15","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1093\/imamat\/10.2.134","volume":"10","author":"MG Cox","year":"1972","unstructured":"Cox, M.G.: The numerical evaluation of B-splines. IMA J. Appl. Math. 10(2), 134\u2013149 (1972)","journal-title":"IMA J. Appl. Math."},{"issue":"1","key":"358_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.37.1.1.12822","volume":"37","author":"KL Croxton","year":"2003","unstructured":"Croxton, K.L., Gendron, B., Magnanti, T.L.: Models and methods for merge-in-transit operations. Transp. Sci. 37(1), 1\u201322 (2003)","journal-title":"Transp. Sci."},{"issue":"1","key":"358_CR17","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02788653","volume":"17","author":"HB Curry","year":"1966","unstructured":"Curry, H.B., Schoenberg, I.J.: On P\u00f3lya frequency functions IV: the fundamental spline functions and their limits. Journal d\u2019analyse math\u00e9matique 17(1), 71\u2013107 (1966)","journal-title":"Journal d\u2019analyse math\u00e9matique"},{"issue":"1","key":"358_CR18","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0021-9045(72)90080-9","volume":"6","author":"C Boor De","year":"1972","unstructured":"De Boor, C.: On calculating with B-splines. J. Approx. Theory 6(1), 50\u201362 (1972)","journal-title":"J. Approx. Theory"},{"issue":"3","key":"358_CR19","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1007\/s10589-008-9185-6","volume":"45","author":"R Dias","year":"2010","unstructured":"Dias, R., Garcia, N.L., Zambom, A.Z.: A penalized nonparametric method for nonlinear constrained optimization based on noisy data. Comput. Optim. Appl 45(3), 521\u2013541 (2010). doi: 10.1007\/s10589-008-9185-6","journal-title":"Comput. Optim. Appl"},{"key":"358_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-53032-0","volume-title":"A Collection of Test Problems for Constrained Global Optimization Algorithms","author":"CA Floudas","year":"1990","unstructured":"Floudas, C.A., Pardalos, P.M.: A Collection of Test Problems for Constrained Global Optimization Algorithms, vol. 455. Springer, Berlin (1990)"},{"key":"358_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3040-1","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"1999","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C.S., Esposito, W.R., Gumus, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization, vol. 33. Kluwer Academic Publishers, Dordrecht (1999)"},{"key":"358_CR22","unstructured":"GAMS Development Corporation: General Algebraic Modeling System (GAMS) Release 24.2.1. Washington (2013). http:\/\/www.gams.com\/"},{"issue":"1","key":"358_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0377-0427(03)00422-9","volume":"157","author":"J Garloff","year":"2003","unstructured":"Garloff, J., Jansson, C., Smith, A.P.: Lower bound functions for polynomials. J. Comput. Appl. Math. 157(1), 207\u2013225 (2003)","journal-title":"J. Comput. Appl. Math."},{"issue":"1","key":"358_CR24","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/S0362-546X(01)00166-3","volume":"47","author":"J Garloff","year":"2001","unstructured":"Garloff, J., Smith, A.P.: Investigation of a subdivision based algorithm for solving systems of polynomial equations. Nonlinear Anal. Theory, Methods & Appl. 47(1), 167\u2013178 (2001). doi: 10.1016\/S0362-546X(01)00166-3","journal-title":"Nonlinear Anal. Theory, Methods & Appl."},{"issue":"3","key":"358_CR25","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1021095211251","volume":"3","author":"EP Gatzke","year":"2002","unstructured":"Gatzke, E.P., Tolsma, J.E., Barton, P.I.: Construction of convex relaxations using automated code generation techniques. Optim. Eng. 3(3), 305\u2013326 (2002)","journal-title":"Optim. Eng."},{"key":"358_CR26","unstructured":"Grimstad, B.: SPLINTER: A library for multivariate function approximation. https:\/\/github.com\/bgrimstad\/splinter . Accessed 16 May 2015 (2015)"},{"key":"358_CR27","unstructured":"Grimstad, B., et al.: CENSO: a framework for global optimization of nonconvex, possibly spline-constrained, MINLP problems. https:\/\/github.com\/bgrimstad\/censo (2015). Accessed 16 May 2015"},{"key":"358_CR28","unstructured":"Guennebaud, G., Jacob, B., et al.: Eigen v3. http:\/\/eigen.tuxfamily.org (2010)"},{"issue":"11","key":"358_CR29","doi-asserted-by":"crossref","first-page":"1803","DOI":"10.1016\/j.compchemeng.2009.10.019","volume":"34","author":"V Gunnerud","year":"2010","unstructured":"Gunnerud, V., Foss, B.: Oil production optimization\u2014a piecewise linear model, solved with two decomposition strategies. Comput. Chem. Eng. 34(11), 1803\u20131812 (2010)","journal-title":"Comput. Chem. Eng."},{"key":"358_CR30","unstructured":"Gurobi Optimization, Inc.: Gurobi Optimizer Reference Manual. http:\/\/www.gurobi.com (2014)"},{"key":"358_CR31","doi-asserted-by":"crossref","DOI":"10.1201\/9780203026922","volume-title":"Global Optimization Using Interval Analysis: Revised and Expanded","author":"E Hansen","year":"2003","unstructured":"Hansen, E., Walster, G.W.: Global Optimization Using Interval Analysis: Revised and Expanded, vol. 264. CRC Press, Boca Raton (2003)"},{"issue":"4\u20135","key":"358_CR32","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1080\/10556780802699201","volume":"24","author":"D Henrion","year":"2009","unstructured":"Henrion, D., Lasserre, J.B., L\u00f6fberg, J.: Gloptipoly 3: moments, optimization and semidefinite programming. Optim. Methods Softw. 24(4\u20135), 761\u2013779 (2009)","journal-title":"Optim. Methods Softw."},{"key":"358_CR33","volume-title":"Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction","author":"J Hooker","year":"2011","unstructured":"Hooker, J.: Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction, vol. 2. Wiley, New York (2011)"},{"key":"358_CR34","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches, 3rd edn","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)"},{"issue":"4","key":"358_CR35","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1023\/A:1012771025575","volume":"21","author":"DR Jones","year":"2001","unstructured":"Jones, D.R.: A taxonomy of global optimization methods based on response surfaces. J. Global Optim. 21(4), 345\u2013383 (2001)","journal-title":"J. Global Optim."},{"issue":"4","key":"358_CR36","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","volume":"13","author":"DR Jones","year":"1998","unstructured":"Jones, D.R., Schonlau, M., Welch, W.J.: Efficient global optimization of expensive black-box functions. J. Global Optim. 13(4), 455\u2013492 (1998)","journal-title":"J. Global Optim."},{"issue":"5","key":"358_CR37","doi-asserted-by":"crossref","first-page":"847","DOI":"10.1287\/opre.1060.0277","volume":"54","author":"AB Keha","year":"2006","unstructured":"Keha, A.B., de Farias Jr, I.R., Nemhauser, G.L.: A branch-and-cut algorithm without binary variables for nonconvex piecewise linear optimization. Oper. Res. 54(5), 847\u2013858 (2006)","journal-title":"Oper. Res."},{"issue":"2","key":"358_CR38","doi-asserted-by":"crossref","first-page":"1361","DOI":"10.1016\/S0098-1354(00)00421-X","volume":"24","author":"P Kesavan","year":"2000","unstructured":"Kesavan, P., Barton, P.I.: Generalized branch-and-cut framework for mixed-integer nonlinear optimization problems. Comput. Chem. Eng. 24(2), 1361\u20131366 (2000)","journal-title":"Comput. Chem. Eng."},{"issue":"7","key":"358_CR39","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1016\/j.compchemeng.2004.12.003","volume":"29","author":"VD Kosmidis","year":"2005","unstructured":"Kosmidis, V.D., Perkins, J.D., Pistikopoulos, E.N.: A mixed integer optimization formulation for the well scheduling problem on petroleum fields. Comput. Chem. Eng. 29(7), 1523\u20131541 (2005)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"358_CR40","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1162\/evco.1999.7.1.19","volume":"7","author":"S Koziel","year":"1999","unstructured":"Koziel, S., Michalewicz, Z.: Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolut. Comput. 7(1), 19\u201344 (1999)","journal-title":"Evolut. Comput."},{"issue":"3","key":"358_CR41","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1137\/S1052623400366802","volume":"11","author":"JB Lasserre","year":"2001","unstructured":"Lasserre, J.B.: Global optimization with polynomials and the problem of moments. SIAM J. Optim. 11(3), 796\u2013817 (2001)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"358_CR42","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.: An efficient and safe framework for solving optimization problems. J. Comput. Appl. Math. 199(2), 372\u2013377 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"358_CR43","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1016\/S0377-2217(96)00310-4","volume":"107","author":"HL Li","year":"1998","unstructured":"Li, H.L., Chang, C.T.: An approximate approach of global optimization for polynomial programming problems. Eur. J. Oper. Res. 107(3), 625\u2013632 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"358_CR44","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1023\/A:1021924706467","volume":"25","author":"L Liberti","year":"2003","unstructured":"Liberti, L., Pantelides, C.: Convex envelopes of monomials of odd degree. J. Global Optim. 25, 157\u2013168 (2003)","journal-title":"J. Global Optim."},{"issue":"2","key":"358_CR45","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1007\/s10898-006-9005-4","volume":"36","author":"L Liberti","year":"2006","unstructured":"Liberti, L., Pantelides, C.C.: An exact reformulation algorithm for large nonconvex NLPs involving bilinear terms. J. Global Optim. 36(2), 161\u2013189 (2006)","journal-title":"J. Global Optim."},{"issue":"4\u20135","key":"358_CR46","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24(4\u20135), 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"1\u20132","key":"358_CR47","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10107-012-0616-x","volume":"144","author":"M Locatelli","year":"2014","unstructured":"Locatelli, M., Schoen, F.: On convex envelopes for bivariate functions over polytopes. Math. Progr. 144(1\u20132), 65\u201391 (2014)","journal-title":"Math. Progr."},{"issue":"1","key":"358_CR48","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-8396(85)90016-0","volume":"2","author":"T Lyche","year":"1985","unstructured":"Lyche, T., Cohen, E., M\u00f8rken, K.: Knot line refinement algorithms for tensor product B-spline surfaces. Comput. Aided Geom. Des. 2(1), 133\u2013139 (1985)","journal-title":"Comput. Aided Geom. Des."},{"issue":"2\u20133","key":"358_CR49","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-005-0665-5","volume":"105","author":"A Martin","year":"2006","unstructured":"Martin, A., M\u00f6ller, M., Moritz, S.: Mixed integer models for the stationary case of gas network optimization. Math. Progr. 105(2\u20133), 563\u2013582 (2006)","journal-title":"Math. Progr."},{"issue":"1","key":"358_CR50","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: Part i\u2013convex underestimating problems. Math. Progr. 10(1), 147\u2013175 (1976)","journal-title":"Math. Progr."},{"issue":"10","key":"358_CR51","doi-asserted-by":"crossref","first-page":"2095","DOI":"10.1016\/j.apm.2006.08.008","volume":"31","author":"DB McDonald","year":"2007","unstructured":"McDonald, D.B., Grantham, W.J., Tabor, W.L., Murphy, M.J.: Global and local optimization using radial basis function response surface models. Appl. Math. Model. 31(10), 2095\u20132110 (2007)","journal-title":"Appl. Math. Model."},{"key":"358_CR52","unstructured":"Meeraus, A.: GLOBALLib (2013). http:\/\/www.gamsworld.org\/global\/globallib.htm"},{"issue":"04","key":"358_CR53","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1051\/ro:2004026","volume":"38","author":"F Messine","year":"2004","unstructured":"Messine, F.: Deterministic global optimization using interval constraint propagation techniques. RAIRO Oper. Res. 38(04), 277\u2013293 (2004)","journal-title":"RAIRO Oper. Res."},{"issue":"2","key":"358_CR54","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Progr. 103(2), 207\u2013224 (2005)","journal-title":"Math. Progr."},{"issue":"2","key":"358_CR55","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10898-004-2704-9","volume":"32","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., Floudas, C.A.: Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline $$\\alpha $$ \u03b1 BB underestimators. J. Global Optim. 32(2), 221\u2013258 (2005)","journal-title":"J. Global Optim."},{"issue":"25","key":"358_CR56","doi-asserted-by":"crossref","first-page":"6413","DOI":"10.1021\/ie020199j","volume":"41","author":"CA Meyer","year":"2002","unstructured":"Meyer, C.A., Floudas, C.A., Neumaier, A.: Global optimization with nonfactorable constraints. Ind. Eng. Chem. Res. 41(25), 6413\u20136424 (2002)","journal-title":"Ind. Eng. Chem. Res."},{"issue":"5","key":"358_CR57","doi-asserted-by":"crossref","first-page":"876","DOI":"10.1016\/j.compchemeng.2011.01.026","volume":"35","author":"R Misener","year":"2011","unstructured":"Misener, R., Thompson, J.P., Floudas, C.A.: Apogee: Global optimization of standard, generalized, and extended pooling problems via linear and logarithmic partitioning schemes. Comput. Chem. Eng. 35(5), 876\u2013892 (2011)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"358_CR58","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1007\/s11633-007-0342-7","volume":"4","author":"P Nataraj","year":"2007","unstructured":"Nataraj, P., 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":"358_CR59","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/s10898-009-9485-0","volume":"49","author":"P Nataraj","year":"2011","unstructured":"Nataraj, P., 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":"358_CR60","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization, vol. 18. Wiley, New York (1988)"},{"issue":"1","key":"358_CR61","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M Padberg","year":"1991","unstructured":"Padberg, M., Rinaldi, G.: A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev. 33(1), 60\u2013100 (1991)","journal-title":"SIAM Rev."},{"issue":"1","key":"358_CR62","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.advengsoft.2011.09.009","volume":"45","author":"S Park","year":"2012","unstructured":"Park, S.: Approximate branch-and-bound global optimization using b-spline hypervolumes. Adv. Eng. Softw. 45(1), 11\u201320 (2012)","journal-title":"Adv. Eng. Softw."},{"key":"358_CR63","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59223-2","volume-title":"The NURBS Book","author":"LA Piegl","year":"1997","unstructured":"Piegl, L.A., Tiller, W.: The NURBS Book. Springer, Berlin (1997)"},{"key":"358_CR64","doi-asserted-by":"crossref","unstructured":"Pinter, J.D.: LGO\u2014a program system for continuous and lipschitz global optimization. In: Developments in Global Optimization, pp. 183\u2013197. Springer, New York (1997)","DOI":"10.1007\/978-1-4757-2600-8_12"},{"key":"358_CR65","volume-title":"Production Planning by Mixed Integer Programming","author":"Y Pochet","year":"2006","unstructured":"Pochet, Y., Wolsey, L.A.: Production Planning by Mixed Integer Programming. Springer, New York (2006)"},{"issue":"1","key":"358_CR66","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02519040","volume":"2","author":"H Prautzsch","year":"1994","unstructured":"Prautzsch, H., Kobbelt, L.: Convergence of subdivision and degree elevation. Adv. Comput. Math. 2(1), 143\u2013154 (1994)","journal-title":"Adv. Comput. Math."},{"issue":"2","key":"358_CR67","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1080\/0305215X.2013.765000","volume":"46","author":"RG Regis","year":"2014","unstructured":"Regis, R.G.: Constrained optimization by radial basis function interpolation for high-dimensional expensive black-box problems with infeasible initial points. Eng. Optim. 46(2), 218\u2013243 (2014)","journal-title":"Eng. Optim."},{"issue":"6","key":"358_CR68","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1016\/S0167-8396(00)00014-5","volume":"17","author":"U Reif","year":"2000","unstructured":"Reif, U.: Best bounds on the approximation of polynomials and splines by their control structure. Comput. Aided Geom. Des. 17(6), 579\u2013589 (2000)","journal-title":"Comput. Aided Geom. Des."},{"issue":"2","key":"358_CR69","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Global Optim. 8(2), 107\u2013138 (1996)","journal-title":"J. Global Optim."},{"key":"358_CR70","doi-asserted-by":"crossref","unstructured":"Sahinidis, N.V.: Global optimization and constraint satisfaction: the branch-and-reduce approach. In: Global Optimization and Constraint Satisfaction, pp. 1\u201316. Springer, Berlin (2003)","DOI":"10.1007\/978-3-540-39901-8_1"},{"key":"358_CR71","unstructured":"Sasena, M.J.: Flexibility and Efficiency Enhancements for Constrained Global Design Optimization with Kriging Approximations. Ph.D. thesis, University of Michigan (2002)"},{"issue":"3","key":"358_CR72","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1080\/03052150211751","volume":"34","author":"MJ Sasena","year":"2002","unstructured":"Sasena, M.J., Papalambros, P., Goovaerts, P.: Exploration of metamodeling sampling criteria for constrained global optimization. Eng. Optim. 34(3), 263\u2013278 (2002)","journal-title":"Eng. Optim."},{"issue":"45\u201399","key":"358_CR73","doi-asserted-by":"crossref","first-page":"112","DOI":"10.1090\/qam\/16705","volume":"4","author":"IJ Sch\u00f6nberg","year":"1946","unstructured":"Sch\u00f6nberg, I.J.: Contributions to the problem of approximation of equidistant data by analytic functions. Q. Appl. Math. 4(45\u201399), 112\u2013141 (1946)","journal-title":"Q. Appl. Math."},{"key":"358_CR74","volume-title":"Spline Functions: Basic Theory","author":"LL Schumaker","year":"1981","unstructured":"Schumaker, L.L.: Spline Functions: Basic Theory. Wiley, New York (1981)"},{"issue":"1","key":"358_CR75","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01100203","volume":"7","author":"HD Sherali","year":"1995","unstructured":"Sherali, H.D., Tuncbilek, C.H.: A reformulation\u2013convexification approach for solving nonconvex quadratic programming problems. J. Global Optim. 7(1), 1\u201331 (1995)","journal-title":"J. Global Optim."},{"issue":"2\u20133","key":"358_CR76","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s10898-007-9195-4","volume":"43","author":"AP Smith","year":"2009","unstructured":"Smith, A.P.: Fast construction of constant bound functions for sparse polynomials. J. Glob. Optim. 43(2\u20133), 445\u2013458 (2009). doi: 10.1007\/s10898-007-9195-4","journal-title":"J. Glob. Optim."},{"key":"358_CR77","doi-asserted-by":"crossref","first-page":"S791","DOI":"10.1016\/S0098-1354(97)87599-0","volume":"21","author":"E Smith","year":"1997","unstructured":"Smith, E., Pantelides, C.C.: Global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 21, S791\u2013S796 (1997)","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"358_CR78","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1016\/S0098-1354(98)00286-5","volume":"23","author":"EM Smith","year":"1999","unstructured":"Smith, E.M., Pantelides, C.C.: A symbolic reformulation\/spatial branch-and-bound algorithm for the global optimisation of nonconvex MINLPs. Comput. Chem. Eng. 23(4), 457\u2013478 (1999)","journal-title":"Comput. Chem. Eng."},{"issue":"1\u20134","key":"358_CR79","doi-asserted-by":"crossref","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11","author":"JF Sturm","year":"1999","unstructured":"Sturm, J.F.: Using sedumi 1.02, a matlab toolbox for optimization over symmetric cones. Optim. Methods Softw. 11(1\u20134), 625\u2013653 (1999)","journal-title":"Optim. Methods Softw."},{"key":"358_CR80","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, vol. 65. Springer, Dordrecht (2002)"},{"issue":"3","key":"358_CR81","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. Progr. 99(3), 563\u2013591 (2004)","journal-title":"Math. Progr."},{"issue":"2","key":"358_CR82","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. Progr. 103(2), 225\u2013249 (2005)","journal-title":"Math. Progr."},{"key":"358_CR83","doi-asserted-by":"crossref","unstructured":"Vaidyanathan, R., El-Halwagi, M.: Global optimization of nonconvex MINLP\u2019s by interval analysis. In: Global Optimization in Engineering Design, pp. 175\u2013193. Springer, New York (1996)","DOI":"10.1007\/978-1-4757-5331-8_6"},{"key":"358_CR84","volume-title":"Applied Optimization with MATLAB Programming","author":"P Venkataraman","year":"2009","unstructured":"Venkataraman, P.: Applied Optimization with MATLAB Programming. Wiley, New York (2009)"},{"issue":"2","key":"358_CR85","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"1","key":"358_CR86","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Progr. 106(1), 25\u201357 (2006)","journal-title":"Math. Progr."},{"issue":"1","key":"358_CR87","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1137\/050623802","volume":"17","author":"H Waki","year":"2006","unstructured":"Waki, H., Kim, S., Kojima, M., Muramatsu, M.: Sums of squares and semidefinite program relaxations for polynomial optimization problems with structured sparsity. SIAM J. Optim. 17(1), 218\u2013242 (2006)","journal-title":"SIAM J. Optim."},{"issue":"9","key":"358_CR88","doi-asserted-by":"crossref","first-page":"845","DOI":"10.1016\/0098-1354(94)E0006-9","volume":"18","author":"T Westerlund","year":"1994","unstructured":"Westerlund, T., Pettersson, F., Grossmann, I.E.: Optimization of pump configurations as a MINLP problem. Comput. Chem. Eng. 18(9), 845\u2013858 (1994)","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"358_CR89","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1023\/A:1008312714792","volume":"14","author":"JM Zamora","year":"1999","unstructured":"Zamora, J.M., Grossmann, I.E.: A branch and contract algorithm for problems with concave univariate, bilinear and linear fractional terms. J. Global Optim. 14(3), 217\u2013249 (1999)","journal-title":"J. Global Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0358-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-015-0358-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-015-0358-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T06:24:03Z","timestamp":1653114243000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-015-0358-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,3]]},"references-count":89,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s10898-015-0358-4","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,9,3]]}}}