{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T20:11:36Z","timestamp":1778271096485,"version":"3.51.4"},"reference-count":45,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100009882","name":"Regione Lombardia","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100009882","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Sciences"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.ins.2026.123435","type":"journal-article","created":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T16:04:24Z","timestamp":1774713864000},"page":"123435","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["A scalable, approximate optimization approach for random forests under polytopic constraints"],"prefix":"10.1016","volume":"746","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6671-5058","authenticated-orcid":false,"given":"Marco","family":"Leonesio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0109-6484","authenticated-orcid":false,"given":"Lorenzo","family":"Fagiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.ins.2026.123435_bib0005","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/J.ENG.2017.05.015","article-title":"Intelligent manufacturing in the context of industry 4.0: a review","volume":"3","author":"Zhong y","year":"2017","journal-title":"Engineering"},{"key":"10.1016\/j.ins.2026.123435_bib0010","doi-asserted-by":"crossref","first-page":"1889","DOI":"10.1007\/s00170-019-03988-5","article-title":"A review of machine learning for the optimization of production processes","volume":"104","author":"Weichert","year":"2019","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.ins.2026.123435_bib0015","series-title":"Data Mining for Design and Manufacturing: Methods and Applications Volume 3 of Massive Computing","author":"Braha","year":"2001"},{"key":"10.1016\/j.ins.2026.123435_bib0020","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/s00170-009-2104-x","article-title":"Application of soft computing techniques in machining performance prediction and optimization: a literature review","volume":"46","author":"Chandrasekaran","year":"2010","journal-title":"Int. J. Adv. Manuf. Technol."},{"key":"10.1016\/j.ins.2026.123435_bib0025","doi-asserted-by":"crossref","DOI":"10.1016\/j.ces.2021.117135","article-title":"Data-driven optimization for process systems engineering applications","volume":"248","author":"van de Berg","year":"2022","journal-title":"Chem. Eng. Sci."},{"key":"10.1016\/j.ins.2026.123435_bib0030","doi-asserted-by":"crossref","DOI":"10.1016\/j.oceaneng.2025.122620","article-title":"Optimization method for jacket platforms using random forest surrogate model","volume":"341","author":"Jiao","year":"2025","journal-title":"Ocean Eng."},{"key":"10.1016\/j.ins.2026.123435_bib0035","doi-asserted-by":"crossref","first-page":"9068","DOI":"10.3390\/app15169068","article-title":"Single-objective surrogate models for continuous metaheuristics: an overview","volume":"15","author":"Krawczyk","year":"2025","journal-title":"Appl. Sci."},{"key":"10.1016\/j.ins.2026.123435_bib0040","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10107-023-01979-9","article-title":"On the stationarity for nonlinear optimization problems with polyhedral constraints","volume":"205","author":"Di Serafino","year":"2024","journal-title":"Math. Program."},{"key":"10.1016\/j.ins.2026.123435_bib0045","article-title":"Ensemble learning: a survey","volume":"8","author":"Sagi","year":"2018","journal-title":"Wiley Interdiscip. Rev.: Data Min. Knowl. Discov."},{"key":"10.1016\/j.ins.2026.123435_bib0050","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","article-title":"Random forests","volume":"45","author":"Breiman","year":"2001","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ins.2026.123435_bib0055","series-title":"Uderstanding Random Forests - from Theory to Practice","author":"Louppe","year":"2014"},{"key":"10.1016\/j.ins.2026.123435_bib0060","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10898-024-01434-9","article-title":"Global optimization: a machine learning approach","volume":"91","author":"Bertsimas","year":"2025","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.ins.2026.123435_bib0065","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10898-023-01316-6","article-title":"A cooperative approach to efficient global optimization","volume":"88","author":"Zhan","year":"2024","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.ins.2026.123435_bib0070","unstructured":"J.F. Schumann, A.M. Arag\u00f3n, A machine learning approach for fighting the curse of dimensionality in global optimization (2021)."},{"key":"10.1016\/j.ins.2026.123435_bib0075","series-title":"Proceedings of the Tenth International Conference on International Conference on Machine Learning, ICML\u201993","first-page":"236","article-title":"Combining instance-based and model-based learning","author":"Quinlan","year":"1993"},{"key":"10.1016\/j.ins.2026.123435_bib0080","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/j.ins.2026.123435_bib0085","first-page":"321","article-title":"Iterated local search","author":"Louren\u00e7o","year":"2003"},{"key":"10.1016\/j.ins.2026.123435_bib0090","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1013500812258","article-title":"A survey of optimization by building and using probabilistic models","volume":"21","author":"Pelikan","year":"2002","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.ins.2026.123435_bib0095","first-page":"75","article-title":"The CMA Evolution strategy: a comparing review","author":"Hansen","year":"2006"},{"key":"10.1016\/j.ins.2026.123435_bib0100","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1008306431147","article-title":"Efficient global optimization of expensive black-box functions","volume":"13","author":"Jones","year":"1998","journal-title":"J. Glob. Optim."},{"key":"10.1016\/j.ins.2026.123435_bib0105","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1115\/1.3653121","article-title":"A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise","volume":"86","author":"Kushner","year":"1964","journal-title":"J. Basic Eng."},{"key":"10.1016\/j.ins.2026.123435_bib0110","series-title":"Proceedings of the 27th International Conference on Machine Learning (ICML)","article-title":"Gaussian process optimization in the bandit setting: no regret and experimental design","author":"Srinivas","year":"2010"},{"key":"10.1016\/j.ins.2026.123435_bib0115","series-title":"Proceedings of the 5th International Conference on Learning and Intelligent Optimization (LION)","first-page":"507","article-title":"Sequential model-based optimization for general algorithm configuration","author":"Hutter","year":"2011"},{"key":"10.1016\/j.ins.2026.123435_bib0120","series-title":"Advances in Neural Information Processing Systems","first-page":"2546","article-title":"Algorithms for hyper-parameter optimization","author":"Bergstra","year":"2011"},{"key":"10.1016\/j.ins.2026.123435_bib0125","author":"Biggs"},{"key":"10.1016\/j.ins.2026.123435_bib0130","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1998"},{"key":"10.1016\/j.ins.2026.123435_bib0135","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1111\/poms.13877","article-title":"Constrained optimization of objective functions determined from random forests","volume":"32","author":"Biggs","year":"2023","journal-title":"Prod. Oper. Manag."},{"key":"10.1016\/j.ins.2026.123435_bib0140","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1287\/opre.2019.1928","article-title":"Optimization of tree ensembles","volume":"68","author":"Mi\u0161i\u0107","year":"2020","journal-title":"Oper. Res."},{"key":"10.1016\/j.ins.2026.123435_bib0145","series-title":"2024 32nd Mediterranean Conference on Control and Automation (MED)","first-page":"494","article-title":"Scalable approximate optimization of objective functions represented by random forests","author":"Leonesio","year":"2024"},{"key":"10.1016\/j.ins.2026.123435_bib0150","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1023\/A:1018054314350","article-title":"Bagging predictors","volume":"24","author":"Breiman","year":"1996","journal-title":"Mach. Learn."},{"key":"10.1016\/j.ins.2026.123435_bib0155","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1080\/00031305.2019.1585288","article-title":"Random forest prediction intervals","volume":"74","author":"Zhang","year":"2020","journal-title":"Am. Stat."},{"key":"10.1016\/j.ins.2026.123435_bib0160","series-title":"Convex Optimization","author":"Boyd","year":"2004"},{"key":"10.1016\/j.ins.2026.123435_bib0165","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.camwa.2006.07.013","article-title":"A novel population initialization method for accelerating evolutionary algorithms","volume":"53","author":"Rahnamayan","year":"2007","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/j.ins.2026.123435_bib0170","author":"Leonesio"},{"key":"10.1016\/j.ins.2026.123435_bib0175","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1016\/j.jmapro.2020.09.018","article-title":"Intelligent technology in grinding process driven by data: a review","volume":"58","author":"Lv","year":"2020","journal-title":"J. Manuf. Process."},{"key":"10.1016\/j.ins.2026.123435_bib0180","series-title":"2022 IEEE Conference on Control Technology and Applications (CCTA)","first-page":"977","article-title":"A semi-supervised physics-informed classifier for centerless grinding operations","author":"Leonesio","year":"2022"},{"key":"10.1016\/j.ins.2026.123435_bib0185","doi-asserted-by":"crossref","DOI":"10.1088\/1757-899X\/93\/1\/012063","article-title":"The adaptive control of accuracy at centerless grinding of rolling bearings","volume":"93","author":"Yalovoy","year":"2015","journal-title":"IOP Conf. Ser.: Mater. Sci. Eng."},{"key":"10.1016\/j.ins.2026.123435_bib0190","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1177\/0954405414530899","article-title":"An analytical investigation on the workpiece roundness generation and its perfection strategies in centreless grinding","volume":"229","author":"Cui","year":"2021","journal-title":"Proc. Inst. Mech. Eng. Part B J. Eng. Manuf."},{"key":"10.1016\/j.ins.2026.123435_bib0195","author":"Leonesio"},{"key":"10.1016\/j.ins.2026.123435_bib0200","author":"Xin"},{"key":"10.1016\/j.ins.2026.123435_bib0205","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1137\/040603371","article-title":"Mesh adaptive direct search algorithms for constrained optimization","volume":"17","author":"Audet","year":"2006","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.ins.2026.123435_bib0210","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1137\/080716980","article-title":"Orthomads: a deterministic mads instance with orthogonal directions","volume":"20","author":"Abramson","year":"2009","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.ins.2026.123435_bib0215","unstructured":"N. Hansen, A. Auger, R. Ros, N. Mauny, T. Tu\u0161ar, D. Brockhoff, Pycma: Python implementation of CMA-ES (Version 2.7) [Computer softwsre], 2016. Available at: https:\/\/github.com\/CMA-ES\/pycma"},{"key":"10.1016\/j.ins.2026.123435_bib0220","author":"De Cock"},{"key":"10.1016\/j.ins.2026.123435_bib0225","series-title":"Numerical Optimization","author":"Nocedal","year":"2006"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002552600366X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002002552600366X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T19:10:47Z","timestamp":1778267447000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002002552600366X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":45,"alternative-id":["S002002552600366X"],"URL":"https:\/\/doi.org\/10.1016\/j.ins.2026.123435","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A scalable, approximate optimization approach for random forests under polytopic constraints","name":"articletitle","label":"Article Title"},{"value":"Information Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.ins.2026.123435","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"123435"}}