{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T14:45:14Z","timestamp":1740149114435,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,5,7]],"date-time":"2015-05-07T00:00:00Z","timestamp":1430956800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100006769","name":"Russian Science Foundation","doi-asserted-by":"crossref","award":["14-11-00109"],"award-info":[{"award-number":["14-11-00109"]}],"id":[{"id":"10.13039\/501100006769","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s12351-015-0180-2","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T10:54:44Z","timestamp":1430909684000},"page":"437-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Adaptive stability: general approach and examples"],"prefix":"10.1007","volume":"15","author":[{"given":"Evgeny","family":"Ivanko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,5,7]]},"reference":[{"key":"180_CR3","unstructured":"Ausiello G, Bonifaci V, Escoffier B (2010) Complexity and approximation in reoptimization. In: Cooper SB, Sorbi A (eds) Computability in context: computation and logic in the real world. Imperial College Press\/World Scientific, Singapore, pp 101\u2013129"},{"key":"180_CR4","volume-title":"Dynamic programming","author":"R Bellman","year":"1957","unstructured":"Bellman R (1957) Dynamic programming. Princeton University Press, Princeton"},{"key":"180_CR5","doi-asserted-by":"crossref","unstructured":"Bockenhauer HJ, Hromkovic J, Momke T, Widmayer P (2008) On the hardness of reoptimization. In SOFSEM 2008, vol 4910 of LNCS pp 50\u201365","DOI":"10.1007\/978-3-540-77566-9_5"},{"key":"180_CR6","unstructured":"B\u00f6ckenhauer HJ, Hromkovi\u010d J, Sprock A (2011) Computation, cooperation, and life. In: Kelemen J, Kelemenov\u00e1 A (eds) Knowing All Optimal Solutions Does Not Help for TSP Reoptimization. Lecture notes in computer science, vol 6610. Springer, Berlin, pp 7\u201315"},{"issue":"5","key":"180_CR7","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1023\/A:1015406222958","volume":"63","author":"AG Chentsov","year":"2002","unstructured":"Chentsov AG, Chentsov PA (2002) Dynamic programming in the problem of decomposition optimization. Autom Remote Control 63(5):815\u2013828","journal-title":"Autom Remote Control"},{"key":"180_CR1","unstructured":"Concorde (2014) http:\/\/www.math.uwaterloo.ca\/tsp\/concorde\/downloads\/downloads.htm"},{"issue":"1","key":"180_CR8","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1137\/S0895480195281878","volume":"11","author":"VG Deineko","year":"1998","unstructured":"Deineko VG, Rudolf R, Woeginger GJ (1998) Sometimes travelling is easy: the master tour problem. J Discrete Math 11(1):81\u201393","journal-title":"J Discrete Math"},{"issue":"1","key":"180_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1176344552","volume":"7","author":"B Efron","year":"1979","unstructured":"Efron B (1979) Bootstrap methods: another look at the jackknife. Ann Stat 7(1):1\u201326","journal-title":"Ann Stat"},{"key":"180_CR10","volume-title":"The traveling salesman problem and its variations","author":"G Gutin","year":"2006","unstructured":"Gutin G, Punnen A (2006) The traveling salesman problem and its variations. Springer, Berlin"},{"issue":"1","key":"180_CR11","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","volume":"10","author":"M Held","year":"1962","unstructured":"Held M, Karp RM (1962) A dynamic programming approach to sequencing problems. J Soc Ind Appl Math 10(1):196\u2013210","journal-title":"J Soc Ind Appl Math"},{"key":"180_CR12","first-page":"180","volume":"4","author":"E Ivanko","year":"2012","unstructured":"Ivanko E (2012) Optimal solutions stability criterium for min-max task distribution problem in case of the initial data set distortion. Proc IMM UBr RAS 4:180\u2013194","journal-title":"Proc IMM UBr RAS"},{"key":"180_CR13","volume-title":"Stability and instability of discrete problems","author":"E Ivanko","year":"2013","unstructured":"Ivanko E (2013) Stability and instability of discrete problems. PPD UBr RAS, Ekaterinburg"},{"key":"180_CR14","unstructured":"Ivanko E (2014) Adaptive stability in graph placement problem. In: Proceedings of the 14th international conference on mathematical methods in science and engineering (CMMSE-2014), pp 739\u2013742"},{"key":"180_CR15","doi-asserted-by":"crossref","unstructured":"Ivanko E (2014) On one approach to tsp structural stability. Advances in operations research. http:\/\/www.hindawi.com\/journals\/aor\/2014\/397025\/","DOI":"10.1155\/2014\/397025"},{"key":"180_CR16","volume-title":"Computation complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou C (1994) Computation complexity. University of California, San Diego"},{"key":"180_CR17","doi-asserted-by":"crossref","unstructured":"Shachnai H, Tamir G, Tamir T (2012) A theory and algorithms for combinatorial reoptimization. LNCS, Vol 7256, pp 618\u2013630","DOI":"10.1007\/978-3-642-29344-3_52"},{"key":"180_CR2","unstructured":"Tsplib (2014) http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/tsp\/a280.tsp.gz"},{"key":"180_CR18","unstructured":"Zych A (2012) Reoptimization of np-hard problems. Ph.D. thesis, Zurich"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-015-0180-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12351-015-0180-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-015-0180-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,24]],"date-time":"2019-08-24T13:23:03Z","timestamp":1566652983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12351-015-0180-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,7]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["180"],"URL":"https:\/\/doi.org\/10.1007\/s12351-015-0180-2","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"type":"print","value":"1109-2858"},{"type":"electronic","value":"1866-1505"}],"subject":[],"published":{"date-parts":[[2015,5,7]]}}}