|
|
|
|
 | Local Search in Combinatorial Optimization |
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 Mühlenbein, Carsten Peterson, Bo Söderberg, 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. Östergård. "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 Endorsement: "[This] is the best current reference for local search methods. I would expect this volume to remain an important reference for quite a number of years."--William J. Cook, Georgia Institute of Technology Subject Area:
Hardcover published by John Wiley & Sons in 1997 | |||||
Prices subject to change without notice File created: 7/1/2008 | |||||
Questions and comments to: webmaster@press.princeton.edu | |||||