Abstract
For some time now, set variables and set constraints have been around in the Constraint Programming (CP) area. Most of the popular CP systems of today for global search have features for modelling problems using set variables, i.e., decision variables taking values that are subsets of some universe. Consider, for instance, the work by Gervet and Puget.
Many problems have natural models using set variables. Classical examples include the set partitioning problem and the set covering problem. However, such problems also appear frequently as sub-problems in many real-life applications. Examples include airline-crew rostering, tournament scheduling, and time-tabling. To be able to reason about these problems at the higher level that set variables mean may reduce the modelling and solving time and increase the understanding of an application considerably. Since this is already known from global search, we believe that it should be put also in a local search framework.
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
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ågren, M. (2004). Set Variables and Local Search. In: Wallace, M. (eds) Principles and Practice of Constraint Programming – CP 2004. CP 2004. Lecture Notes in Computer Science, vol 3258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30201-8_67
Download citation
DOI: https://doi.org/10.1007/978-3-540-30201-8_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23241-4
Online ISBN: 978-3-540-30201-8
eBook Packages: Springer Book Archive