Efficiency of parallel metaheuristics for solving combinatorial problems.
Plamenka BorovskaPublished in: CompSysTech (2007)
Keyphrases
- combinatorial problems
- combinatorial optimization
- solving hard
- metaheuristic
- graph coloring
- constraint programming
- pseudo boolean
- traveling salesman problem
- constraint satisfaction problems
- branch and bound algorithm
- combinatorial search
- optimization problems
- sat encodings
- constraint satisfaction
- simulated annealing
- phase transition
- hard combinatorial optimization problems
- branch and bound
- constraint solvers
- global constraints
- genetic algorithm
- specific problems
- ant colony optimization
- tabu search
- finite domain
- neural network
- vehicle routing problem
- boolean satisfiability
- multi objective
- search space
- optimal solution
- graph colouring