The Parameterized Complexity of Local Search for TSP, More Refined.
Jiong GuoSepp HartungRolf NiedermeierOndrej SuchýPublished in: ISAAC (2011)
Keyphrases
- parameterized complexity
- combinatorial optimization
- search space
- traveling salesman problem
- genetic algorithm
- optimal solution
- fixed parameter tractable
- search algorithm
- np hard
- global constraints
- simulated annealing
- tabu search
- combinatorial problems
- metaheuristic
- ant colony optimization
- optimization problems
- symmetry breaking
- constraint satisfaction problems
- heuristic search
- search strategies
- search procedures
- special case