Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems
ARIDAM III Selected papers on Third advanced research institute of discrete applied mathematics
Some concepts of stability analysis in combinatorial optimization
Proceedings of the workshop on Discrete algorithms
Advances in computational and stochastic optimization, logic programming, and heuristic search
Stability aspects of the traveling salesman problem based on k-best solutions
Discrete Applied Mathematics
On the complexity of postoptimality analysis of 0/1 programs
Discrete Applied Mathematics
The vehicle routing problem
The Parameterized Approximability of TSP with Deadlines
Theory of Computing Systems
Reoptimization of Steiner Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Reoptimization of Steiner trees: Changing the terminal set
Theoretical Computer Science
On the hardness of reoptimization
SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
On the approximation hardness of some generalizations of TSP
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Reoptimization of minimum and maximum traveling salesman's tours
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Reoptimization of the Shortest Common Superstring Problem
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Knowing all optimal solutions does not help for TSP reoptimization
Computation, cooperation, and life
Steiner tree reoptimization in graphs with sharpened triangle inequality
Journal of Discrete Algorithms
The steiner tree reoptimization problem with sharpened triangle inequality
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
On the Hardness of Reoptimization with Multiple Given Solutions
Fundamenta Informaticae - Theory that Counts: To Oscar Ibarra on His 70th Birthday
New advances in reoptimizing the minimum steiner tree problem
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
The reoptimization version of an optimization problem deals with the following scenario: Given an input instance together with an optimal solution for it, the objective is to find a high-quality solution for a locally modified instance.In this paper, we investigate several reoptimization variants of the traveling salesman problem with deadlines in metric graphs (Δ-DlTSP). The objective in the Δ-DlTSPis to find a minimum-cost Hamiltonian cycle in a complete undirected graph with a metric edge cost function which visits some of its vertices before some prespecified deadlines. As types of local modifications, we consider insertions and deletions of a vertex as well as of a deadline.We prove the hardness of all of these reoptimization variants and give lower and upper bounds on the achievable approximation ratio which are tight in most cases.