A theoretical framework for local search techniques. In pages 335-342, 2008.
doi  abstract   bibtex   
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. © 2008 IEEE.
@inproceedings{10.1109/CSE.2008.40,
    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. © 2008 IEEE.",
    year = "2008",
    title = "A theoretical framework for local search techniques",
    pages = "335-342",
    doi = "10.1109/CSE.2008.40",
    journal = "Proceedings - 2008 IEEE 11th International Conference on Computational Science and Engineering, CSE 2008"
}

Downloads: 0