Tractable Symmetry Breaking for CSPs with Interchangeable Values.
Pascal Van HentenryckPierre FlenerJustin PearsonMagnus ÅgrenPublished in: IJCAI (2003)
Keyphrases
- symmetry breaking
- constraint programming
- constraint satisfaction problems
- search tree
- global constraints
- quantified boolean formulae
- graph coloring
- np complete
- integer linear programming
- computational complexity
- np hard
- constraint satisfaction
- simulated annealing
- symmetry breaking constraints
- multi dimensional
- linear programming