Local Search in Combinatorial Optimization

Local Search in Combinatorial Optimization

4.11 - 1251 ratings - Source

In the past three decades, local search has grown from a simple heuristic idea into a mature field of research in combinatorial optimization that is attracting ever-increasing attention. Local search is still the method of choice for NP-hard problems as it provides a robust approach for obtaining high-quality solutions to problems of a realistic size in reasonable time. Local Search in Combinatorial Optimization covers local search and its variants from both a theoretical and practical point of view, each topic discussed by a leading authority. This book is an important reference and invaluable source of inspiration for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. In addition to the editors, the contributors are Mihalis Yannakakis, Craig A. Tovey, Jan H. M. Korst, Peter J. M. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz MA¼hlenbein, Carsten Peterson, Bo SApderberg, David S. Johnson, Lyle A. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. P. Kindervater, Martin W. P. Savelsbergh, Edward J. Anderson, Celia A. Glass, Chris N. Potts, C. L. Liu, Peichen Pan, Iiro Honkala, and Patric R. J. A┬ľstergAyrd.solutions, i.e., how good are the local optima for the chosen neighborhood structure and how do they relate to the ... very large instances of classical optimization problems such as the traveling salesman problem - and on the theoretical front, anbsp;...

Title:Local Search in Combinatorial Optimization
Author:J. K. Lenstra
Publisher:Princeton University Press - 2003


You Must CONTINUE and create a free account to access unlimited downloads & streaming