Automatic generation of redundant models for permutation constraint satisfaction problems
From MaRDI portal
Publication:2460256
DOI10.1007/s10601-007-9024-xzbMath1125.68112OpenAlexW2130779728MaRDI QIDQ2460256
Barbara M. Smith, Jimmy Ho-man Lee, Yat Chiu Law
Publication date: 14 November 2007
Published in: Constraints (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10601-007-9024-x
Related Items (2)
Progress towards the Holy Grail ⋮ Redundant modeling in permutation weighted constraint satisfaction problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Symmetry breaking constraints for value symmetries in constraint satisfaction
- Solving non-Boolean satisfiability problems with stochastic local search: A comparison of encodings
- Consistency in networks of relations
- Increasing constraint propagation by redundant modeling: An experience report
- An optimal coarse-grained arc consistency algorithm
- Permutation Problems and Channelling Constraints
- Removing propagation redundant constraints in redundant modeling
- Theory and Applications of Satisfiability Testing
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
- Principles and Practice of Constraint Programming – CP 2003
This page was built for publication: Automatic generation of redundant models for permutation constraint satisfaction problems