• Sign In / Register
  • Help
  • Basket0
The books you love, the emails you want
Time is running out, opt in before 25 May or you'll stop hearing from us
Yes Please
Optimization by GRASP: Greedy Randomized Adaptive Search Procedures (Hardback)
  • Optimization by GRASP: Greedy Randomized Adaptive Search Procedures (Hardback)

Optimization by GRASP: Greedy Randomized Adaptive Search Procedures (Hardback)

(author), (author)
Hardback 312 Pages / Published: 27/10/2016
  • We can order this

Usually despatched within 3 weeks

  • This item has been added to your basket

Check Marketplace availability

This is the first book to cover GRASP (Greedy Randomized Adaptive Search Procedures), a metaheuristic that has enjoyed wide success in practice with a broad range of applications to real-world combinatorial optimization problems. The state-of-the-art coverage and carefully crafted pedagogical style lends this book highly accessible as an introductory text not only to GRASP, but also to combinatorial optimization, greedy algorithms, local search, and path-relinking, as well as to heuristics and metaheuristics, in general. The focus is on algorithmic and computational aspects of applied optimization with GRASP with emphasis given to the end-user, providing sufficient information on the broad spectrum of advances in applied optimization with GRASP. For the more advanced reader, chapters on hybridization with path-relinking and parallel and continuous GRASP present these topics in a clear and concise fashion. Additionally, the book offers a very complete annotated bibliography of GRASP and combinatorial optimization. For the practitioner who needs to solve combinatorial optimization problems, the book provides a chapter with four case studies and implementable templates for all algorithms covered in the text. This book, with its excellent overview of GRASP, will appeal to researchers and practitioners of combinatorial optimization who have a need to find optimal or near optimal solutions to hard combinatorial optimization problems.

Publisher: Springer-Verlag New York Inc.
ISBN: 9781493965281
Number of pages: 312
Weight: 660 g
Dimensions: 235 x 155 x 23 mm
Edition: 1st ed. 2016

"The book is a comprehensive introduction to the greedy randomized adaptive search procedures (GRASP), first applied to the set covering problems and then to other combinatorial problems. ... The book is a very good choice for scientists, students and engineers, introducing to the subject of GRASP ... . I strongly recommend this book to both theoreticians and practitionners of OR." (Marcin Anholcer, zbMATH 1356.90001, 2017)

You may also be interested in...

Bayesian Methods for Hackers
Added to basket
The Essential Turing
Added to basket
Modelling Computing Systems
Added to basket
Added to basket
The Elements of Statistical Learning
Added to basket
Data Analysis with Open Source Tools
Added to basket
Discrete Mathematics
Added to basket
The End of Error
Added to basket
Foundation Mathematics
Added to basket
Numerical Recipes 3rd Edition
Added to basket
The Algorithm Design Manual
Added to basket
Mixed media product
Concrete Mathematics
Added to basket
How to Think About Algorithms
Added to basket


Please sign in to write a review

Your review has been submitted successfully.