Using polynomial reductions to test the suitability of metaheuristics for solving NP-complete problems.
Pablo RabanalIsmael RodríguezPublished in: SAC (2013)
Keyphrases
- np complete problems
- np complete
- graph coloring
- phase transition
- combinatorial problems
- sat problem
- hard problems
- particle swarm optimization
- suboptimal solutions
- optimal solution
- metaheuristic
- combinatorial optimization
- optimization problems
- job shop scheduling
- scheduling problem
- search space
- constraint satisfaction
- cellular automata
- satisfiability problem
- computational complexity
- genetic algorithm