.png){kind=logo}
23%OFF
Stock image for illustration purposes only - book cover, edition or condition may vary.
Local Search in Combinatorial Optimization
Aarts
€ 96.88
€ 74.76
FREE Delivery in Ireland
Description for Local Search in Combinatorial Optimization
Paperback. Covers local search and its variants from both a theoretical and practical point of view. This book is suitable for students and researchers in discrete mathematics, computer science, operations research, industrial engineering, and management science. Editor(s): Aarts, Emile; Lenstra, Jan Karel. Num Pages: 528 pages, 35 tables. 80 line illus. BIC Classification: PBU; PBV. Category: (P) Professional & Vocational; (U) Tertiary Education (US: College). Dimension: 156 x 235 x 31. Weight in Grams: 754.
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 ... Read more
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 ... Read more
Product Details
Format
Paperback
Publication date
2003
Publisher
Princeton University Press United States
Number of pages
528
Condition
New
Number of Pages
528
Place of Publication
New Jersey, United States
ISBN
9780691115221
SKU
V9780691115221
Shipping Time
Usually ships in 7 to 11 working days
Ref
99-1
About Aarts
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. Jan Karel Lenstra is the John P. Hunter Chair and Professor of Industrial and Systems Engineering at the Georgia Institute of Technology.
Reviews for Local Search in Combinatorial Optimization
"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
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