uu.seUppsala University Publications
Change search
ReferencesLink to record
Permanent link

Direct link
Set Variables and Local Search
Uppsala University, Teknisk-naturvetenskapliga vetenskapsområdet, Mathematics and Computer Science, Department of Information Technology. Faculty of Science and Technology, Biology, Department of Ecology and Evolution, Computing Science. Datalogi. (ASTRA)
2004 (English)Report (Other scientific)
Abstract [en]

Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This modelling device has been around for quite some time in the constraint programming area, and proved its usefulness in many applications. This paper introduces set variables and set constraints also in the local search area. It presents a way of representing set variables in the local search context, where we deal with concepts like transition functions, neighbourhoods, and penalty costs. Furthermore, some common set constraints and their penalty costs are defined. These constraints are later used to model three problems and some initial experimental results are reported.

Place, publisher, year, edition, pages
, Technical reports from the Department of Information Technology, ISSN 1404-3203 ; 2004-015
National Category
Computer Science
URN: urn:nbn:se:uu:diva-70138OAI: oai:DiVA.org:uu-70138DiVA: diva2:98049
Available from: 2005-04-15 Created: 2005-04-15

Open Access in DiVA

No full text

Other links


Search in DiVA

By author/editor
Ågren, Magnus
By organisation
Department of Information TechnologyComputing Science
Computer Science

Search outside of DiVA

GoogleGoogle Scholar
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

Total: 60 hits
ReferencesLink to record
Permanent link

Direct link