Ågren, Magnus and Flener, Pierre and Pearson, Justin (2005) Set variables and local search. In: Proceedings of CP-AI-OR'05, 29 May - 1 June 2005, Prague, Czech Republic.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/11493853_4
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Deposited By:||Magnus Å gren|
|Deposited On:||12 Oct 2009|
|Last Modified:||18 Nov 2009 16:25|
Repository Staff Only: item control page