On the Smoothed Complexity of Combinatorial Local Search.
Yiannis GiannakopoulosAlexander GroszThemistoklis MelissourgosPublished in: CoRR (2022)
Keyphrases
- search algorithm
- worst case
- memetic algorithm
- search space
- computational cost
- data sets
- simulated annealing
- systematic search
- neighborhood search
- global search
- space complexity
- search procedure
- search strategies
- decision problems
- particle swarm optimization
- lower bound
- computational complexity
- case study
- decision trees
- genetic algorithm