Local Search in Combinatorial Optimization (Wiley Series in Discrete Mathematics & Optimization) [Hardcover]

Emile Aarts (Editor), Jan Karel Lenstra (Editor)

Book Description

ISBN-10: 0471948225 | ISBN-13: 978-0471948223 | Publication Date: June 1997 | Edition: 1

Wiley-Interscience Series in Discrete Mathematics and Optimization Advisory Editors Ronald L. Graham Jan Karel Lenstra Robert E. Tarjan Discrete Mathematics and Optimization involves the study of finite structures and is one of the fastest growing areas in mathematics today. The level and depth of recent advances in the area and the wide applicability of its evolving techniques point to the rapidity with which the field is moving and presage the ever-increasing interaction between it and computer science. The Series provides a broad coverage of discrete mathematics and optimization, ranging over such fields as combinatorics, graph theory, enumeration, mathematical programming and the analysis of algorithms, and including such topics as Ramsey theory, transversal theory, block designs, finite geometries, Polya theory, graph and matroid algorithms, network flows, polyhedral combinatorics and computational complexity. The Wiley-Interscience Series in Discrete Mathematics and Optimization will be a substantial part of the record in this extraordinary development. Recent title in the Series: Theory and Algorithms for Linear Optimization: An Interior Point Approach C. Roos, T. Terlaky Delft University of Technology, The Netherlands and J.-Ph. Vial University of Geneva, Switzerland Linear Optimization (LO) is one of the most widely taught and fast developing techniques in mathematics, with applications in many areas of science, commerce and industry. The dramatically increased interest in the subject is due mainly to advances in computer technology and to the development of Interior Point Methods (IPM) for LO. This book provides a unified presentation of the field by way of an interior point approach to both the theory of LO and algorithms for LO (design, covergence, complexity and asymptotic behaviour). A common thread throughout the book is the role of strictly complementary solutions, which play a crucial role in the interior point approach and distinguishes the new approach from the classical Simplex-based approach. The approach to LO in this book is new in many aspects. In particular the IPM based development of duality theory is surprisingly elegant. The algorithmic parts of the book contain a complete discussion of many algorithmic variants, including predictor-corrector methods, partial updating, higher order methods and sensitivity and parametric analysis. The comprehensive and up-to-date coverage of the subject, together with the clarity of presentation, ensures that this book will be an invaluable resource for researchers and professionals who wish to develop their understanding of LOs and IPMs . Numerous exercises are provided to help consolidate understanding of the material and more than 45 figures are included to illustrate the characteristics of the algorithms. A general understanding of linear algebra and calculus is assumed and the preliminary chapters provide a self-contained introduction for readers who are unfamiliar with LO methods. These chapters will also be of interest for readers who wish to take a fresh look at the topics. 1997

Editorial Reviews

Review

A truly remarkable and unique collection of work. . . . Invaluable. -- Informs



The world of local search has changed dramatically in the last decade and Aarts and Lenstra's book is a tribute to this development. . . . A very useful source. -- Optima
--This text refers to the Paperback edition.

From the Publisher

In recent years major methodological progress has been made in the design and analysis of local search algorithms in combinatorial optimization. Until now the results have been scattered throughout the available literature. This is the first book to collect results, consolidate the insights and stimulate further progress in the field. Chapters on simulated annealing, tabu search, genetic algorithms and neural networks, applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design.

See all Editorial Reviews

Product Details

• Hardcover: 522 pages
• Publisher: Wiley; 1 edition (June 1997)
• Language: English
• ISBN-10: 0471948225
• ISBN-13: 978-0471948223
• Product Dimensions: 9.3 x 6.6 x 1.5 inches
• Shipping Weight: 1.8 pounds
• Average Customer Review: 3.0 out of 5 stars  See all reviews (1 customer review)
• Amazon Best Sellers Rank: #5,287,601 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

4 of 7 people found the following review helpful:

3.0 out of 5 stars Not Good as a Textbook or Study Reference, February 19, 2007

By 

Al-Azri (Oman) - See all my reviews

This review is from: Local Search in Combinatorial Optimization (Paperback)

I bought this book for a graduate course. Despite the applause I see in the back cover, it is not so good as a textbook. It might be good if you are well-versed in the lexicon of optimization and optimization is your main area, then I think this book is good to understand the quantitative as well as the qualitative dimensions of each technique. For a novice researcher or student in the field, this is not the right book.