{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T09:02:38Z","timestamp":1775120558310,"version":"3.50.1"},"publisher-location":"Cham","reference-count":6,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319694030","type":"print"},{"value":"9783319694047","type":"electronic"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-69404-7_32","type":"book-chapter","created":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T08:43:57Z","timestamp":1508834637000},"page":"364-369","source":"Crossref","is-referenced-by-count":2,"title":["Statistical Estimation in Global Random Search Algorithms in Case of Large Dimensions"],"prefix":"10.1007","author":[{"given":"Andrey","family":"Pepelyshev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Kornikov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anatoly","family":"Zhigljavsky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,10,25]]},"reference":[{"key":"32_CR1","unstructured":"Zhigljavsky, A.: Mathematical Theory of Global Random Search. Leningrad University Press (1985). in Russian"},{"issue":"1","key":"32_CR2","first-page":"125","volume":"1","author":"A Zhigljavsky","year":"1990","unstructured":"Zhigljavsky, A.: Branch and probability bound methods for global optimization. Informatica 1(1), 125\u2013140 (1990)","journal-title":"Informatica"},{"key":"32_CR3","volume-title":"Stochastic Global Optimization","author":"A Zhigljavsky","year":"2008","unstructured":"Zhigljavsky, A., \u017dilinskas, A.: Stochastic Global Optimization. Springer, New York (2008)"},{"key":"32_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-3436-1","volume-title":"Theory of Global Random Search","author":"A Zhigljavsky","year":"1991","unstructured":"Zhigljavsky, A.: Theory of Global Random Search. Kluwer Academic Publishers, Boston (1991)"},{"issue":"1","key":"32_CR5","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/s10898-010-9528-6","volume":"48","author":"A Zhigljavsky","year":"2010","unstructured":"Zhigljavsky, A., Hamilton, E.: Stopping rules in k-adaptive global random search algorithms. J. Global Optim. 48(1), 87\u201397 (2010)","journal-title":"J. Global Optim."},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s11590-014-0777-z","volume":"10","author":"A Zilinskas","year":"2016","unstructured":"Zilinskas, A., Zhigljavsky, A.: Branch and probability bound methods in multi-objective optimization. Optim. Lett. 10(2), 341\u2013353 (2016). doi:\n10.1007\/s11590-014-0777-z","journal-title":"Optim. Lett."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-69404-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,10,24]],"date-time":"2017-10-24T08:51:51Z","timestamp":1508835111000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-69404-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319694030","9783319694047"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-69404-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017]]}}}