Reusing Optimal TSP Solutions for Locally Modified Input Instances
- 14 December 2006
- book chapter
- Published by Springer Nature
- p. 251-270
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- The Parameterized Approximability of TSP with DeadlinesTheory of Computing Systems, 2007
- On the Approximation Hardness of Some Generalizations of TSP2006
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problemTheoretical Computer Science, 2002
- On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequalityNetworks, 2001
- Approximation algorithms for the TSP with sharpened triangle inequalityInformation Processing Letters, 2000
- Improved Lower Bounds on the Approximability of the Traveling Salesman ProblemRAIRO - Theoretical Informatics and Applications, 2000
- Approximation Algorithms with Bounded Performance Guarantees for the Clustered Traveling Salesman ProblemAlgorithmica, 2000
- Performance guarantees for the TSP with a parameterized triangle inequalityInformation Processing Letters, 2000
- An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization1998
- Performance Guarantees for Approximation Algorithms Depending on Parametrized Triangle InequalitiesSIAM Journal on Discrete Mathematics, 1995