Superpolynomial Lower Bounds for the (1+1) EA on Some Easy Combinatorial Problems.
Andrew M. SuttonPublished in: Algorithmica (2016)
Keyphrases
- combinatorial problems
- lower bound
- branch and bound algorithm
- evolutionary algorithm
- upper bound
- constraint programming
- metaheuristic
- graph coloring
- branch and bound
- combinatorial optimization
- traveling salesman problem
- constraint satisfaction
- solving hard
- constraint satisfaction problems
- randomly generated
- simulated annealing
- phase transition
- optimal solution
- np hard
- combinatorial search
- optimization problems
- worst case
- global constraints
- enterprise architecture
- boolean satisfiability
- graph colouring
- objective function
- max sat
- fitness function
- hard combinatorial optimization problems
- genetic algorithm