Evolving heuristically difficult instances of combinatorial problems.
Bryant A. JulstromPublished in: GECCO (2009)
Keyphrases
- combinatorial problems
- solving hard
- constraint programming
- pseudo boolean
- graph coloring
- graph colouring
- metaheuristic
- constraint satisfaction
- constraint satisfaction problems
- combinatorial optimization
- traveling salesman problem
- maximum satisfiability
- phase transition
- branch and bound algorithm
- global constraints
- hard combinatorial optimization problems
- randomly generated
- satisfiability problem
- combinatorial search
- search space
- search problems
- neural network
- branch and bound
- objective function