Theoretical aspects of local search

Research output: Book/ReportBookAcademic

Abstract

Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.
LanguageEnglish
Place of PublicationBerlin
PublisherSpringer
ISBN (Electronic)9783540358541
ISBN (Print)9783540358534
StatePublished - 2007

Publication series

NameMonographs in theoretical computer science
ISSN (Print)1431-2654

Fingerprint

inspiration
optimization
readers

Cite this

Michiels, W. P. A. J., Aarts, E. H. L., & Korst, J. H. M. (2007). Theoretical aspects of local search. (Monographs in theoretical computer science). Berlin: Springer.
Michiels, W.P.A.J. ; Aarts, E.H.L. ; Korst, J.H.M./ Theoretical aspects of local search. Berlin : Springer, 2007. (Monographs in theoretical computer science).
@book{6c3fac34e11f469ea9790c7f659413e3,
title = "Theoretical aspects of local search",
abstract = "Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.",
author = "W.P.A.J. Michiels and E.H.L. Aarts and J.H.M. Korst",
year = "2007",
language = "English",
isbn = "9783540358534",
series = "Monographs in theoretical computer science",
publisher = "Springer",
address = "Germany",

}

Michiels, WPAJ, Aarts, EHL & Korst, JHM 2007, Theoretical aspects of local search. Monographs in theoretical computer science, Springer, Berlin.

Theoretical aspects of local search. / Michiels, W.P.A.J.; Aarts, E.H.L.; Korst, J.H.M.

Berlin : Springer, 2007. (Monographs in theoretical computer science).

Research output: Book/ReportBookAcademic

TY - BOOK

T1 - Theoretical aspects of local search

AU - Michiels,W.P.A.J.

AU - Aarts,E.H.L.

AU - Korst,J.H.M.

PY - 2007

Y1 - 2007

N2 - Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.

AB - Local search has been applied successfully to a diverse collection of optimization problems. It's appreciated for its basic conceptual foundation, its general applicability, and its power to serve as a source for new search paradigms. The typical characteristics of combinatorial optimization problems to which local search can be applied, its relation to complexity theory, and the combination with randomized search features have led to a wealth of interesting theoretical results. However, these results are scattered throughout the literature. This is the first book that presents a large collection of theoretical results in a consistent manner, thus providing the reader with a coherent overview of the achievements obtained so far, but also serving as a source of inspiration for the development of novel results in the challenging field of local search.

UR - http://www.springerlink.com/openurl.asp?genre=book&isbn=978-3-540-35853-4

M3 - Book

SN - 9783540358534

T3 - Monographs in theoretical computer science

BT - Theoretical aspects of local search

PB - Springer

CY - Berlin

ER -

Michiels WPAJ, Aarts EHL, Korst JHM. Theoretical aspects of local search. Berlin: Springer, 2007. (Monographs in theoretical computer science).