{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T12:32:26Z","timestamp":1774269146244,"version":"3.50.1"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T00:00:00Z","timestamp":1638403200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2022,1]]},"DOI":"10.1007\/s10898-021-01045-8","type":"journal-article","created":{"date-parts":[[2021,12,2]],"date-time":"2021-12-02T09:02:32Z","timestamp":1638435752000},"page":"21-50","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Data-driven spatial branch-and-bound algorithms for box-constrained simulation-based optimization"],"prefix":"10.1007","volume":"82","author":[{"given":"Jianyuan","family":"Zhai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0584-1517","authenticated-orcid":false,"given":"Fani","family":"Boukouvala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,2]]},"reference":[{"issue":"4","key":"1045_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10288-014-0275-2","volume":"12","author":"S Amaran","year":"2014","unstructured":"Amaran, S., Sahinidis, N.V., Sharda, B., Bury, S.J.: Simulation optimization: a review of algorithms and applications. 4OR 12(4), 301\u2013333 (2014). https:\/\/doi.org\/10.1007\/s10288-014-0275-2","journal-title":"4OR"},{"key":"1045_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-1-4899-7491-4","volume-title":"Simulation-Based Optimization: Parametric Optimization Techniques and Reinforcement Learning","author":"A Gosavi","year":"2015","unstructured":"Gosavi, A.: Background. In: Gosavi, A. (ed.) Simulation-Based Optimization: Parametric Optimization Techniques and Reinforcement Learning, pp. 1\u201312. Springer, US, Boston, MA (2015)"},{"issue":"10","key":"1045_CR3","doi-asserted-by":"publisher","first-page":"2633","DOI":"10.1002\/aic.11579","volume":"54","author":"JA Caballero","year":"2008","unstructured":"Caballero, J.A., Grossmann, I.E.: An algorithm for the use of surrogate models in modular flowsheet optimization. AIChE J. 54(10), 2633\u20132650 (2008). https:\/\/doi.org\/10.1002\/aic.11579","journal-title":"AIChE J."},{"issue":"5","key":"1045_CR4","doi-asserted-by":"publisher","first-page":"1216","DOI":"10.1002\/aic.12341","volume":"57","author":"CA Henao","year":"2011","unstructured":"Henao, C.A., Maravelias, C.T.: Surrogate-based superstructure optimization framework. AIChE J. 57(5), 1216\u20131232 (2011). https:\/\/doi.org\/10.1002\/aic.12341","journal-title":"AIChE J."},{"key":"1045_CR5","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1016\/j.compchemeng.2017.09.017","volume":"108","author":"A Bhosekar","year":"2018","unstructured":"Bhosekar, A., Ierapetritou, M.: Advances in surrogate based modeling, feasibility analysis, and optimization: a review. Comput. Chem. Eng. 108, 250\u2013267 (2018). https:\/\/doi.org\/10.1016\/j.compchemeng.2017.09.017","journal-title":"Comput. Chem. Eng."},{"issue":"3","key":"1045_CR6","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1002\/cite.201800091","volume":"91","author":"K McBride","year":"2019","unstructured":"McBride, K., Sundmacher, K.: Overview of surrogate modeling in chemical process engineering. Chem. Ing. Tec. 91(3), 228\u2013239 (2019). https:\/\/doi.org\/10.1002\/cite.201800091","journal-title":"Chem. Ing. Tec."},{"key":"1045_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01421-0","author":"I Bajaj","year":"2019","unstructured":"Bajaj, I., Hasan, M.M.F.: Deterministic global derivative-free optimization of black-box problems with bounded Hessian. Optim. Lett. (2019). https:\/\/doi.org\/10.1007\/s11590-019-01421-0","journal-title":"Optim. Lett."},{"key":"1045_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-018-0643-0","author":"CA Kieslich","year":"2018","unstructured":"Kieslich, C.A., Boukouvala, F., Floudas, C.A.: Optimization of black-box problems using Smolyak grids and polynomial approximations. J. Global Optim. (2018). https:\/\/doi.org\/10.1007\/s10898-018-0643-0","journal-title":"J. Global Optim."},{"issue":"6","key":"1045_CR9","doi-asserted-by":"publisher","first-page":"2211","DOI":"10.1002\/aic.14418","volume":"60","author":"A Cozad","year":"2014","unstructured":"Cozad, A., Sahinidis, N.V., Miller, D.C.: Learning surrogate models for simulation-based optimization. AIChE J. 60(6), 2211\u20132227 (2014). https:\/\/doi.org\/10.1002\/aic.14418","journal-title":"AIChE J."},{"issue":"3","key":"1045_CR10","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1007\/s10957-018-1396-0","volume":"180","author":"AM Schweidtmann","year":"2019","unstructured":"Schweidtmann, A.M., Mitsos, A.: Deterministic global optimization with artificial neural networks embedded. J. Optim. Theory Appl. 180(3), 925\u2013948 (2019). https:\/\/doi.org\/10.1007\/s10957-018-1396-0","journal-title":"J. Optim. Theory Appl."},{"key":"1045_CR11","doi-asserted-by":"publisher","first-page":"106567","DOI":"10.1016\/j.compchemeng.2019.106567","volume":"130","author":"SS Garud","year":"2019","unstructured":"Garud, S.S., Mariappan, N., Karimi, I.A.: Surrogate-based black-box optimisation via domain exploration and smart placement. Comput. Chem. Eng. 130, 106567 (2019). https:\/\/doi.org\/10.1016\/j.compchemeng.2019.106567","journal-title":"Comput. Chem. Eng."},{"issue":"4","key":"1045_CR12","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Comput. J. 7(4), 308\u2013313 (1965). https:\/\/doi.org\/10.1093\/comjnl\/7.4.308","journal-title":"Comput. J."},{"issue":"1","key":"1045_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/s1052623493250780","volume":"7","author":"V Torczon","year":"1997","unstructured":"Torczon, V.: On the convergence of pattern search algorithms. SIAM J. Optim. 7(1), 1\u201325 (1997). https:\/\/doi.org\/10.1137\/s1052623493250780","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1045_CR14","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.1137\/s1052623496300507","volume":"9","author":"RM Lewis","year":"1999","unstructured":"Lewis, R.M., Torczon, V.: Pattern search algorithms for bound constrained minimization. SIAM J. Optim. 9(4), 1082\u20131099 (1999). https:\/\/doi.org\/10.1137\/s1052623496300507","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1045_CR15","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/040603371","volume":"17","author":"C Audet","year":"2006","unstructured":"Audet, C., Dennis, J.E.: Mesh adaptive direct search algorithms for constrained optimization. SIAM J. Optim. 17(1), 188\u2013217 (2006). https:\/\/doi.org\/10.1137\/040603371","journal-title":"SIAM J. Optim."},{"key":"1045_CR16","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/978-0-387-74759-0_128","volume-title":"Encyclopedia of Optimization","author":"DR Jones","year":"2009","unstructured":"Jones, D.R.: Direct global optimization algorithm direct global optimization algorithm. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 725\u2013735. Springer, US, Boston, MA (2009)"},{"issue":"1","key":"1045_CR17","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/bf00941892","volume":"79","author":"DR Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the Lipschitz constant. J. Optim. Theory Appl. 79(1), 157\u2013181 (1993). https:\/\/doi.org\/10.1007\/bf00941892","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1045_CR18","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1023\/a:1008382309369","volume":"14","author":"W Huyer","year":"1999","unstructured":"Huyer, W., Neumaier, A.: Global optimization by multilevel coordinate search. J. Global Optim. 14(4), 331\u2013355 (1999). https:\/\/doi.org\/10.1023\/a:1008382309369","journal-title":"J. Global Optim."},{"issue":"4598","key":"1045_CR19","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"issue":"3","key":"1045_CR20","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1287\/ijoc.9.3.231","volume":"9","author":"CR Reeves","year":"1997","unstructured":"Reeves, C.R.: Feature article-genetic algorithms for the operations researcher. INFORMS J. Comput. 9(3), 231\u2013250 (1997). https:\/\/doi.org\/10.1287\/ijoc.9.3.231","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"1045_CR21","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/bf00175354","volume":"4","author":"D Whitley","year":"1994","unstructured":"Whitley, D.: A genetic algorithm tutorial. Stat. Comput. 4(2), 65\u201385 (1994). https:\/\/doi.org\/10.1007\/bf00175354","journal-title":"Stat. Comput."},{"key":"1045_CR22","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of ICNN'95-International Conference on Neural Networks, vol. 1944, pp. 1942\u20131948, 27 November-1 December 1995","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"3","key":"1045_CR23","doi-asserted-by":"publisher","first-page":"1247","DOI":"10.1007\/s10898-012-9951-y","volume":"56","author":"LM Rios","year":"2013","unstructured":"Rios, L.M., Sahinidis, N.V.: Derivative-free optimization: a review of algorithms and comparison of software implementations. J. Global Optim. 56(3), 1247\u20131293 (2013). https:\/\/doi.org\/10.1007\/s10898-012-9951-y","journal-title":"J. Global Optim."},{"key":"1045_CR24","doi-asserted-by":"crossref","unstructured":"Conn, A.R., Scheinberg, K., Vicente, L.N.: Introduction to Derivative-free Optimization. Society for Industrial and Applied Mathematics (SIAM, 3600 Market Street, Floor 6, Philadelphia, PA 19104), (2009)","DOI":"10.1137\/1.9780898718768"},{"issue":"3","key":"1045_CR25","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1016\/j.ejor.2015.12.018","volume":"252","author":"F Boukouvala","year":"2016","unstructured":"Boukouvala, F., Misener, R., Floudas, C.A.: Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization CDFO. Eur. J. Oper. Res. 252(3), 701\u2013727 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.12.018","journal-title":"Eur. J. Oper. Res."},{"key":"1045_CR26","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1017\/S0962492919000060","volume":"28","author":"J Larson","year":"2019","unstructured":"Larson, J., Menickelly, M., Wild, S.M.: Derivative-free optimization methods. Acta Numer 28, 287\u2013404 (2019). https:\/\/doi.org\/10.1017\/S0962492919000060","journal-title":"Acta Numer"},{"key":"1045_CR27","doi-asserted-by":"crossref","unstructured":"Audet, C., Hare, W.: The beginnings of DFO algorithms. In: Derivative-Free and Blackbox Optimization. pp. 33\u201354. Springer, Cham (2017)","DOI":"10.1007\/978-3-319-68913-5_3"},{"key":"1045_CR28","unstructured":"Cox, D.D., John, S.: A statistical method for global optimization. In: [Proceedings] 1992 IEEE International Conference on Systems, Man, and Cybernetics, vol. 1242, pp. 1241\u20131246, 18\u201321 October 1992"},{"issue":"4","key":"1045_CR29","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1023\/A:1008306431147","journal-title":"J. Global Optim."},{"issue":"2","key":"1045_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1377612.1377613","volume":"35","author":"W Huyer","year":"2008","unstructured":"Huyer, W., Neumaier, A.: SNOBFIT-stable noisy optimization by branch and fit. ACM Trans. Math. Softw. 35(2), 1\u201325 (2008). https:\/\/doi.org\/10.1145\/1377612.1377613","journal-title":"ACM Trans. Math. Softw."},{"key":"1045_CR31","doi-asserted-by":"crossref","unstructured":"Thebelt, A., Kronqvist, J., Mistry, M., Lee, R.M., Sudermann-Merx, N., Misener, R.: ENTMOOT: a framework for optimization over ensemble tree models. arXiv e-prints (2020).","DOI":"10.1016\/j.compchemeng.2021.107343"},{"issue":"5","key":"1045_CR32","doi-asserted-by":"publisher","first-page":"895","DOI":"10.1007\/s11590-016-1028-2","volume":"11","author":"F Boukouvala","year":"2017","unstructured":"Boukouvala, F., Floudas, C.A.: ARGONAUT: algorithms for global optimization of constrained grey-box computational problems. Optim. Lett. 11(5), 895\u2013913 (2017). https:\/\/doi.org\/10.1007\/s11590-016-1028-2","journal-title":"Optim. Lett."},{"key":"1045_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00912-0","author":"J M\u00fcller","year":"2020","unstructured":"M\u00fcller, J., Park, J., Sahu, R., Varadharajan, C., Arora, B., Faybishenko, B., Agarwal, D.: Surrogate optimization of deep neural networks for groundwater predictions. J. Global Optim. (2020). https:\/\/doi.org\/10.1007\/s10898-020-00912-0","journal-title":"J. Global Optim."},{"issue":"1","key":"1045_CR34","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.paerosci.2008.11.001","volume":"45","author":"AIJ Forrester","year":"2009","unstructured":"Forrester, A.I.J., Keane, A.J.: Recent advances in surrogate-based optimization. Prog. Aerosp. Sci. 45(1), 50\u201379 (2009). https:\/\/doi.org\/10.1016\/j.paerosci.2008.11.001","journal-title":"Prog. Aerosp. Sci."},{"key":"1045_CR35","doi-asserted-by":"crossref","unstructured":"Barton, R.R., Meckesheimer, M.: Chapter 18 metamodel-based simulation optimization. In: Henderson, S.G., Nelson, B.L. (eds.) Handbooks in Operations Research and Management Science, vol. 13. pp. 535\u2013574. Elsevier (2006)","DOI":"10.1016\/S0927-0507(06)13018-2"},{"key":"1045_CR36","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.compchemeng.2014.05.021","volume":"68","author":"J Eason","year":"2014","unstructured":"Eason, J., Cremaschi, S.: Adaptive sequential sampling for surrogate model generation with artificial neural networks. Comput. Chem. Eng. 68, 220\u2013232 (2014). https:\/\/doi.org\/10.1016\/j.compchemeng.2014.05.021","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1045_CR37","doi-asserted-by":"publisher","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. Program. 103(2), 225\u2013249 (2005). https:\/\/doi.org\/10.1007\/s10107-005-0581-8","journal-title":"Math. Program."},{"issue":"2","key":"1045_CR38","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1080\/00401706.1979.10489755","volume":"21","author":"MD McKay","year":"1979","unstructured":"McKay, M.D., Beckman, R.J., Conover, W.J.: Comparison of three methods for selecting values of input variables in the analysis of output from a computer code. Technometrics 21(2), 239\u2013245 (1979). https:\/\/doi.org\/10.1080\/00401706.1979.10489755","journal-title":"Technometrics"},{"key":"1045_CR39","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2019.106519","author":"G H\u00fcllen","year":"2019","unstructured":"H\u00fcllen, G., Zhai, J., Kim, S.H., Sinha, A., Realff, M.J., Boukouvala, F.: Managing uncertainty in data-driven simulation-based optimization. Comput. Chem. Eng. (2019). https:\/\/doi.org\/10.1016\/j.compchemeng.2019.106519","journal-title":"Comput. Chem. Eng."},{"issue":"2","key":"1045_CR40","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Global Optim. 59(2), 503\u2013526 (2014). https:\/\/doi.org\/10.1007\/s10898-014-0166-2","journal-title":"J. Global Optim."},{"issue":"4","key":"1045_CR41","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/bf01099647","volume":"7","author":"IP Androulakis","year":"1995","unstructured":"Androulakis, I.P., Maranas, C.D., Floudas, C.A.: \u03b1BB: A global optimization method for general constrained nonconvex problems. J. Global Optim. 7(4), 337\u2013363 (1995). https:\/\/doi.org\/10.1007\/bf01099647","journal-title":"J. Global Optim."},{"issue":"3","key":"1045_CR42","doi-asserted-by":"publisher","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. Program. 99(3), 563\u2013591 (2004). https:\/\/doi.org\/10.1007\/s10107-003-0467-6","journal-title":"Math. Program."},{"key":"1045_CR43","unstructured":"Azar, M.G., Dyer, E.L., K, K.P., #246, rding: Convex relaxation regression: black-box optimization of smooth functions by learning their convex envelopes. Paper presented at the Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, Jersey City, New Jersey, USA"},{"issue":"7","key":"1045_CR44","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1080\/0740817X.2013.768783","volume":"45","author":"WL Xu","year":"2013","unstructured":"Xu, W.L., Nelson, B.L.: Empirical stochastic branch-and-bound for optimization via simulation. IIE Trans. 45(7), 685\u2013698 (2013). https:\/\/doi.org\/10.1080\/0740817X.2013.768783","journal-title":"IIE Trans."},{"issue":"1","key":"1045_CR45","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.cnsns.2014.08.026","volume":"21","author":"YD Sergeyev","year":"2015","unstructured":"Sergeyev, Y.D., Kvasov, D.E.: A deterministic global optimization using smooth diagonal auxiliary functions. Commun. Nonlinear Sci. Numer. Simul. 21(1), 99\u2013111 (2015). https:\/\/doi.org\/10.1016\/j.cnsns.2014.08.026","journal-title":"Commun. Nonlinear Sci. Numer. Simul."},{"issue":"1","key":"1045_CR46","doi-asserted-by":"publisher","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\u2014convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976). https:\/\/doi.org\/10.1007\/BF01580665","journal-title":"Math. Program."},{"issue":"3","key":"1045_CR47","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF02592064","volume":"36","author":"MA 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). https:\/\/doi.org\/10.1007\/BF02592064","journal-title":"Math. Program."},{"key":"1045_CR48","volume-title":"The Nature of Statistical Learning Theory","author":"V Vapnik","year":"1999","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory. Springer, New York (1999)"},{"issue":"3","key":"1045_CR49","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/b:stco.0000035301.49549.88","volume":"14","author":"AJ Smola","year":"2004","unstructured":"Smola, A.J., Sch\u00f6lkopf, B.: A tutorial on support vector regression. Stat. Comput. 14(3), 199\u2013222 (2004). https:\/\/doi.org\/10.1023\/b:stco.0000035301.49549.88","journal-title":"Stat. Comput."},{"key":"1045_CR50","unstructured":"Oliphant, T.E.: A Guid to Numpy. Trelgol Publishing, USA (2006)"},{"issue":"2","key":"1045_CR51","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCSE.2011.37","volume":"13","author":"SVD Walt","year":"2011","unstructured":"Walt, S.V.D., Colbert, S.C., Varoquaux, G.: The Numpy array: a structure for efficient numerical computation. Comput. Sci. Eng. 13(2), 22\u201330 (2011). https:\/\/doi.org\/10.1109\/MCSE.2011.37","journal-title":"Comput. Sci. Eng."},{"key":"1045_CR52","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-3226-5","volume-title":"Pyomo-Optimization Modeling in Python","author":"WE Hart","year":"2012","unstructured":"Hart, W.E., Laird, C., Watson, J.-P., Woodruff, D.L.: Pyomo-Optimization Modeling in Python. Springer (2012)"},{"key":"1045_CR53","unstructured":"Baudin, M., Christopoulou, M., Collette, Y., Martinez, J.-M.: pyDOE: The experimental design package for python. In"},{"key":"1045_CR54","unstructured":"Pedregosa, F., Ga, #235, Varoquaux, l., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., #201, Duchesnay, d.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)"},{"key":"1045_CR55","doi-asserted-by":"publisher","DOI":"10.1002\/aic.16601","author":"J Zhai","year":"2019","unstructured":"Zhai, J., Boukouvala, F.: Nonlinear variable selection algorithms for surrogate modeling. AIChE J. (2019). https:\/\/doi.org\/10.1002\/aic.16601","journal-title":"AIChE J."},{"key":"1045_CR56","unstructured":"Guzman, Y.A.: Theoretical Advances in Robust Optimization, Feature Selection, and Biomarker Discovery. Academic dissertations (Ph.D.), Princeton University (2016)"},{"key":"1045_CR57","unstructured":"Bound-constrained programs. http:\/\/www.minlp.com\/nlp-and-minlp-test-problems. 2019"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01045-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01045-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01045-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T15:11:55Z","timestamp":1726240315000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01045-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,2]]},"references-count":57,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,1]]}},"alternative-id":["1045"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01045-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,2]]},"assertion":[{"value":"18 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 December 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}