“Optimization by GRASP is a well-structured and well written introduction to GRASP. In addition it is very suitable for and highly accessible to students, researchers and practitioners who want to familiarize themselves with combinatorial optimization and greedy algorithms. … The book provides an excellent overview of GRASP and will appeal to researchers and practitioners of combinatorial optimization.” (Hans W. Ittmann, IFORS News, Vol. 12 (01), March, 2018)“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)

• Foreword.- Preface.- 1. Introduction.- 2. A short tour of combinatorial optimization and computational complexity.- 3. Solution construction and greedy algorithms.- 4. Local search.- 5. GRASP: The basic heuristic.- 6. Runtime distributions.- 7. GRASP: extended construction heuristics.- 8. Path-relinking.- 9. GRASP with Path-relinking.- 10. Parallel GRASP heuristics.- 11. GRASP for continuous optimization.- 12. Case studies.- References.- Index.

“Optimization by GRASP is a well-structured and well written introduction to GRASP. In addition it is very suitable for and highly accessible to students, researchers and practitioners who want to familiarize themselves with combinatorial optimization and greedy algorithms. … The book provides an excellent overview of GRASP and will appeal to researchers and practitioners of combinatorial optimization.” (Hans W. Ittmann, IFORS News, Vol. 12 (01), March, 2018)“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)

• Foreword.- Preface.- 1. Introduction.- 2. A short tour of combinatorial optimization and computational complexity.- 3. Solution construction and greedy algorithms.- 4. Local search.- 5. GRASP: The basic heuristic.- 6. Runtime distributions.- 7. GRASP: extended construction heuristics.- 8. Path-relinking.- 9. GRASP with Path-relinking.- 10. Parallel GRASP heuristics.- 11. GRASP for continuous optimization.- 12. Case studies.- References.- Index.

“Optimization by GRASP is a well-structured and well written introduction to GRASP. In addition it is very suitable for and highly accessible to students, researchers and practitioners who want to familiarize themselves with combinatorial optimization and greedy algorithms. … The book provides an excellent overview of GRASP and will appeal to researchers and practitioners of combinatorial optimization.” (Hans W. Ittmann, IFORS News, Vol. 12 (01), March, 2018)“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)

• Foreword.- Preface.- 1. Introduction.- 2. A short tour of combinatorial optimization and computational complexity.- 3. Solution construction and greedy algorithms.- 4. Local search.- 5. GRASP: The basic heuristic.- 6. Runtime distributions.- 7. GRASP: extended construction heuristics.- 8. Path-relinking.- 9. GRASP with Path-relinking.- 10. Parallel GRASP heuristics.- 11. GRASP for continuous optimization.- 12. Case studies.- References.- Index.