Ants can solve constraint satisfaction problems.
Christine SolnonPublished in: IEEE Trans. Evol. Comput. (2002)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- finding optimal solutions
- constraint programming
- graph coloring problems
- constraint propagation
- search space
- np complete
- combinatorial problems
- non binary
- constraint solving
- np hard
- decomposition methods
- soft constraints
- solving planning problems
- arc consistency
- constraint optimization
- constraint networks
- computational problems
- constraint problems
- solving constraint satisfaction problems
- backtracking search
- finite domain
- constraint solver
- sat problem
- lower bound
- heuristic search
- mathematical programming
- pseudo boolean optimization
- linear programming
- forward checking
- cellular automata
- phase transition