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
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
The Parameterized Approximability of TSP with Deadlines
Theory of Computing Systems
Approximation hardness of deadline-TSP reoptimization
Theoretical Computer Science
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
Structural properties of hard metric TSP inputs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Algorithmics – is there hope for a unified theory?
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Reoptimization of the maximum weighted Pk-free subgraph problem under vertex insertion
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Reoptimization of some maximum weight induced hereditary subgraph problems
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Reoptimizing the strengthened metric TSP on multiple edge weight modifications
SEA'12 Proceedings of the 11th international conference on Experimental Algorithms
Reoptimizing the rural postman problem
Computers and Operations Research
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical 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 (@D-DlTSP). The objective in the @D-DlTSP is 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.