• simannf90

  • Referenced in 119 articles [sw05059]
  • algorithm is essentially an iterative random search procedure with adaptive moves along the coordinate directions ... Nelder-Mead method and the adaptive random search method of the reviewer), being always able...
  • GRASP

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

  • Referenced in 292 articles [sw05291]
  • other evolutionary methods like genetic algorithms, scatter search is founded on the premise that systematic ... benefits beyond those derived from recourse to randomization. Our implementation goal is to create ... five elements in the scatter search methodology that proves effective when searching for optimal weight...
  • Walksat

  • Referenced in 209 articles [sw04328]
  • GSAT and WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work ... normal form. They start by assigning a random value to each variable. If the assignment...
  • DOCK

  • Referenced in 7 articles [sw07835]
  • search strategies include incremental construction and random conformation search and utilize the existing Coulombic ... incremental construction and the random search strategy are evaluated as database docking techniques with ... crystallographic testcases. Incremental construction outperforms random search and is fast enough to reliably rank...
  • GRASP_QAP

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

  • Referenced in 12 articles [sw12924]
  • local search algorithm for SAT called Swcc, which shows promising experimental results on random ... third contribution concerns improving local search algorithms for random $ k$-SAT instances with ... algorithm CCAsubscore is very efficient for solving random $ k$-SAT instances with ... local search SAT solver called CCASat, which was ranked first in the random track...
  • Algorithm 769

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

  • Referenced in 6 articles [sw19488]
  • invariant checking to invariant inference using randomized search. We describe a general framework ... phases. The search phase uses randomized search to discover candidate invariants and the validate phase...
  • Lattice Builder

  • Referenced in 8 articles [sw33929]
  • lattice rules. It supports exhaustive and random searches, as well as component-by-component ... random CBC constructions, for any number of points, and for various measures of (non)uniformity ... implement new types of weights, new search domains, new figures of merit...
  • GOP

  • Referenced in 6 articles [sw17432]
  • optimization problem for a multi-layer line search method. The approach is presented and implemented ... Genetic Algorithm, Differential Evolution and Controlled Random Search. We validate our methodology by considering ... Direct Tabu Search and Continuous Greedy Randomized Adaptive Search). These latter also aim at improving...
  • CubeHash

  • Referenced in 13 articles [sw07100]
  • CubeHash-5/96. The second method randomizes the search for highly probable linear differential trails...
  • YalSAT

  • Referenced in 18 articles [sw31644]
  • that local search can be competitive on certain hard satisfiable but non-random instances using ... ProbSAT algorithm in our new local search SAT solver YalSAT, which confirmed its effectiveness ... were quite surprised that a local search solver was able to solve some ... hard uniform random formulas. We continued to use YalSAT during one local search inprocessing phase...
  • Algorithm 787

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

  • Referenced in 10 articles [sw09444]
  • performance of stochastic local search algorithms for random instances of the K-satisfiability...
  • GATE

  • Referenced in 6 articles [sw06442]
  • permitted search area of the GAs’ random search operators, depending on the state of convergence...
  • CARTopt

  • Referenced in 4 articles [sw08364]
  • CARTopt: a random search method for nonsmooth unconstrained optimization A random search algorithm for unconstrained...
  • ACRS

  • Referenced in 6 articles [sw05052]
  • ARCS: A Derivative-Free Adaptively Controlled Random Search algorithm for bound constrained global optimization problems...
  • NLPQL

  • Referenced in 131 articles [sw08457]
  • constraint functions. At each iteration, the search direction is the solution of a quadratic programming ... hand-selected or application problems, 320 randomly generated problems). The performance of NLPQL is compared...
  • BOHB

  • Referenced in 4 articles [sw35481]
  • based configuration evaluation approaches based on random search lack guidance and do not converge...