Theoretical Aspects of Local Search

  • Wil Michiels
  • Jan Korst
  • Emile Aarts
Part of the Monographs in Theoretical Computer Science, An EATCS Series book series (EATCS)

Table of contents

  1. Front Matter
    Pages I-VIII
  2. Pages 1-10
  3. Pages 11-38
  4. Pages 97-134
  5. Pages 135-147
  6. Back Matter
    Pages 187-238

About this book

Introduction

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.

Keywords

Algorithms Graph Graph theory Sim algorithm combinatorial optimization complexity complexity theory heuristics metaheuristic optimization

Authors and affiliations

  • Wil Michiels
    • 1
  • Jan Korst
    • 1
  • Emile Aarts
    • 1
    • 2
  1. 1.Philips ResearchEindhovenThe Netherlands
  2. 2.Eindhoven University of TechnologyEindhovenThe Netherlands

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-540-35854-1
  • Copyright Information Springer-Verlag Berlin Heidelberg 2007
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-35853-4
  • Online ISBN 978-3-540-35854-1
  • Series Print ISSN 1431-2654
  • About this book