Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q3116070> ?p ?o }
Showing triples 1 to 16 of
16
with 100 triples per page.
- Q3116070 subject Q8391417.
- Q3116070 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).".
- Q3116070 wikiPageExternalLink 371.pdf.
- Q3116070 wikiPageExternalLink gabib.pdf.
- Q3116070 wikiPageExternalLink grasp-hao.pdf.
- Q3116070 wikiPageWikiLink Q1333872.
- Q3116070 wikiPageWikiLink Q1385229.
- Q3116070 wikiPageWikiLink Q1424540.
- Q3116070 wikiPageWikiLink Q1868524.
- Q3116070 wikiPageWikiLink Q504353.
- Q3116070 wikiPageWikiLink Q5167911.
- Q3116070 wikiPageWikiLink Q583461.
- Q3116070 wikiPageWikiLink Q8391417.
- Q3116070 wikiPageWikiLink Q863783.
- Q3116070 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.".
- Q3116070 label "Greedy randomized adaptive search procedure".