The Parameterized Complexity of Local Search for TSP, More Refined.
Jiong GuoSepp HartungRolf NiedermeierOndrej SuchýPublished in: Algorithmica (2013)
Keyphrases
- parameterized complexity
- combinatorial optimization
- search space
- traveling salesman problem
- genetic algorithm
- optimal solution
- fixed parameter tractable
- search algorithm
- np hard
- symmetry breaking
- ant colony optimization
- global constraints
- optimization problems
- simulated annealing
- branch and bound
- tabu search
- knapsack problem
- search tree
- combinatorial problems
- computational problems