CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Global Cut Framework for Removing Symmetries
CP '01 Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
Heuristic Constraint Propagation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Heuristic Constraint Propagation
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Constraints
A framework for constructing complete algorithms based on local search
AI Communications - Constraint Programming for Planning and Scheduling
Scheduling social golfers with memetic evolutionary programming
HM'06 Proceedings of the Third international conference on Hybrid Metaheuristics
A totally unimodular description of the consistent value polytope for binary constraint programming
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
For NP-hard constraint satisfaction problems the existence of a feasible solution cannot be decided efficiently. Applying a tree search often results in the exploration of parts of the search space that do not contain feasible solutions at all. Redundant constraints can help to detect inconsistencies of partial assignments higher up in the search tree. Using the social golfer problem as an example we show how complex redundant constraints can be propagated incompletely using local search heuristics.