Theoretical Aspects of Local Search

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 pr...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autores principales: Michiels, Wil (Autor), Aarts, Emile (Autor), Korst, Jan (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2007.
Edición:1st ed. 2007.
Colección:Monographs in Theoretical Computer Science. An EATCS Series,
Temas:
Mathematical optimization.
Discrete mathematics.
Computer science-Mathematics.
Algorithms.
Computer science.
Artificial intelligence.
Optimization.
Discrete Mathematics.
Mathematics of Computing.
Theory of Computation.
Artificial Intelligence.
Acceso en línea:Texto Completo
Tabla de Contenidos:
  • Basic Examples
  • Indirect Solution Representations
  • Properties of Neighborhood Functions
  • Performance Guarantees
  • Time Complexity
  • Metaheuristics
  • Asymptotic Convergence of Simulated Annealing.

Ejemplares similares