• GRASP

  • Referenced in 130 articles [sw01094]
  • quadratic assignment problems using GRASP (greedy randomized adaptive search procedures...
  • RAIcode

  • Referenced in 8 articles [sw34283]
  • three phase dependency analysis, optimal reinsertion, greedy search, greedy equivalence search, sparse candidate...
  • clustvarsel

  • Referenced in 18 articles [sw07967]
  • that have group/cluster information. A greedy or headlong search can be used, either...
  • GRASP_QAP

  • Referenced in 17 articles [sw04684]
  • flow or distance matrix. A greedy, randomized, adaptive search procedure (GRASP) is used to produce...
  • Algorithm 769

  • Referenced in 15 articles [sw13886]
  • quadratic assignment problem using a greedy randomized adaptive search procedure (GRASP). The design and implementation...
  • BART-BMA

  • Referenced in 4 articles [sw23498]
  • algorithm which grows trees using a greedy search for the best split points. However ... uses Bayesian model averaging and a greedy search algorithm to obtain a posterior distribution more...
  • Algorithm 787

  • Referenced in 11 articles [sw13182]
  • maximum independent set problem. A Greedy Randomized Adaptive Search Procedure (GRASP) is used to produce...
  • GOP

  • Referenced in 6 articles [sw17432]
  • global optimization methods (Direct Tabu Search and Continuous Greedy Randomized Adaptive Search). These latter also...
  • CCAnr

  • Referenced in 4 articles [sw40122]
  • CCAnr lies on the greedy heuristic in the focused local search mode, which contributes significantly ... results suggest that a greedy heuristic in the focused local search mode might be helpful...
  • Algorithm 797

  • Referenced in 5 articles [sw13176]
  • problem (graph planarization) using a Greedy Randomized Adaptive Search Procedure (GRASP). The design and implementation...
  • GESPAR

  • Referenced in 29 articles [sw25722]
  • appropriate basis. We propose a fast local search method for recovering a sparse signal from ... magnitude which we refer to as GESPAR: GrEedy Sparse PhAse Retrieval. Our algorithm does...
  • salso

  • Referenced in 1 article [sw40219]
  • package salso: Search Algorithms and Loss Functions for Bayesian Clustering ... SALSO algorithm is an efficient randomized greedy search method to find a point estimate...
  • DMR

  • Referenced in 1 article [sw13419]
  • levels of factors. The method assumes greedy search among linear models with set of constraints...
  • Algorithm 815

  • Referenced in 3 articles [sw13170]
  • directed graphs using a Greedy Randomized Adaptive Search Procedure (GRASP). Implementation and usage...
  • ADMiRA

  • Referenced in 32 articles [sw31664]
  • target rank of the solution. A simple search over the target rank then provides ... rank matrix and extending efficient greedy algorithms from the vector to the matrix case...
  • libcgrpp

  • Referenced in 2 articles [sw07205]
  • Python/C library of the continuous greedy randomized adaptive search procedure (C-GRASP) for bound constrained...
  • CompareCausalNetworks

  • Referenced in 0 articles [sw17930]
  • causal prediction) (from package ’InvariantCausalPrediction’), ’GES’ (greedy equivalence search), ’GIES’ (greedy interventional equivalence search), ’LINGAM...
  • CHSMiner

  • Referenced in 0 articles [sw16788]
  • gene content alone. It implements fast greedy search algorithm and rigorous statistical validation...
  • JCOL

  • Referenced in 1 article [sw33205]
  • coloring heuristics like DSATUR, Iterated Greedy and Local Search. Also includes an implementation...
  • MoEClust

  • Referenced in 1 article [sw35305]
  • component is also facilitated. A greedy forward stepwise search algorithm is provided for identifying...