Reoptimization of minimum and maximum traveling salesman's tours
type: Item
instance of: scholarly article
title: Reoptimization of minimum and maximum traveling salesman's tours
zbMATH Open document ID: 1180.90259
author: Giorgio Ausiello
author: Bruno Escoffier
author: Jérôme Monnot
author: Vangelis Th. Paschos
published in: Journal of Discrete Algorithms
publication date: 2009-12-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5645008
zbMATH Keywords: approximation algorithms
zbMATH Keywords: reoptimization
zbMATH Keywords: traveling salesman problem
MaRDI profile type: Publication
full work available at URL: j.jda.2008.12.001
OpenAlex ID: W2043636453
cites work: Reoptimizing the traveling salesman problem
cites work: Complexity and approximation in reoptimization
cites work: Q3468865
cites work: Reoptimization of Steiner Trees
cites work: Improved deterministic approximation algorithms for max TSP
cites work: Sparsification—a technique for speeding up dynamic graph algorithms
cites work: Simple and fast reoptimizations for the Steiner tree problem
cites work: Q4198056
cites work: The traveling salesman problem and its variations
cites work: A \(\frac78\)-approximation algorithm for metric Max TSP
cites work: Maintaining minimum spanning trees in dynamic graphs
cites work: Q4365133
cites work: Q5187226
cites work: Q4146536
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem
cites work: P-Complete Approximation Problems
cites work: Scheduling with forbidden sets
cites work: Q3686457
DOI: 10.1016/J.JDA.2008.12.001
description: scientific article; zbMATH DE number 5645008