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. It consists of 12 chapters. The Chapter 1 is an introduction to optimization, in particular it compares exact and approximate methods and discusses some basic concepts. The concepts of combinatorial optimization and computational complexity are discussed in details in Chapter 2. In Chapters 3 and 4 the authors discuss basic solution strategies, like greedy algorithms and local search techniques. Chapters 5–11 focus on the GRASP approach. The authors present and discuss the basic heuristic (Chapter 5), runtime distributions (Chapter 6), extended construction heuristics (Chapter 7), GRASP with path-relinking (Chapters 8 and 9), parallel versions of GRASP (Chapter 10) and GRASP methods for continuous optimization problems. The concluding Chapter 12 contains several case studies. The book is a very good choice for scientists, students and engineers, introducing to the subject of GRASP, but also, as Fred Glover wrote in the foreword, “to combinatorial optimization, local search, path-relinking, and metaheuristics in general”. I strongly recommend this book to both theoreticians and practitionners of OR.