{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:19:38Z","timestamp":1725517178934},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540852377"},{"type":"electronic","value":"9783540852384"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-85238-4_12","type":"book-chapter","created":{"date-parts":[[2008,8,18]],"date-time":"2008-08-18T11:34:36Z","timestamp":1219059276000},"page":"156-167","source":"Crossref","is-referenced-by-count":5,"title":["Reoptimization of the Metric Deadline TSP"],"prefix":"10.1007","author":[{"given":"Hans-Joachim","family":"B\u00f6ckenhauer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dennis","family":"Komm","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_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, M.G.: Reoptimizing the traveling salesman problem. Networks\u00a042, 154\u2013159 (2003)","journal-title":"Networks"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1007\/11785293_20","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"G. Ausiello","year":"2006","unstructured":"Ausiello, G., Escoffier, B., Monnot, J., Paschos, V.T.: Reoptimization of Minimum and Maximum Traveling Salesman\u2019s Tours. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 196\u2013207. Springer, Heidelberg (2006)"},{"key":"12_CR3","unstructured":"Bil\u00f2, D., B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., M\u00f6mke, T., Widmayer, P., Zych, A.: Reoptimization of Steiner trees. In: Proc.\u00a0of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008) (to appear, 2008)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-0-387-34735-6_21","volume-title":"Proc. of the 4th IFIP International Conference on Theoretical Computer Science (IFIP TCS 2006)","author":"H.-J. B\u00f6ckenhauer","year":"2006","unstructured":"B\u00f6ckenhauer, H.-J., Forlizzi, L., Hromkovic, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: Reusing optimal TSP solutions for locally modified input instances (extended abstract). In: Proc. of the 4th IFIP International Conference on Theoretical Computer Science (IFIP TCS 2006), pp. 251\u2013270. Springer, Heidelberg (2006)"},{"issue":"2","key":"12_CR5","first-page":"83","volume":"2","author":"H.-J. B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.-J., Forlizzi, L., Hromkovi\u010d, J., Kneis, J., Kupke, J., Proietti, G., Widmayer, P.: On the approximability of TSP on local modifications of optimally solved instances. Algorithmic Operations Research\u00a02(2), 83\u201393 (2007)","journal-title":"Algorithmic Operations Research"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/11785293_19","volume-title":"Algorithm Theory \u2013 SWAT 2006","author":"H.-J. B\u00f6ckenhauer","year":"2006","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kneis, J., Kupke, J.: On the Approximation Hardness of Some Generalizations of TSP. In: Arge, L., Freivalds, R. (eds.) SWAT 2006. LNCS, vol.\u00a04059, pp. 184\u2013195. Springer, Heidelberg (2006)"},{"issue":"3","key":"12_CR7","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s00224-007-1347-x","volume":"41","author":"H.-J. B\u00f6ckenhauer","year":"2007","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kneis, J., Kupke, J.: The parameterized approximability of TSP with deadlines. Theory of Computing Systems\u00a041(3), 431\u2013444 (2007)","journal-title":"Theory of Computing Systems"},{"key":"12_CR8","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., M\u00f6mke, T., Rossmanith, P.: Reoptimization of Steiner trees: changing the terminal set. Theoretical Computer Science (to appear)"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-77566-9_5","volume-title":"SOFSEM 2008: Theory and Practice of Computer Science","author":"H.-J. B\u00f6ckenhauer","year":"2008","unstructured":"B\u00f6ckenhauer, H.-J., Hromkovi\u010d, J., M\u00f6mke, T., Widmayer, P.: On the Hardness of Reoptimization. In: Geffert, V., Karhum\u00e4ki, J., Bertoni, A., Preneel, B., N\u00e1vrat, P., Bielikov\u00e1, M. (eds.) SOFSEM 2008. LNCS, vol.\u00a04910, pp. 50\u201365. Springer, Heidelberg (2008)"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Desaulniers, G., Desrosiers, J., Solomon, M.M., Soumis, F.: VRP with time windows. In: Toth, P., Vigo, D. (eds.) The Vehicle Routing Problem, SIAM 2001, pp. 157\u2013193 (2001)","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"12_CR11","unstructured":"Escoffier, B., Milani\u010d, M., Paschos, V.T.: Simple and fast reoptimizations for the Steiner tree problem. DIMACS Technical Report 2007-01 (2007)"},{"key":"12_CR12","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-1-4757-2807-1_4","volume-title":"Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search","author":"H. Greenberg","year":"1998","unstructured":"Greenberg, H.: An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: Woodruff, D.L. (ed.) Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, pp. 97\u2013148. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"12_CR13","unstructured":"Kr\u00e1lovi\u010d, R., M\u00f6mke, T.: Approximation hardness of the traveling salesman reoptimization problem. In: Proc.of the 3rd Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2007), pp. 97\u2013104 (2007)"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1016\/0166-218X(91)90044-W","volume":"30","author":"M. Libura","year":"1991","unstructured":"Libura, M.: Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discrete Applied Mathematics\u00a030, 197\u2013211 (1991)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR15","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0166-218X(98)00055-9","volume":"87","author":"M. Libura","year":"1998","unstructured":"Libura, M., van der Poort, E.S., Sierksma, G., van der Veen, J.A.A.: Stability aspects of the traveling salesman problem based on k-best solutions. Discrete Applied Mathematics\u00a087, 159\u2013185 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0166-218X(93)E0126-J","volume":"58","author":"Y.N. Sotskov","year":"1995","unstructured":"Sotskov, Y.N., Leontev, V.K., Gordeev, E.N.: Some concepts of stability analysis in combinatorial optimization. Discrete Appl.Math.\u00a058, 169\u2013190 (1995)","journal-title":"Discrete Appl.Math."},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/S0166-218X(98)00151-6","volume":"91","author":"S. Hoesel Van","year":"1999","unstructured":"Van Hoesel, S., Wagelmans, A.: On the complexity of postoptimality analysis of 0\/1 programs. Discrete Applied Mathematics\u00a091, 251\u2013263 (1999)","journal-title":"Discrete Applied Mathematics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2008"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85238-4_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T11:30:07Z","timestamp":1558265407000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85238-4_12"}},"subtitle":["(Extended Abstract)"],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540852377","9783540852384"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85238-4_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}