Local Search in Combinatorial Optimization
| Author | : | |
| Rating | : | 4.21 (728 Votes) |
| Asin | : | 0691115222 |
| Format Type | : | paperback |
| Number of Pages | : | 528 Pages |
| Publish Date | : | 2014-12-30 |
| Language | : | English |
DESCRIPTION:
Jan Karel Lenstra is the John P. Emile Aarts is Vice-President and Scientific Program Director of the Philips Research Laboratories, Eindhoven, and a Professor of Computer Science at Eindhoven University of Technology. . Hunter Chair and Professor of Industrial and Systems Engineering at the Georgia Institute of Technology
Not Good as a Textbook or Study Reference Al-Azri 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
"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
Kindervater, Martin W. Östergård.. 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. L. Tovey, Jan H. Glass, Chris N. 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. Korst, Peter J. Anderson, Celia A. van Laarhoven, Alain Hertz, Eric Taillard, Dominique de Werra, Heinz Mühlenbein, Carsten Peterson, Bo Söderberg, David S. M. Savelsbergh, Edward J. Johnson, Lyle A. 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. J. Potts, C. P. Liu, Peichen Pan, Iiro Honkala, and Patric R. McGeoch, Michel Gendreau, Gilbert Laporte, Jean-Yves Potvin, Gerard A. M. 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. P