Login Preferences
About News Publications Statistics Downloads API Guide License How to use Preferences
bn:01043999n
Noun Concept
Categories: Articles with short description, Greedy algorithms, Combinatorics stubs, Combinatorial optimization
EN
greedy randomized adaptive search procedure
EN
The greedy randomized adaptive search procedure is a metaheuristic algorithm commonly applied to combinatorial optimization problems. Wikipedia
Definitions
Relations
Sources
EN
The greedy randomized adaptive search procedure is a metaheuristic algorithm commonly applied to combinatorial optimization problems. Wikipedia
metaheuristic commonly used for optimization problems Wikidata
IS A
metaheuristic
DIFFERENT FROM
General responsibility assignment software patterns
Wikipedia
EN
greedy randomized adaptive search procedure
Wikidata
EN
Greedy randomized adaptive search procedure

Please note that, in order to improve your browsing experience on this website, BabelNet® uses various types of cookies, including: browsing functionality, performance and statistical cookies.

By continuing to browse the site you are agreeing to our use of cookies. OK

License