{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,10]],"date-time":"2026-03-10T11:49:11Z","timestamp":1773143351038,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540357537","type":"print"},{"value":"9783540357551","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11785293_20","type":"book-chapter","created":{"date-parts":[[2006,6,26]],"date-time":"2006-06-26T05:24:10Z","timestamp":1151299450000},"page":"196-207","source":"Crossref","is-referenced-by-count":23,"title":["Reoptimization of Minimum and Maximum Traveling Salesman\u2019s Tours"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"Escoffier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"20_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(3), 154\u2013159 (2003)","journal-title":"Networks"},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF02283745","volume":"16","author":"M. Bartusch","year":"1988","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: Scheduling project networks with resource constraints and time windows. Ann. Oper. Res.\u00a016, 201\u2013240 (1988)","journal-title":"Ann. Oper. Res."},{"key":"20_CR3","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1016\/0167-9236(89)90013-4","volume":"5","author":"M. Bartusch","year":"1989","unstructured":"Bartusch, M., Mohring, R.H., Radermacher, F.J.: A conceptional outline of a dss for scheduling problems in the building industry. Decision Support Systems\u00a05, 321\u2013344 (1989)","journal-title":"Decision Support Systems"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.ipl.2005.03.011","volume":"95","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processessing Letters\u00a095, 333\u2013342 (2005)","journal-title":"Information Processessing Letters"},{"key":"20_CR5","unstructured":"Christofides, N.: Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 338, Grad School of Industrial Administration, Canergi-Mellon University, Pittsburgh (1976)"},{"issue":"5","key":"20_CR6","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1145\/265910.265914","volume":"44","author":"D. Eppstein","year":"1997","unstructured":"Eppstein, D., Galil, Z., Italiano, G.F., Nissenzweig, A.: Sparsification - a technique for speeding up dynamic graph algorithms. Journal of the ACM\u00a044(5), 669\u2013696 (1997)","journal-title":"Journal of the ACM"},{"key":"20_CR7","series-title":"Combinatorial Optimization","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Combinatorial Optimization. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"20_CR8","unstructured":"Hartvigsen, D.: Extensions of Matching Theory. PhD thesis, Carnegie-Mellon University (1984)"},{"issue":"5","key":"20_CR9","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","volume":"81","author":"R. Hassin","year":"2002","unstructured":"Hassin, R., Rubinstein, S.: A 7\/8-approximation algorithm for metric Max TSP. Information Processessing Letters\u00a081(5), 247\u2013251 (2002)","journal-title":"Information Processessing Letters"},{"key":"20_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1007\/3-540-63165-8_214","volume-title":"Automata, Languages and Programming","author":"M.R. Henzinger","year":"1997","unstructured":"Henzinger, M.R., King, V.: Maintaining minimum spanning trees in dynamic graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds.) ICALP 1997. LNCS, vol.\u00a01256, pp. 594\u2013604. Springer, Heidelberg (1997)"},{"key":"20_CR11","volume-title":"Local search in combinatorial optimization","author":"D.S. Johnson","year":"1997","unstructured":"Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study. In: Aarts, E., Lenstra, J.K. (eds.) Local search in combinatorial optimization. Wiley, Chichester (1997)"},{"key":"20_CR12","volume-title":"Discrete Mathematics and Optimization","author":"E.L. Lawler","year":"1985","unstructured":"Lawler, E.L., Lenstra, J.K., Rinnooy Kan, A.H.G., Shmoys, D.B.: The Traveling Salesman Problem: a guided tour of Combinatorial Optimization. In: Discrete Mathematics and Optimization. Wiley, Chichester (1985)"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Some complexity results for the traveling salesman problem. In: STOC 1976, pp. 1\u20139 (1976)","DOI":"10.1145\/800113.803625"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H., Yannakakis, M.: The traveling salesman problem with distances one and two. Mathematics of Operations Research\u00a018, 1\u201311 (1993)","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"20_CR15","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1137\/0206041","volume":"6","author":"D.J. Rosenkrantz","year":"1977","unstructured":"Rosenkrantz, D.J., Stearns, R.E., Lewis II, P.M.: An analysis of several heuristics for the traveling salesman problem. SIAM J. Comput.\u00a06(3), 563\u2013581 (1977)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"20_CR16","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S., Gonzalez, T.F.: P-complete approximation problems. J. ACM\u00a023(3), 555\u2013565 (1976)","journal-title":"J. ACM"},{"issue":"1-2","key":"20_CR17","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(96)00042-X","volume":"72","author":"M.W. Sch\u00e4ffter","year":"1997","unstructured":"Sch\u00e4ffter, M.W.: Scheduling with forbidden sets. Discrete Applied Mathematics\u00a072(1-2), 155\u2013166 (1997)","journal-title":"Discrete Applied Mathematics"},{"key":"20_CR18","first-page":"80","volume":"25","author":"A.I. Serdyukov","year":"1984","unstructured":"Serdyukov, A.I.: An algorithm with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy (in Russian)\u00a025, 80\u201386 (1984)","journal-title":"Upravlyaemye Sistemy (in Russian)"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11785293_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:19:16Z","timestamp":1619507956000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11785293_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540357537","9783540357551"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11785293_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}