{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:33:52Z","timestamp":1759847632789,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T00:00:00Z","timestamp":1442620800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T00:00:00Z","timestamp":1442620800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA8655-3-1-3066"],"award-info":[{"award-number":["FA8655-3-1-3066"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s11590-015-0949-5","type":"journal-article","created":{"date-parts":[[2015,9,19]],"date-time":"2015-09-19T06:22:14Z","timestamp":1442643734000},"page":"1479-1492","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["On the recoverable robust traveling salesman problem"],"prefix":"10.1007","volume":"10","author":[{"given":"Andr\u00e9","family":"Chassein","sequence":"first","affiliation":[]},{"given":"Marc","family":"Goerigk","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,9,19]]},"reference":[{"issue":"2","key":"949_CR1","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., Vanderpooten, D.: Mimax and minmax regret versions of combinatorial optimization problems: a survey. Eur. J. Oper. Res. 197(2), 427\u2013438 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"949_CR2","doi-asserted-by":"crossref","unstructured":"Bouman, P.C., Akker, J.M., van\u00a0den Hoogeveen, J.A.: Recoverable robustness by column generation. In: European symposium on algorithms. Lecture Notes in Computer Science, vol. 6942, pp. 215\u2013226. Springer (2011)","DOI":"10.1007\/978-3-642-23719-5_19"},{"issue":"3","key":"949_CR3","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas, D., Brown, D., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53(3), 464\u2013501 (2011)","journal-title":"SIAM Rev."},{"issue":"1","key":"949_CR4","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52(1), 35\u201353 (2004)","journal-title":"Oper. Res."},{"key":"949_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2003","unstructured":"Ben-Tal, A., Goryashko, A., Guslitzer, E., Nemirovski, A.: Adjustable robust solutions of uncertain linear programs. Math. Programm. A 99, 351\u2013376 (2003)","journal-title":"Math. Programm. A"},{"key":"949_CR6","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831050","volume-title":"Robust optimization","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust optimization. Princeton University Press, Princeton, Oxford (2009)"},{"key":"949_CR7","doi-asserted-by":"crossref","unstructured":"B\u00fcsing, C.: The exact subgraph recoverable robust shortest path problem. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D. (eds.) Robust and online large-scale optimization. Lecture notes in computer science, vol. 5868, pp. 231\u2013248. Springer, Berlin, Heidelberg (2009)","DOI":"10.1007\/978-3-642-05465-5_9"},{"issue":"1","key":"949_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1002\/net.20487","volume":"59","author":"C B\u00fcsing","year":"2012","unstructured":"B\u00fcsing, C.: Recoverable robust shortest path problems. Networks 59(1), 181\u2013189 (2012)","journal-title":"Networks"},{"issue":"3","key":"949_CR9","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s12532-012-0039-y","volume":"4","author":"M Fischetti","year":"2012","unstructured":"Fischetti, M., Monaci, M.: Cutting plane versus compact formulations for uncertain (integer) linear programs. Math. Programm. Comput. 4(3), 239\u2013273 (2012)","journal-title":"Math. Programm. Comput."},{"key":"949_CR10","unstructured":"Goerigk, M. He\u00dfe, S., M\u00fcller-Hannemann, M., Schmidt, M., Sch\u00f6bel, A.: Recoverable robust timetable information. In: Frigioni, D., Stiller, S. (eds.) Proc. of ATMOS 13. OASIcs, vol. 33, pp. 1\u201314 (2013)"},{"key":"949_CR11","unstructured":"Goerigk, M.: A note on upper bounds to the robust knapsack problem with discrete scenarios. Ann. Oper. Res. 223(1), 461\u2013469 (2014)"},{"key":"949_CR12","doi-asserted-by":"crossref","unstructured":"Goerigk, M., Sch\u00f6bel, A.: Recovery-to-optimality: a new two-stage approach to robustness with an application to aperiodic timetabling. Comput. Oper. Res. 52(A(0)), 1 \u2013 15 (2014)","DOI":"10.1016\/j.cor.2014.06.025"},{"key":"949_CR13","doi-asserted-by":"crossref","unstructured":"Goerigk, M., Sch\u00f6bel, A.: Algorithm engineering in robust optimization. LNCS State-of-the-Art Surveys Springer (2015, To appear)","DOI":"10.1007\/978-3-319-49487-6_8"},{"issue":"1","key":"949_CR14","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":"949_CR15","doi-asserted-by":"crossref","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers (1997)","DOI":"10.1007\/978-1-4757-2620-6"},{"key":"949_CR16","doi-asserted-by":"crossref","unstructured":"Lawler, E.L., Lenstra, J.K., Kan, A.H.G.R., Shmoys, D.B.: The traveling salesman problem: a guided tour of combinatorial optimization, vol.\u00a03. Wiley, New York (1985)","DOI":"10.2307\/2582681"},{"key":"949_CR17","doi-asserted-by":"crossref","unstructured":"Liebchen, C., L\u00fcbbecke, M., M\u00f6hring, R.H., Stiller, S.: The concept of recoverable robustness, linear programming recovery, and railway applications. In: Ahuja, R.K., M\u00f6hring, R.H., Zaroliagis, C.D., (eds.) Robust and online large-scale optimization. Lecture Note on Computer Science, vol. 5868, pp. 1\u201327. Springer (2009)","DOI":"10.1007\/978-3-642-05465-5_1"},{"issue":"3","key":"949_CR18","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1287\/trsc.1060.0181","volume":"41","author":"R Montemanni","year":"2007","unstructured":"Montemanni, R., Barta, J., Mastrolilli, M., Gambardella, L.M.: The robust traveling salesman problem with interval data. Transp. Sci. 41(3), 366\u2013381 (2007)","journal-title":"Transp. Sci."},{"issue":"3","key":"949_CR19","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1016\/j.ejor.2005.02.060","volume":"174","author":"R Montemanni","year":"2006","unstructured":"Montemanni, R.: A benders decomposition approach for the robust spanning tree problem with interval data. Eur. J. Oper. Res. 174(3), 1479\u20131490 (2006)","journal-title":"Eur. J. Oper. Res."},{"issue":"5","key":"949_CR20","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng, B., Zhao, L.: Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper. Res. Lett. 41(5), 457\u2013461 (2013)","journal-title":"Oper. Res. Lett."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0949-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-015-0949-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0949-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-015-0949-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,22]],"date-time":"2022-05-22T01:26:13Z","timestamp":1653182773000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-015-0949-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,19]]},"references-count":20,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["949"],"URL":"https:\/\/doi.org\/10.1007\/s11590-015-0949-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2015,9,19]]},"assertion":[{"value":"19 September 2014","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 September 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 September 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}