Greedy Randomized Adaptive Search Procedures

1Citations
Citations of this article
40Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this chapter, we describe the process of designing heuristic procedures to solve combinatorial optimization problems.

Cite

CITATION STYLE

APA

Duarte, A., Laguna, M., & Martí, R. (2018). Greedy Randomized Adaptive Search Procedures. In EURO Advanced Tutorials on Operational Research (pp. 57–83). Springer Nature. https://doi.org/10.1007/978-3-319-68119-1_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free