On the Approximability of TSP on Local Modifications of Optimally Solved Instances.
Hans-Joachim BöckenhauerLuca ForlizziJuraj HromkovicJoachim KneisJoachim KupkeGuido ProiettiPeter WidmayerPublished in: Algorithmic Oper. Res. (2007)
Keyphrases
- traveling salesman problem
- travelling salesman
- ant colony optimization
- randomly generated
- optimal solution
- mip solver
- neural network
- approximation algorithms
- optimization problems
- case study
- databases
- scheduling problem
- metaheuristic
- search algorithm
- bayesian networks
- training data
- valid inequalities
- timetabling problem
- initial solution
- website