
As an Amazon Associate and affiliate partner, Menrva Books earns from qualifying purchases. Learn more
Author description coming soon. We're reaching out to them in the ether...
This book investigates the theoretical underpinnings of local search algorithms. It delves into the mathematical foundations and algorithmic structures that define local search, a class of optimization techniques. The work aims to provide a rigorous analysis of these methods, exploring their performance characteristics and limitations within various computational problem domains.
This text is likely to be a dense, academic treatment of local search algorithms, aimed at researchers and advanced students in computer science and operations research. Its focus on theoretical aspects suggests it will appeal to those seeking a deep understanding of the mathematical foundations and analytical properties of these optimization techniques. The book's rigor and comprehensive coverage of theoretical results would make it a valuable reference for specialists in the field.
Page Count:
238
Publication Date:
2007-01-01
ISBN-10:
3540358536
ISBN-13:
9783540358534
No comments yet. Be the first to share your thoughts!