Set Variables and Local Search

Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming community, and solvers based on constructive search for set variables have been around for a long time. In this paper, set variables and set constraints are put into a local-search framework, where concepts such as configurations, penalties, and neighbourhood functions are dealt with generically. This scheme is then used to define the penalty functions for five (global) set constraints, and to model and solve two well-known applications.

• Type: Conference
• Year: 2004
• Where: CP
• Authors: Magnus Ågren
• Keywords: Artificial Intelligence, Constraint Programming Community, CP 2004, Set Constraints, Set Variables