Learning vector quantization for variable ordering in constraint satisfaction problems.
José Carlos Ortiz-BaylissHugo Terashima-MarínSantiago Enrique Conant-PablosPublished in: Pattern Recognit. Lett. (2013)
Keyphrases
- learning vector quantization
- variable ordering
- constraint satisfaction problems
- forward checking
- branch and bound algorithm
- constraint satisfaction
- propositional satisfiability
- np hard
- sat problem
- constraint programming
- max sat
- np complete
- self organizing maps
- neural network
- constraint propagation
- search space
- arc consistency
- non binary
- constraint networks
- temporal constraints
- path consistency
- global constraints
- randomly generated
- sat solvers
- orders of magnitude
- linear programming
- lower bound
- symmetry breaking
- computational complexity
- data structure