Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems.
Andrew M. SuttonPublished in: GECCO (2014)
Keyphrases
- combinatorial problems
- lower bound
- branch and bound algorithm
- constraint programming
- evolutionary algorithm
- upper bound
- metaheuristic
- branch and bound
- combinatorial optimization
- graph coloring
- traveling salesman problem
- constraint satisfaction problems
- optimization problems
- solving hard
- constraint satisfaction
- objective function
- np hard
- optimal solution
- randomly generated
- combinatorial search
- enterprise architecture
- worst case
- phase transition
- simulated annealing
- vc dimension
- hard combinatorial optimization problems
- global constraints
- max sat
- search space
- specific problems
- boolean satisfiability
- neural network
- fitness function
- search strategies
- graph colouring
- computational complexity
- column generation
- constraint propagation