A theoretical framework for local search techniques

Eric Monfroy, Frédéric Saubion, BRODERICK CRAWFORD LABRIN, Carlos Castro

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

In the paper we describe a theoretical framework to model local search as the computation of a fixed point of functions. There are only few studies of theoretical frameworks for local search, this work allows one to simulate standard strategies used for local search and to easily design new strategies in a uniform framework. The use of this framework is illustrated through the description of Tabu Search and Random Walk methods for solving different instances of Sudoku problem.

Original languageEnglish
Title of host publicationProceedings - 2008 IEEE 11th International Conference on Computational Science and Engineering, CSE 2008
Pages335-342
Number of pages8
DOIs
StatePublished - 22 Sep 2008
Event2008 IEEE 11th International Conference on Computational Science and Engineering, CSE 2008 - Sao Paulo, SP, Brazil
Duration: 16 Jul 200818 Jul 2008

Publication series

NameProceedings - 2008 IEEE 11th International Conference on Computational Science and Engineering, CSE 2008

Conference

Conference2008 IEEE 11th International Conference on Computational Science and Engineering, CSE 2008
CountryBrazil
CitySao Paulo, SP
Period16/07/0818/07/08

Fingerprint Dive into the research topics of 'A theoretical framework for local search techniques'. Together they form a unique fingerprint.

Cite this