Abstract
Recently, many algorithms have been designed to propagate global constraints. Unfortunately, some global constraints, such the At-Most-1 constraint and the Extended-GCC are NP-Hard to propagate. Often, these constraints can easily be written as integer linear programs. Using linear relaxations and other techniques developed by the operation research community, we want to efficiently propagate such constraints.
We model constraints as integer programs that we relax into linear programs. For each value v in a variable domain dom(x), we create a binary variable x v . The assignment x v = 1 indicates that x = v while x v = 0 indicates that x ≠ v.
This is joint work with Emmanuel Hebrard and Toby Walsh.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Guler, O., Ye, Y.: Convergence behavior of interior-point algorithms. Mathematical Programming 60, 215–228 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Quimper, CG., López-Ortiz, A. (2005). From Linear Relaxations to Global Constraint Propagation. In: van Beek, P. (eds) Principles and Practice of Constraint Programming - CP 2005. CP 2005. Lecture Notes in Computer Science, vol 3709. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11564751_105
Download citation
DOI: https://doi.org/10.1007/11564751_105
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-29238-8
Online ISBN: 978-3-540-32050-0
eBook Packages: Computer ScienceComputer Science (R0)