Michiels Wil, Aarts Emile, Korst Jan Theoretical Aspects of Local Search 9783540358534

Варианты приобретения

Цена: 19564.00р.
Кол-во:
Наличие: Поставка под заказ. Есть в наличии на складе поставщика.
Склад Америка: Есть
При оформлении заказа до: 2025-09-15
Ориентировочная дата поставки: Октябрь
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Michiels Wil, Aarts Emile, Korst Jan
Название: Theoretical Aspects of Local Search
Перевод названия: Уил Мичил: Теоретические аспекты локального поиска
ISBN: 9783540358534
Издательство: Springer
Классификация:

Оптимизация

Комбинаторика и теория графов

ISBN-10: 3540358536
Обложка/Формат: Hardback
Страницы: 246
Вес: 0.53 кг.
Дата издания: 2007
Серия: Monographs in theoretical computer science : an eatcs series
Язык: English
Иллюстрации: 70 black & white illustrations, 3 black & white tables, biography
Размер: 23.85 x 16.81 x 1.78
Читательская аудитория: Postgraduate, research & scholarly
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: Local search has been applied successfully to a diverse collection of optimization problems. Its 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.
Дополнительное описание: Формат: 235x155
Илюстрации: 70
Круг читателей: Researchers, graduate students
Ключевые слова: Local search
Combinatorial optimization
Performance guarantees
Polynomial-time local search (PLS)
PLS-completeness
Asymptotic convergence
Язык: eng
Оглавление: Introduction.- Basic Examples.- Indirect Solution Representations.- Properties of Neighborhood Functions.- Performance Guarantees.- Time Complexity.- Metaheuristics.- Asymptotic Convergence of Simulated Annealing.- Appendices: Graph Theory; Complexity Theory and Approximation Algorithms; PLS-Complete Problems.- Bibliography.- Author Index.- Subject Index.

Theoretical Aspects of Local Search, Michiels Wil, Aarts Emile, Korst Jan