Qualitative smooth dynamics in combinatorial problems based on a notion of concentration.
Erik I. VerriestMile MilisavljevicPublished in: Neural Parallel Sci. Comput. (1999)
Keyphrases
- combinatorial problems
- constraint programming
- constraint satisfaction problems
- metaheuristic
- traveling salesman problem
- combinatorial optimization
- solving hard
- constraint satisfaction
- graph coloring
- phase transition
- branch and bound algorithm
- graph colouring
- optimization problems
- global constraints
- dynamical systems
- hard combinatorial optimization problems
- qualitative and quantitative
- integer programming
- specific problems
- evolutionary algorithm
- combinatorial search
- sat encodings
- state space
- neural network
- maximum satisfiability
- objective function
- qualitative spatial reasoning
- constraint propagation
- simulated annealing
- search strategies
- ant colony optimization