Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Greedy_randomized_adaptive_search_procedure> ?p ?o. }
Showing items 1 to 19 of
19
with 100 items per page.
- Greedy_randomized_adaptive_search_procedure abstract "The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems. GRASP typically consists of iterations made up from successive constructions of a greedy randomized solution and subsequent iterative improvements of it through a local search. The greedy randomized solutions are generated by adding elements to the problem's solution set from a list of elements ranked by a greedy function according to the quality of the solution they will achieve. To obtain variability in the candidate set of greedy solutions, well-ranked candidate elements are often placed in a restricted candidate list (also known as RCL), and chosen at random when building up the solution. This kind of greedy randomized construction method is also known as a semi-greedy heuristic, first described in Hart and Shogan (1987). GRASP was first introduced in Feo and Resende (1989). Survey papers on GRASP include Feo and Resende (1995), Pitsoulis and Resende (2002), and Resende and Ribeiro (2003). An annotated bibliography of GRASP can be found in Festa, G. C Resende (2002).".
- Greedy_randomized_adaptive_search_procedure wikiPageExternalLink gabib.pdf.
- Greedy_randomized_adaptive_search_procedure wikiPageExternalLink grasp-hao.pdf.
- Greedy_randomized_adaptive_search_procedure wikiPageExternalLink sgrasp-hmetah.pdf.
- Greedy_randomized_adaptive_search_procedure wikiPageID "1804034".
- Greedy_randomized_adaptive_search_procedure wikiPageRevisionID "543996019".
- Greedy_randomized_adaptive_search_procedure hasPhotoCollection Greedy_randomized_adaptive_search_procedure.
- Greedy_randomized_adaptive_search_procedure subject Category:Combinatorial_optimization.
- Greedy_randomized_adaptive_search_procedure comment "The greedy randomized adaptive search procedure (also known as GRASP) is a metaheuristic algorithm commonly applied to combinatorial optimization problems. GRASP typically consists of iterations made up from successive constructions of a greedy randomized solution and subsequent iterative improvements of it through a local search.".
- Greedy_randomized_adaptive_search_procedure label "GRASP (algoritmo)".
- Greedy_randomized_adaptive_search_procedure label "Greedy randomized adaptive search procedure".
- Greedy_randomized_adaptive_search_procedure label "Greedy randomized adaptive search procedure".
- Greedy_randomized_adaptive_search_procedure sameAs Greedy_randomized_adaptive_search_procedure.
- Greedy_randomized_adaptive_search_procedure sameAs GRASP_(algoritmo).
- Greedy_randomized_adaptive_search_procedure sameAs m.05y8sw.
- Greedy_randomized_adaptive_search_procedure sameAs Q3116070.
- Greedy_randomized_adaptive_search_procedure sameAs Q3116070.
- Greedy_randomized_adaptive_search_procedure wasDerivedFrom Greedy_randomized_adaptive_search_procedure?oldid=543996019.
- Greedy_randomized_adaptive_search_procedure isPrimaryTopicOf Greedy_randomized_adaptive_search_procedure.