{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T18:47:09Z","timestamp":1767034029149},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540744450"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74446-7_21","type":"book-chapter","created":{"date-parts":[[2007,8,21]],"date-time":"2007-08-21T07:39:15Z","timestamp":1187681955000},"page":"217-221","source":"Crossref","is-referenced-by-count":4,"title":["Simple Metaheuristics Using the Simplex Algorithm for Non-linear Programming"],"prefix":"10.1007","author":[{"given":"Jo\u00e3o Pedro","family":"Pedroso","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Pedroso, J.P.: Simple meta-heuristics using the simplex algorithm for non-linear programming. Technical Report DCC-2007-06, DCC, FC, Universidade do Porto (2007)"},{"key":"21_CR2","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"J.A. Nelder","year":"1965","unstructured":"Nelder, J.A., Mead, R.: A simplex method for function minimization. Computer Journal\u00a07, 308\u2013313 (1965)","journal-title":"Computer Journal"},{"issue":"1-2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/S0377-0427(00)00423-4","volume":"124","author":"R.M. Lewis","year":"2000","unstructured":"Lewis, R.M., Torczon, V., Trosset, M.W.: Direct search methods: then and now. Journal of Computational and Applied Mathematics\u00a0124(1-2), 191\u2013207 (2000)","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"21_CR4","unstructured":"Pedroso, J.P.: Meta-heuristics using the simplex algorithm for nonlinear programming. In: Proceedings of the 2001 International Symposium on Nonlinear Theory and its Applications, Miyagi, Japan, pp. 315\u2013318 (2001)"},{"issue":"4","key":"21_CR5","doi-asserted-by":"publisher","first-page":"980","DOI":"10.1137\/S105262340138983X","volume":"14","author":"C. Audet","year":"2004","unstructured":"Audet, C., Dennis Jr., J.: A pattern search filter method for nonlinear programming without derivatives. SIAM Journal on Optimization\u00a014(4), 980\u20131010 (2004)","journal-title":"SIAM Journal on Optimization"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2003.08.053","volume":"161","author":"R. Chelouah","year":"2005","unstructured":"Chelouah, R., Siarry, P.: A hybrid method combining continuous tabu search and nelder-mead simplex algorithms for the global optimization of multiminima functions. European Journal of Operational Research\u00a0161, 636\u2013654 (2005)","journal-title":"European Journal of Operational Research"}],"container-title":["Lecture Notes in Computer Science","Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74446-7_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:27:49Z","timestamp":1619519269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74446-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540744450"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74446-7_21","relation":{},"subject":[]}}