Programming Books C Java PHP Python Learn more Browse Programming Books
Buy New
$63.95
Qty:1
  • List Price: $70.00
  • Save: $6.05 (9%)
In Stock.
Ships from and sold by Amazon.com.
Gift-wrap available.
Have one to sell? Sell on Amazon
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 2 images

Local Search in Combinatorial Optimization Paperback – August 3, 2003


See all 2 formats and editions Hide other formats and editions
Amazon Price New from Used from
Paperback
"Please retry"
$63.95
$41.98 $9.99
Free%20Two-Day%20Shipping%20for%20College%20Students%20with%20Amazon%20Student


Frequently Bought Together

Local Search in Combinatorial Optimization + Programming with Constraints: An Introduction
Price for both: $133.23

Buy the selected items together

Customers Who Viewed This Item Also Viewed

NO_CONTENT_IN_FEATURE

Shop the new tech.book(store)
New! Introducing the tech.book(store), a hub for Software Developers and Architects, Networking Administrators, TPMs, and other technology professionals to find highly-rated and highly-relevant career resources. Shop books on programming and big data, or read this week's blog posts by authors and thought-leaders in the tech industry. > Shop now

Product Details

  • Paperback: 528 pages
  • Publisher: Princeton University Press (August 3, 2003)
  • Language: English
  • ISBN-10: 0691115222
  • ISBN-13: 978-0691115221
  • Product Dimensions: 1.2 x 6 x 9.2 inches
  • Shipping Weight: 1.7 pounds (View shipping rates and policies)
  • Average Customer Review: 3.0 out of 5 stars  See all reviews (1 customer review)
  • Amazon Best Sellers Rank: #691,717 in Books (See Top 100 in Books)

Editorial Reviews

Review

"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

From the Publisher

In recent years major methodological progress has been made in the design and analysis of local search algorithms in combinatorial optimization. Until now the results have been scattered throughout the available literature. This is the first book to collect results, consolidate the insights and stimulate further progress in the field. Chapters on simulated annealing, tabu search, genetic algorithms and neural networks, applications of local search to problems in management science and engineering, including the traveling salesman problem, vehicle routing, machine scheduling, VLSI design and code design. --This text refers to an out of print or unavailable edition of this title.

Customer Reviews

3.0 out of 5 stars
5 star
0
4 star
0
3 star
1
2 star
0
1 star
0
See the customer review
Share your thoughts with other customers

Most Helpful Customer Reviews

5 of 8 people found the following review helpful By Al-Azri on February 19, 2007
Format: Paperback
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 field, this is not the right book.
Comment Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback. If this review is inappropriate, please let us know.
Sorry, we failed to record your vote. Please try again

Customer Images