An efficient approach by adjusting bounds for heuristic optimization algorithms.
Mehmet Alper SofuogluFatih Hayati ÇakirSelim GürgenPublished in: Soft Comput. (2019)
Keyphrases
- combinatorial optimization
- optimization problems
- discrete optimization
- optimization methods
- computational complexity
- error bounds
- worst case
- times faster
- learning algorithm
- worst case analysis
- average case
- upper and lower bounds
- computational efficiency
- computationally efficient
- upper bound
- computational cost
- optimization algorithm
- global optimization
- search methods
- simulated annealing
- lower bound
- exact algorithms
- search algorithm
- greedy heuristic
- randomized algorithm
- genetic algorithm
- confidence bounds