+612 9045 4394
 
CHECKOUT
Local Search in Combinatorial Optimization - Emile Aarts

Local Search in Combinatorial Optimization

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

Paperback Published: 3rd August 2003
ISBN: 9780691115221
Number Of Pages: 528

Share This Book:

Paperback

RRP $153.00
$109.90
28%
OFF
or 4 easy payments of $27.48 with Learn more
Ships in 3 to 4 business days

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 Muhlenbein, Carsten Peterson, Bo Soderberg, 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. Östergard.

"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

Preface to the paperback edition
Preface
Contributors
Introductionp. 1
Computational complexityp. 19
Local improvement on discrete structuresp. 57
Simulated annealingp. 91
Tabu searchp. 121
Genetic algorithmsp. 137
Artificial neural networksp. 173
The traveling salesman problem: a case studyp. 215
Vehicle routing: modern heuristicsp. 311
Vehicle routing: handling edge exchangesp. 337
Machine schedulingp. 361
VLSI layout synthesisp. 415
Code designp. 441
Bibliographyp. 457
Author indexp. 495
Subject indexp. 507
Table of Contents provided by Blackwell. All Rights Reserved.

ISBN: 9780691115221
ISBN-10: 0691115222
Audience: Tertiary; University or College
Format: Paperback
Language: English
Number Of Pages: 528
Published: 3rd August 2003
Publisher: Princeton University Press
Country of Publication: US
Dimensions (cm): 23.27 x 16.26  x 3.18
Weight (kg): 0.71
Edition Type: Revised