GRASP: Greedy Randomized Adaptive Search Procedure
GRASP is a multi-start metaheuristic for combinatorial problems,
in which each iteration consists basically of two phases: construction
and local search. The construction phase builds a feasible solution,
whose neighborhood is investigated until a local minima is found during
the local search phase. The best overall solution is kept as the
result.
Annotated bibliography
of GRASP (by Paola Festa and Mauricio G. C. Resende)