GRASP (greedy randomized adaptive search procedure) is a multistart metaheuristic for computing good-quality solutions of combinatorial optimization problems. Each GRASP iteration is usually made up of a construction phase, where a feasible solution is constructed,...
CITATION STYLE
Festa, P., & Resende, M. G. C. (2016). GRASP. In Handbook of Heuristics (pp. 1–24). Springer International Publishing. https://doi.org/10.1007/978-3-319-07153-4_23-1
Mendeley helps you to discover research relevant for your work.