{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T08:46:28Z","timestamp":1725871588525},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319503066"},{"type":"electronic","value":"9783319503073"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50307-3_1","type":"book-chapter","created":{"date-parts":[[2016,11,24]],"date-time":"2016-11-24T10:11:18Z","timestamp":1479982278000},"page":"3-19","source":"Crossref","is-referenced-by-count":0,"title":["Total Memory Optimiser: Proof of Concept and Compromises"],"prefix":"10.1007","author":[{"given":"Maurice","family":"Clerc","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,11,25]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Beyhaghi, P., Cavaglieri, D., Bewley, T.: Delaunay-based derivative-free optimization via global surrogates, part I: linear constraints. J. Glob. Optim., 1\u201352 (2015)","DOI":"10.1007\/s10898-015-0384-2"},{"key":"1_CR2","unstructured":"Clerc, M.: When Nearer is Better, p. 19 (2007). https:\/\/hal.archives-ouvertes.fr\/hal-00137320"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Clerc, M.: Guided Randomness in Optimization. ISTE (International Scientific and Technical Encyclopedia). Wiley (2015)","DOI":"10.1002\/9781119136439"},{"key":"1_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry. Springer, Heidelberg (2008)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Elsayed, S.M., Sarker, R.A., Essam, D.L.: GA with a New Multi-Parent Crossover for Solving IEEE-CEC2011 Competition Problems (2011)","DOI":"10.1109\/CEC.2011.5949708"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Han, Z.-H., Zhang, K.-S.: Surrogate-based optimization. INTECH Open Access Publisher (2012)","DOI":"10.5772\/36125"},{"key":"1_CR8","unstructured":"Hansen, N.: The CMA Evolution Strategy: A Tutorial. Technical report (2009)"},{"issue":"4","key":"1_CR9","first-page":"22","volume":"7","author":"MGH Omran","year":"2016","unstructured":"Omran, M.G.H., Clerc, M.: An adaptive population-based simplex method for continuous optimization. Int. J. Swarm Intell. Res. 7(4), 22\u201349 (2016)","journal-title":"Int. J. Swarm Intell. Res."},{"key":"1_CR10","series-title":"SCI","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-642-00267-0_1","volume-title":"Nature-Inspired Algorithms for Optimisation","author":"T Weise","year":"2009","unstructured":"Weise, T., Zapf, M., Chiong, R., Nebro, A.J.: Why is optimization difficult? In: Kacprzyk, J., Chiong, R. (eds.) Nature-Inspired Algorithms for Optimisation. SCI, vol. 193, pp. 1\u201350. Springer, Heidelberg (2009)"}],"container-title":["Lecture Notes in Computer Science","Swarm Intelligence Based Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50307-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,15]],"date-time":"2019-09-15T19:09:33Z","timestamp":1568574573000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50307-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503066","9783319503073"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50307-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}