{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,25]],"date-time":"2024-07-25T15:57:17Z","timestamp":1721923037601},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:00:00Z","timestamp":1528675200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10878-018-0317-3","type":"journal-article","created":{"date-parts":[[2018,6,11]],"date-time":"2018-06-11T00:09:47Z","timestamp":1528675787000},"page":"601-619","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reoptimization of minimum latency problem revisited: don\u2019t panic when asked to revisit the route after local modifications"],"prefix":"10.1007","volume":"37","author":[{"given":"Wenkai","family":"Dai","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yongjie","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,6,11]]},"reference":[{"issue":"3","key":"317_CR1","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1002\/net.10091","volume":"42","author":"C Archetti","year":"2003","unstructured":"Archetti C, Bertazzi L, Speranza MG (2003) Reoptimizing the traveling salesman problem. Networks 42(3):154\u2013159","journal-title":"Networks"},{"issue":"17","key":"317_CR2","doi-asserted-by":"publisher","first-page":"1879","DOI":"10.1016\/j.dam.2010.08.003","volume":"158","author":"C Archetti","year":"2010","unstructured":"Archetti C, Bertazzi L, Speranza MG (2010) Reoptimizing the 0-1 knapsack problem. Discrete Appl Math 158(17):1879\u20131887","journal-title":"Discrete Appl Math"},{"issue":"4\u20135","key":"317_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s10732-006-7234-9","volume":"12","author":"J Argelich","year":"2006","unstructured":"Argelich J, Many\u00e0 F (2006) Exact Max-SAT solvers for over-constrained problems. J Heuristics 12(4\u20135):375\u2013392","journal-title":"J Heuristics"},{"issue":"4","key":"317_CR4","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.jda.2008.12.001","volume":"7","author":"G Ausiello","year":"2009","unstructured":"Ausiello G, Escoffier B, Monnot J, Paschos V (2009) Reoptimization of minimum and maximum traveling salesman\u2019s tours. J Discrete Algorithms 7(4):453\u2013463","journal-title":"J Discrete Algorithms"},{"key":"317_CR5","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1142\/9781848162778_0004","volume-title":"Computability in context: computation and logic in the real world","author":"G Ausiello","year":"2011","unstructured":"Ausiello G, Bonifaci V, Escoffier B (2011) Complexity and approximation in reoptimization. In: Cooper SB, Sorbi A (eds) Computability in context: computation and logic in the real world. World Scientific, Singapore, pp 101\u2013129"},{"key":"317_CR6","doi-asserted-by":"crossref","unstructured":"Berg T, Hempel H (2009) Reoptimization of traveling salesperson problems: changing single edge-weights. In: LATA, pp 141\u2013151","DOI":"10.1007\/978-3-642-00982-2_12"},{"key":"317_CR7","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 D, Zych A (2012) New advances in reoptimizing the minimum Steiner tree problem. In: MFCS, pp 184\u2013197","DOI":"10.1007\/978-3-642-32589-2_19"},{"key":"317_CR8","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 D, B\u00f6ckenhauer HJ, Hromkovi\u010d J, Kr\u00e1lovi\u010d R, M\u00f6mke T, Widmayer P, Zych A (2008a) Reoptimization of Steiner trees. In: SWAT, pp 258\u2013269","DOI":"10.1007\/978-3-540-69903-3_24"},{"key":"317_CR9","doi-asserted-by":"crossref","unstructured":"Bil\u00f2 D, Widmayer P, Zych A (2008b) Reoptimization of weighted graph and covering problems. In: WAOA, pp 201\u2013213","DOI":"10.1007\/978-3-540-93980-1_16"},{"issue":"2","key":"317_CR10","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s00453-010-9419-8","volume":"61","author":"D Bil\u00f2","year":"2011","unstructured":"Bil\u00f2 D, B\u00f6ckenhauer HJ, Komm D, Kr\u00e1lovi\u010d R, M\u00f6mke T, Seibert S, Zych A (2011) Reoptimization of the shortest common superstring problem. Algorithmica 61(2):227\u2013251","journal-title":"Algorithmica"},{"key":"317_CR11","doi-asserted-by":"crossref","unstructured":"Blum A, Chalasani P, Coppersmith D, Pulleyblank WR, Raghavan P, Sudan M (1994) The minimum latency problem. In: STOC, pp 163\u2013171","DOI":"10.1145\/195058.195125"},{"issue":"2","key":"317_CR12","first-page":"83","volume":"2","author":"HJ B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer HJ, Forlizzi L, Hromkovic J, Kneis J, Kupke J, Proietti G, Widmayer P (2007) On the approximability of TSP on local modifications of optimally solved instances. Algorithmic Oper Res 2(2):83\u201393","journal-title":"Algorithmic Oper Res"},{"key":"317_CR13","doi-asserted-by":"crossref","unstructured":"B\u00f6ckenhauer HJ, Hromkovi\u010d J, M\u00f6mke T, Widmayer P (2008) On the hardness of reoptimization. In: SOFSEM, pp 50\u201365","DOI":"10.1007\/978-3-540-77566-9_5"},{"key":"317_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.tcs.2014.04.004","volume":"540\u2013541","author":"N Boria","year":"2014","unstructured":"Boria N, Croce FD (2014) Reoptimization in machine scheduling. Theor Comput Sci 540\u2013541:13\u201326","journal-title":"Theor Comput Sci"},{"issue":"3","key":"317_CR15","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1051\/ro\/2011114","volume":"45","author":"N Boria","year":"2011","unstructured":"Boria N, Paschos VT (2011) A survey on combinatorial optimization in dynamic environments. RAIRO Oper Res 45(3):241\u2013294","journal-title":"RAIRO Oper Res"},{"key":"317_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2012.10.037","volume":"514","author":"N Boria","year":"2013","unstructured":"Boria N, Monnot J, Paschos VT (2013) Reoptimization of maximum weight induced hereditary subgraph problems. Theor Comput Sci 514:61\u201374","journal-title":"Theor Comput Sci"},{"key":"317_CR17","doi-asserted-by":"crossref","unstructured":"Chaudhuri K, Godfrey B, Rao S, Talwar K (2003) Paths, trees, and minimum latency tours. In: FOCS, pp 36\u201345","DOI":"10.1109\/SFCS.2003.1238179"},{"key":"317_CR18","unstructured":"Christofides N (1976) Worst-case analysis of a new heuristic for the travelling salesman problem. Technical report 388, Graduate School of Industrial Administration, Carnegie Mellon University"},{"key":"317_CR19","doi-asserted-by":"crossref","unstructured":"Fakcharoenphol J, Harrelson C, Rao S (2007) The \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -traveling repairmen problem. ACM Trans Algorithms 3(4). Article Nr. 40","DOI":"10.1145\/1290672.1290677"},{"key":"317_CR20","unstructured":"Goyal K, M\u00f6mke T (2015) Robust reoptimization of Steiner trees. In: FSTTCS, pp 10\u201324"},{"key":"317_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04616-6","volume-title":"Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics","author":"J Hromkovi\u010d","year":"2001","unstructured":"Hromkovi\u010d J (2001) Algorithmics for hard problems: introduction to combinatorial optimization, randomization, approximation, and heuristics. Springer, New York"},{"key":"317_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.09.006","volume":"243","author":"F Hutter","year":"2017","unstructured":"Hutter F, Lindauer M, Balint A, Bayless S, Hoos H, Leyton-Brown K (2017) The configurable SAT solver challenge (CSSC). Artif Intell 243:1\u201325","journal-title":"Artif Intell"},{"issue":"3","key":"317_CR23","doi-asserted-by":"publisher","first-page":"435","DOI":"10.1016\/j.ipl.2014.11.003","volume":"115","author":"J Monnot","year":"2015","unstructured":"Monnot J (2015) A note on the traveling salesman reoptimization problem under vertex insertion. Inf Process Lett 115(3):435\u2013438","journal-title":"Inf Process Lett"},{"issue":"1","key":"317_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"CH Papadimitriou","year":"1993","unstructured":"Papadimitriou CH, Yannakakis M (1993) The traveling salesman problem with distances one and two. Math Oper Res 18(1):1\u201311","journal-title":"Math Oper Res"},{"issue":"1\u20132","key":"317_CR25","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(96)00042-X","volume":"72","author":"MW Sch\u00e4ffter","year":"1997","unstructured":"Sch\u00e4ffter MW (1997) Scheduling with forbidden sets. Discrete Appl Math 72(1\u20132):155\u2013166","journal-title":"Discrete Appl Math"},{"key":"317_CR26","doi-asserted-by":"crossref","unstructured":"Sitters R (2002) The minimum latency problem is NP-hard for weighted trees. In: IPCO, pp 230\u2013239","DOI":"10.1007\/3-540-47867-1_17"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-018-0317-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0317-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-018-0317-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,10]],"date-time":"2019-06-10T19:13:54Z","timestamp":1560194034000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-018-0317-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,11]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["317"],"URL":"https:\/\/doi.org\/10.1007\/s10878-018-0317-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,6,11]]},"assertion":[{"value":"11 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}