Abstract
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.
This work was partly supported by the German Science Foundation (DFG) project SFB-376. An earlier version of this paper appeared as [8].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Beldiceanu. An Example of Introduction of Global Constraints in CHIP: Application to Block Theory Problems, ECRC Tech. Report TR-LP-49, May 1990.
CSPLib: a problem library for constraints, maintained by I. P. Gent, T. Walsh, B. Selman, http://www-users.cs.york.ac.uk/~tw/csplib/
T. Fahle, S. Schamberger, M. Sellmann. Symmetry Breaking, Proc. of CP’01, LNCS 2239, pp. 93–107, 2001.
F. Focacci, F. Laburthe, A. Lodi. Local Search and Constraint Programming, Handbook of Metaheuristic, Kluwer Academic Publishers, to appear.
F. Focacci and M. Milano. Global Cut Framework for Removing Symmetries, Proc. of CP’01, LNCS 2239, pp. 77–92, 2001.
I. P. Gent and B. M. Smith. Symmetry Breaking During Search in Constraint Programming, Proc. of ECAI’2000, pp. 599–603, 2000.
W. Harvey. Warwick’s Results Page for the Social Golfer Problem, http://www.icparc.ic.ac.uk/~wh/golf/
M. Sellmann and W. Harvey. Heuristic Constraint Propagation, Proc. of CPAIOR’02, Le Croisic, France, pp. 191–204, March 2002.
ILOG. ILOG Solver. Reference manual and user manual. V5.0, ILOG, 2000.
B. Smith. Reducing Symmetry in a Combinatorial Design Problem, Proc. of CPAIOR’01, Wye, UK, pp. 351–360, April 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sellmann, M., Harvey, W. (2002). Heuristic Constraint Propagation. In: Van Hentenryck, P. (eds) Principles and Practice of Constraint Programming - CP 2002. CP 2002. Lecture Notes in Computer Science, vol 2470. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46135-3_55
Download citation
DOI: https://doi.org/10.1007/3-540-46135-3_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44120-5
Online ISBN: 978-3-540-46135-7
eBook Packages: Springer Book Archive