{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T17:56:32Z","timestamp":1781200592439,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642041792","type":"print"},{"value":"9783642041808","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04180-8_63","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T08:11:20Z","timestamp":1251360680000},"page":"705-720","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Multi-start Strategies for Local Search Algorithms"],"prefix":"10.1007","author":[{"given":"Levente","family":"Kocsis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Andr\u00e1s","family":"Gy\u00f6rgy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1006\/jeth.2000.2723","volume":"101","author":"K. Adam","year":"2001","unstructured":"Adam, K.: Learning while searching for the best alternative. Journal of Economic Theory\u00a0101, 252\u2013280 (2001)","journal-title":"Journal of Economic Theory"},{"key":"63_CR2","unstructured":"Asuncion, A., Newman, D.J.: UCI machine learning repository (2007)"},{"issue":"2-3","key":"63_CR3","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite time analysis of the multiarmed bandit problem. Machine Learning\u00a047(2-3), 235\u2013256 (2002)","journal-title":"Machine Learning"},{"key":"63_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-24664-0_4","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C.J. Beck","year":"2004","unstructured":"Beck, C.J., Freuder, E.C.: Simple rules for low-knowledge algorithm selection. In: R\u00e9gin, J.-C., Rueher, M. (eds.) CPAIOR 2004. LNCS, vol.\u00a03011, pp. 50\u201364. Springer, Heidelberg (2004)"},{"key":"63_CR5","unstructured":"Carchrae, T., Beck, J.C.: Low-knowledge algorithm control. In: Proceedings of the 19th National Conference on Artificial Intelligence (AAAI), pp. 49\u201354 (2004)"},{"key":"63_CR6","unstructured":"Cicirello, V.A.: The max k-armed bandit: A new model of exploration applied to search heuristic selection. In: Proceedings of the Twentieth National Conference on Artificial Intelligence, pp. 1355\u20131361 (2005)"},{"key":"63_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-3-540-30201-8_17","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"V.A. Cicirello","year":"2004","unstructured":"Cicirello, V.A., Smith, S.F.: Heuristic selection for stochastic search optimization: Modeling solution quality by extreme value theory. In: Wallace, M. (ed.) CP 2004. LNCS, vol.\u00a03258, pp. 197\u2013211. Springer, Heidelberg (2004)"},{"key":"63_CR8","unstructured":"Finkel, D.E., Kelley, C.T.: Convergence analysis of the direct algorithm. Technical Report CRSC-TR04-28, NCSU Mathematics Department (2004)"},{"issue":"3\u20134","key":"63_CR9","first-page":"295","volume":"47","author":"M. Gagliolo","year":"2006","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning dynamic algorithm portfolios. Annals of Mathematics and Artificial Intelligence\u00a047(3\u20134), 295\u2013328 (2006); AI&MATH 2006 Special Issue","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"63_CR10","first-page":"792","volume-title":"IJCAI 2007 \u2014 Twentieth International Joint Conference on Artificial Intelligence","author":"M. Gagliolo","year":"2007","unstructured":"Gagliolo, M., Schmidhuber, J.: Learning restart strategies. In: Veloso, M.M. (ed.) IJCAI 2007 \u2014 Twentieth International Joint Conference on Artificial Intelligence, vol.\u00a01, pp. 792\u2013797. AAAI Press, Menlo Park (2007)"},{"key":"63_CR11","unstructured":"Gagliolo, M., Schmidhuber, J.: Algorithm selection as a bandit problem with unbounded losses. Technical Report IDSIA - 07 - 08, IDSIA (July 2008)"},{"key":"63_CR12","doi-asserted-by":"crossref","unstructured":"Gerencs\u00e9r, L., V\u00e1g\u00f3, Z.: The mathematics of noise-free SPSA. In: Proceedings of the IEEE Conference on Decision and Control, pp. 4400\u20134405 (2001)","DOI":"10.1109\/CDC.2001.980894"},{"key":"63_CR13","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00933356","volume":"34","author":"A.O. Griewank","year":"1981","unstructured":"Griewank, A.O.: Generalized descent for global optimization. Journal of Optimization Theory and Applications\u00a034, 11\u201339 (1981)","journal-title":"Journal of Optimization Theory and Applications"},{"issue":"1","key":"63_CR14","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jco.2005.06.006","volume":"22","author":"M. Horn","year":"2006","unstructured":"Horn, M.: Optimal algorithms for global optimization in case of unknown Lipschitz constant. Journal of Complexity\u00a022(1), 50\u201370 (2006)","journal-title":"Journal of Complexity"},{"issue":"1","key":"63_CR15","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00941892","volume":"79","author":"D.R. Jones","year":"1993","unstructured":"Jones, D.R., Perttunen, C.D., Stuckman, B.E.: Lipschitzian optimization without the lipschitz constant. Journal of Optimization Theory and Applications\u00a079(1), 157\u2013181 (1993)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"63_CR16","unstructured":"Kautz, H., Horvitz, E., Ruan, Y., Gomes, C., Selman, B.: Dynamic restart policies. In: Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI), pp. 674\u2013681 (2002)"},{"key":"63_CR17","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0020-0190(93)90029-9","volume":"47","author":"M. Luby","year":"1993","unstructured":"Luby, M., Sinclair, A., Zuckerman, D.: Optimal speedup of Las Vegas algorithms. Information Processing Letters\u00a047, 173\u2013180 (1993)","journal-title":"Information Processing Letters"},{"key":"63_CR18","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1109\/9.119632","volume":"37","author":"J.C. Spall","year":"1992","unstructured":"Spall, J.C.: Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Transactions on Automatic Control\u00a037, 332\u2013341 (1992)","journal-title":"IEEE Transactions on Automatic Control"},{"key":"63_CR19","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1109\/7.705889","volume":"34","author":"J.C. Spall","year":"1998","unstructured":"Spall, J.C.: Implementation of the simultaneous perturbation algorithm for stochastic optimization. IEEE Transactions on Aerospace Electronic Systems\u00a034, 817\u2013823 (1998)","journal-title":"IEEE Transactions on Aerospace Electronic Systems"},{"key":"63_CR20","unstructured":"Streeter, M.J., Smith, S.F.: An asymptotically optimal algorithm for the max k-armed bandit problem. In: Proceedings, The 21st National Conference on Artificial Intelligence and the 18th Innovative Applications of Artificial Intelligence Conference, pp. 135\u2013142 (2006)"},{"key":"63_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/11889205_40","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"M.J. Streeter","year":"2006","unstructured":"Streeter, M.J., Smith, S.F.: A simple distribution-free approach to the max k-armed bandit problem. In: Benhamou, F. (ed.) CP 2006. LNCS, vol.\u00a04204, pp. 560\u2013574. Springer, Heidelberg (2006)"},{"issue":"2","key":"63_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1023\/A:1019956318069","volume":"18","author":"R. Vilalta","year":"2002","unstructured":"Vilalta, R., Drissi, Y.: A perspective view and survey of meta-learning. Artificial Intelligence Review\u00a018(2), 77\u201395 (2002)","journal-title":"Artificial Intelligence Review"},{"key":"63_CR23","volume-title":"Data Mining: Practical Machine Learning Tools and Techniques","author":"I.H. Witten","year":"2005","unstructured":"Witten, I.H., Frank, E.: Data Mining: Practical Machine Learning Tools and Techniques, 2nd edn. Morgan Kaufmann, San Francisco (2005)","edition":"2"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04180-8_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,11]],"date-time":"2025-02-11T21:52:51Z","timestamp":1739310771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04180-8_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041792","9783642041808"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04180-8_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}