Constraint Programming Can Help Ants Solving Highly Constrainted Combinatorial Problems.
Broderick CrawfordCarlos CastroÉric MonfroyPublished in: ICSOFT (PL/DPS/KE) (2008)
Keyphrases
- combinatorial problems
- constraint programming
- solving hard
- graph coloring
- search heuristics
- metaheuristic
- finite domain
- constraint problems
- combinatorial optimization
- constraint optimization
- constraint satisfaction problems
- constraint solvers
- combinatorial search
- global constraints
- constraint satisfaction
- constraint propagation
- sat encodings
- search strategies
- column generation
- integer programming
- symmetry breaking
- constraint logic programming
- arc consistency
- cellular automata
- optimization problems
- constraint solving
- constraint solver
- ant colony optimization
- simulated annealing
- search space
- solving problems
- phase transition
- traveling salesman problem
- np hard