{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,7]],"date-time":"2023-03-07T07:52:48Z","timestamp":1678175568150},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Chemical Engineering"],"published-print":{"date-parts":[[2002,1]]},"DOI":"10.1016\/s0098-1354(01)00764-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T03:52:30Z","timestamp":1027569150000},"page":"141","source":"Crossref","is-referenced-by-count":1,"title":["Letter to the editor"],"prefix":"10.1016","volume":"26","author":[{"given":"M.F","family":"Cardoso","sequence":"first","affiliation":[]},{"given":"R.L","family":"Salcedo","sequence":"additional","affiliation":[]},{"given":"S.Feyo","family":"de Azevedo","sequence":"additional","affiliation":[]},{"given":"D","family":"Barbosa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0098-1354(01)00764-5_BIB1","doi-asserted-by":"crossref","first-page":"1349","DOI":"10.1016\/S0098-1354(97)00015-X","article-title":"A simulated annealing approach to the solution of MINLP problems","volume":"21","author":"Cardoso","year":"1997","journal-title":"Computers and Chemical Engineering"},{"issue":"2\u20134","key":"10.1016\/S0098-1354(01)00764-5_BIB2","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0045-7825(99)00389-8","article-title":"An efficient constraint handling method for genetic algorithms","volume":"186","author":"Deb","year":"2000","journal-title":"Comp. Meth. Appl. Mech. Eng."},{"issue":"10","key":"10.1016\/S0098-1354(01)00764-5_BIB3","doi-asserted-by":"crossref","first-page":"1117","DOI":"10.1016\/0098-1354(89)87016-4","article-title":"Global optimum search for nonconvex NLP and MINLP problems","volume":"13","author":"Floudas","year":"1989","journal-title":"Computers and Chemical Engineering"},{"issue":"5","key":"10.1016\/S0098-1354(01)00764-5_BIB4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","article-title":"Global optimization of nonconvex NLPs and MINLPs with applications in process design","volume":"19","author":"Ryoo","year":"1995","journal-title":"Computers and Chemical Engineering"},{"issue":"1","key":"10.1016\/S0098-1354(01)00764-5_BIB5","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1021\/ie00001a037","article-title":"Solving nonconvex nonlinear programming and mixed-integer nonlinear programming problems with adaptive random search","volume":"31","author":"Salcedo","year":"1992","journal-title":"Indian Engineering and Chemical Research"},{"key":"10.1016\/S0098-1354(01)00764-5_BIB6","unstructured":"Yuan, X., Zhang, S., Pibouleau, L., Domenech, S. (1989). Use methode d'optimization nonlineaire en variables mixtes pour la conception de procedes. RAIRO-Oper. Res."}],"container-title":["Computers &amp; Chemical Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135401007645?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0098135401007645?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,5]],"date-time":"2019-05-05T19:54:12Z","timestamp":1557086052000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0098135401007645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0098135401007645"],"URL":"https:\/\/doi.org\/10.1016\/s0098-1354(01)00764-5","relation":{},"ISSN":["0098-1354"],"issn-type":[{"value":"0098-1354","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}