Finding approximate solutions of NP-hard optimization and TSP problems using elephant search algorithm.
Suash DebSimon FongZhonghuan TianRaymond K. WongSabah MohammedJinan FiaidhiPublished in: J. Supercomput. (2016)
Keyphrases
- approximate solutions
- np hard
- optimal solution
- search algorithm
- optimization problems
- np complete
- scheduling problem
- np hardness
- approximation algorithms
- lower bound
- hard optimization problems
- integer programming
- worst case
- np hard problems
- decision problems
- finding the optimal solution
- linear program
- linear programming
- greedy heuristic
- min sum
- exact solution
- computationally challenging
- optimization method
- branch and bound algorithm
- traveling salesman problem
- combinatorial optimization
- energy function
- optimization algorithm
- special case
- computational complexity
- global search
- global optimization
- genetic algorithm
- computationally hard
- image processing