{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T20:39:46Z","timestamp":1774643986548,"version":"3.50.1"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319503486","type":"print"},{"value":"9783319503493","type":"electronic"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-50349-3_1","type":"book-chapter","created":{"date-parts":[[2016,11,30]],"date-time":"2016-11-30T02:12:11Z","timestamp":1480471931000},"page":"3-16","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Learning a Stopping Criterion for Local Search"],"prefix":"10.1007","author":[{"given":"Alejandro","family":"Arbelaez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barry","family":"O\u2019Sullivan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,1]]},"reference":[{"issue":"3","key":"1_CR1","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1109\/JLT.2008.2006991","volume":"27","author":"R Davey","year":"2009","unstructured":"Davey, R., Grossman, D., Rasztovits-Wiech, M., Payne, D., Nesset, D., Kelly, A., Rafel, A., Appathurai, S., Yang, S.H.: Long-reach passive optical networks. J. Lightwave Technol. 27(3), 273\u2013291 (2009)","journal-title":"J. Lightwave Technol."},{"key":"1_CR2","unstructured":"Arbelaez, A., Mehta, D., O\u2019Sullivan, B., Quesada, L.: Constraint-based local search for the distance- and capacity-bounded network design problem. In: ICTAI 2014, Limassol, Cyprus, November 10\u201312, 2014, pp. 178\u2013185 (2014)"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Mehta, D., O\u2019Sullivan, B., Quesada, L.: Constraint-based local search for edge disjoint rooted distance-constrainted minimum spanning tree problem. In: CPAIOR 2015, pp. 31\u201346 (2015)","DOI":"10.1007\/978-3-319-18008-3_3"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Arbelaez, A., Mehta, D., O\u2019Sullivan, B.: Constraint-based local search for finding node-disjoint bounded-paths in optical access networks. In: CP 2015, pp. 499\u2013507 (2015)","DOI":"10.1007\/978-3-319-23219-5_35"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126(1), 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling salesman problems. Oper. Res. 6, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"1_CR7","unstructured":"Hoos, H., St\u00fctze, T.: Stochastic Local Search: Foundations and Applications. Morgan Kaufmann, New York (2005)"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Larochelle, H., Bengio, Y.: Classification using Discriminative Restricted Boltzmann Machines. In: ICML 2008, Helsinki, Finland, ACM 536\u2013543., June 2008","DOI":"10.1145\/1390156.1390224"},{"issue":"2","key":"1_CR9","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1186\/1471-2164-8-78","volume":"8","author":"A Al-Shahib","year":"2007","unstructured":"Al-Shahib, A., Breitling, R., Gilbert, D.R.: Predicting protein function by machine learning on amino acid sequences - a critical evaluation. BMC Genomics 8(2), 78 (2007)","journal-title":"BMC Genomics"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gelly, S., Silver, D.: Combining Online and Offline Knowledge in UCT. In: ICML 2007. vol. 227, pp. 273\u2013280. ACM, Corvalis, Oregon, USA, June 2007","DOI":"10.1145\/1273496.1273531"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"1088","DOI":"10.1109\/TNN.2005.853423","volume":"16","author":"I Rish","year":"2005","unstructured":"Rish, I., Brodie, M., Ma, S., et al.: Adaptive diagnosis in distributed dystems. IEEE Trans. Neural Netw. 16, 1088\u20131109 (2005)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"3","key":"1_CR12","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1609\/aimag.v35i3.2460","volume":"35","author":"L Kotthoff","year":"2014","unstructured":"Kotthoff, L.: Algorithm selection for combinatorial search problems: a survey. AI Mag. 35(3), 48\u201360 (2014)","journal-title":"AI Mag."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"1_CR14","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti, R., Tecchiolli, G.: The reactive tabu search. INFORMS J. Comput. 6(2), 126\u2013140 (1994)","journal-title":"INFORMS J. Comput."},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.artint.2013.10.003","volume":"206","author":"F Hutter","year":"2014","unstructured":"Hutter, F., Xu, L., Hoos, H.H., Leyton-Brown, K.: Algorithm runtime prediction: methods & evaluation. Artif. Intell. 206, 79\u2013111 (2014)","journal-title":"Artif. Intell."},{"key":"1_CR16","unstructured":"Kahavi, R.: A study of cross-validation and bootstrap for accuracy estimation and model selection. In: IJCAI 1995, pp. 1137\u20131145 (1995)"},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., Witten, I.H.: The weka data mining software: an update. SIGKDD Explor. 11, 10\u201318 (2009)","journal-title":"SIGKDD Explor."},{"key":"1_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-25566-3_11","volume-title":"Learning and Intelligent Optimization","author":"CC Ribeiro","year":"2011","unstructured":"Ribeiro, C.C., Rosseti, I., Souza, R.C.: Effective probabilistic stopping rules for randomized metaheuristics: GRASP Implementations. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 146\u2013160. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-25566-3_11"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/978-3-642-25566-3_8","volume-title":"Learning and Intelligent Optimization","author":"G Bontempi","year":"2011","unstructured":"Bontempi, G.: An optimal stopping strategy for online calibration in local search. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 106\u2013115. Springer, Heidelberg (2011). doi:\n                      10.1007\/978-3-642-25566-3_8"},{"key":"1_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-5362-2","volume-title":"Handbook of Global Optimization","author":"PM Pardalos","year":"2002","unstructured":"Pardalos, P.M., Romeijn, H.E.: Handbook of Global Optimization. Springer, Heidelberg (2002)"},{"issue":"1","key":"1_CR21","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF02591684","volume":"37","author":"CGE Boender","year":"1987","unstructured":"Boender, C.G.E., Kan, A.H.G.R.: Bayesian stopping rules for multistart global optimization methods. Math. Program. 37(1), 59\u201380 (1987)","journal-title":"Math. Program."},{"issue":"3","key":"1_CR22","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10898-006-9014-3","volume":"36","author":"C Orsenigo","year":"2006","unstructured":"Orsenigo, C., Vercellis, C.: Bayesian stopping rules for greedy randomized procedures. J. Global Optim. 36(3), 365\u2013377 (2006)","journal-title":"J. Global Optim."},{"key":"1_CR23","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1137\/0328048","volume":"4","author":"CCY Dorea","year":"1990","unstructured":"Dorea, C.C.Y.: Stopping rules for a random optimization method. SIAM J. Control Optim. 4, 841\u2013850 (1990)","journal-title":"SIAM J. Control Optim."},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1137\/S1052623494277317","volume":"9","author":"WE Hart","year":"1998","unstructured":"Hart, W.E.: Sequential stopping rules for random optimization methods with applications to multistart local search. SIAM J. Optim. 9(1), 270\u2013290 (1998)","journal-title":"SIAM J. Optim."}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-50349-3_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T01:40:09Z","timestamp":1558316409000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-50349-3_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319503486","9783319503493"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-50349-3_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"1 December 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LION","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Learning and Intelligent Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 May 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lion2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lion10.unina.it\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}