Logo - springer
Slogan - springer

Mathematics | Theoretical Aspects of Local Search

Theoretical Aspects of Local Search

Michiels, Wil, Aarts, Emile, Korst, Jan

2007, VIII, 235 p. 70 illus.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 
$109.00

(net) price for USA

ISBN 978-3-540-35854-1

digitally watermarked, no DRM

Included Format: PDF

download immediately after purchase


learn more about Springer eBooks

add to marked items

Hardcover
Information

Hardcover version

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$139.00

(net) price for USA

ISBN 978-3-540-35853-4

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$139.00

(net) price for USA

ISBN 978-3-642-07148-5

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

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. It provides the reader with a coherent overview of the achievements obtained so far, but also serves as a source of inspiration for the development of novel results in the challenging field of local search.

Content Level » Research

Keywords » Algorithms - Graph - Graph theory - Sim - algorithm - combinatorial optimization - complexity - complexity theory - heuristics - metaheuristic - optimization

Related subjects » Artificial Intelligence - Mathematics - Theoretical Computer Science

Table of contents / Sample pages 

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Optimization.