{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T11:17:14Z","timestamp":1711970234951},"reference-count":12,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,9,1]],"date-time":"2022-09-01T00:00:00Z","timestamp":1661990400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100004489","name":"Mitacs","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004489","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1016\/j.orl.2022.06.006","type":"journal-article","created":{"date-parts":[[2022,6,28]],"date-time":"2022-06-28T18:33:24Z","timestamp":1656441204000},"page":"446-451","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"title":["Hierarchically constrained blackbox optimization"],"prefix":"10.1016","volume":"50","author":[{"given":"St\u00e9phane","family":"Alarie","sequence":"first","affiliation":[]},{"given":"Charles","family":"Audet","sequence":"additional","affiliation":[]},{"given":"Paulin","family":"Jacquot","sequence":"additional","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0003-3148-5090","authenticated-orcid":false,"given":"S\u00e9bastien","family":"Le Digabel","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2022.06.006_br0010","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.orl.2022.06.006_br0020","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1137\/070692662","article-title":"A progressive barrier for derivative-free nonlinear programming","volume":"20","author":"Audet","year":"2009","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.orl.2022.06.006_br0030","doi-asserted-by":"crossref","article-title":"Derivative-Free and Blackbox Optimization","author":"Audet","year":"2017","DOI":"10.1007\/978-3-319-68913-5"},{"key":"10.1016\/j.orl.2022.06.006_br0040","doi-asserted-by":"crossref","first-page":"1164","DOI":"10.1137\/18M1175872","article-title":"The mesh adaptive direct search algorithm for granular and discrete variables","volume":"29","author":"Audet","year":"2019","journal-title":"SIAM J. Optim."},{"key":"10.1016\/j.orl.2022.06.006_br0050","doi-asserted-by":"crossref","first-page":"1583","DOI":"10.1002\/nme.1620210904","article-title":"A study of mathematical programming methods for structural optimization. Part I: theory","volume":"21","author":"Belegundu","year":"1985","journal-title":"Int. J. Numer. Methods Eng."},{"key":"10.1016\/j.orl.2022.06.006_br0060","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1139\/cjce-2013-0370","article-title":"Role of hydrologic information in stochastic dynamic programming: a case study of the Kemano hydropower system in British Columbia","volume":"41","author":"Desreumaux","year":"2014","journal-title":"Can. J. Civ. Eng."},{"key":"10.1016\/j.orl.2022.06.006_br0070","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s101070100244","article-title":"Nonlinear programming without a penalty function","volume":"91","author":"Fletcher","year":"2002","journal-title":"Math. Program., Ser. A"},{"key":"10.1016\/j.orl.2022.06.006_br0080","doi-asserted-by":"crossref","first-page":"777","DOI":"10.3934\/jimo.2014.10.777","article-title":"Solving structural engineering design optimization problems using an artificial bee colony algorithm","volume":"10","author":"Garg","year":"2014","journal-title":"J. Ind. Manag. Optim."},{"key":"10.1016\/j.orl.2022.06.006_br0090","series-title":"14th WCEAM Proceedings","first-page":"34","article-title":"Asset management in electrical utilities in the context of business and operational complexity","author":"Komljenovic","year":"2021"},{"key":"10.1016\/j.orl.2022.06.006_br0100","doi-asserted-by":"crossref","DOI":"10.1145\/1916461.1916468","article-title":"Algorithm 909: NOMAD: nonlinear optimization with the MADS algorithm","volume":"37","author":"Le Digabel","year":"2011","journal-title":"ACM Trans. Math. Softw."},{"key":"10.1016\/j.orl.2022.06.006_br0110","first-page":"239","article-title":"A comparison of three methods for selecting values of input variables in the analysis of output from a computer code","volume":"21","author":"McKay","year":"1979","journal-title":"Technometrics"},{"key":"10.1016\/j.orl.2022.06.006_br0120","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/080724083","article-title":"Benchmarking derivative-free optimization algorithms","volume":"20","author":"Mor\u00e9","year":"2009","journal-title":"SIAM J. Optim."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763772200075X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763772200075X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T10:40:49Z","timestamp":1711968049000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763772200075X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["S016763772200075X"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2022.06.006","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2022,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Hierarchically constrained blackbox optimization","name":"articletitle","label":"Article Title"},{"value":"Operations Research Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.orl.2022.06.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2022 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}