• Tabu search

  • Referenced in 1079 articles [sw08556]
  • describe the main features of tabu search, emphasizing a perspective for guiding a user ... implementation principles for solving combinatorial or nonlinear problems. We also identify recent developments and extensions ... useful aspects of tabu search is the ability to adapt a rudimentary prototype implementation ... discrete optimization problems to illustrate the strategic concerns of tabu search, and to show...
  • DLMF

  • Referenced in 2889 articles [sw04968]
  • search, for example, or for input to computer algebra systems. These and other problems...
  • Scatter Search

  • Referenced in 297 articles [sw05291]
  • foundations behind scatter search and its application to the problem of training neural networks. Scatter ... search is an evolutionary method that has been successfully applied ... wide array of hard optimization problems. Scatter search constructs new trial solutions by combining...
  • BARON

  • Referenced in 361 articles [sw00066]
  • hills and valleys of complex optimization problems in search of global solutions...
  • INTOPT_90

  • Referenced in 306 articles [sw04705]
  • Rigorous global search: continuous problems The monograph gives a survey of interval arithmetic based methods ... optimization. Preprint.). The chapter about non-differentiable problems (17 pages) studies function expressions containing ... some new results with respect to zero search. The final chapter about intermediate values...
  • KELLEY

  • Referenced in 643 articles [sw04829]
  • least squares problems are considered. Chapter 3 is devoted to line-search and trust-region ... methods for the solution of bound constrained problems. All chapters conclude with a demonstration ... optimization of noisy functions. Such optimization problems arise, e.g., when the evaluation of the objective ... noise level in the function. Direct search algorithms, including the Nelder-Mead, multidirectional search...
  • SVMlight

  • Referenced in 268 articles [sw04076]
  • possible. Such ranking problems naturally occur in applications like search engines and recommender systems. Futhermore ... optimization problems lower-bounding the solution using a form of local search. A detailed description ... been used on a large range of problems, including text classification [Joachims, 1999c][Joachims, 1998a...
  • SDPT3

  • Referenced in 707 articles [sw04009]
  • includes the special case of determinant maximization problems with linear matrix inequalities. It employs ... with either the HKM or the NT search direction. The basic code is written ... files. Routines are provided to read in problems in either SDPA or SeDuMi format. Sparsity...
  • Mace4

  • Referenced in 228 articles [sw06905]
  • first-order theorem provers, with the prover searching for proofs and Mace4 looking for countermodels ... performs better on equational problems than our previous model-searching program Mace2...
  • COMET

  • Referenced in 80 articles [sw03051]
  • Constraint-Based Local Search. The ubiquity of combinatorial optimization problems in our society is illustrated ... methodology to solve a variety of combinatorial problems, and rich constraint programming languages have been ... solving combinatorial optimization problems that combines constraint programming and local search, using constraints to describe ... number of satisfiability problems, illustrating the ability of constraint-based local search approaches to cope...
  • Walksat

  • Referenced in 211 articles [sw04328]
  • WalkSat are local search algorithms to solve Boolean satisfiability problems. Both algorithms work on formulae...
  • GWO

  • Referenced in 112 articles [sw40816]
  • study with Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Differential Evolution (DE), Evolutionary Programming ... also considers solving three classical engineering design problems (tension/compression spring, welded beam, and pressure vessel ... algorithm is applicable to challenging problems with unknown search spaces...
  • HypE

  • Referenced in 88 articles [sw19794]
  • high interest and relevance for problems involving a large number of objective functions. However ... potential; current hypervolume-based search algorithms are limited to problems with only a few objectives ... addresses this issue and proposes a fast search algorithm that uses Monte Carlo simulation ... only do many-objective problems become feasible with hypervolume-based search, but also the runtime...
  • Wasserstein GAN

  • Referenced in 159 articles [sw42583]
  • debugging and hyperparameter searches. Furthermore, we show that the corresponding optimization problem is sound...
  • veriSoft

  • Referenced in 92 articles [sw01489]
  • VeriSoft automatically searches for coordination problems (deadlocks, etc.) and assertion violations in a software system...
  • GRASP

  • Referenced in 133 articles [sw01094]
  • dense quadratic assignment problems using GRASP (greedy randomized adaptive search procedures...
  • Graphplan

  • Referenced in 186 articles [sw07746]
  • variety of interesting natural and artificial planning problems. We also give empirical evidence that ... produced by Graphplan are quite sensible. Since searches made by this approach are fundamentally different ... searches of other common planning methods, they provide a new perspective on the planning problem...
  • tn

  • Referenced in 140 articles [sw05140]
  • Newton method which can be applied to problems that do not necessarily have positive-definite ... search direction, where n denotes the number of variables of the problem. The idea ... Newton method is described that defines a search direction which interpolates between the direction defined...
  • Manopt

  • Referenced in 124 articles [sw08493]
  • focus is on problems where the smooth geometry of the search space can be leveraged...
  • J-MEANS

  • Referenced in 74 articles [sw02649]
  • squares clustering. A new local search heuristic, called J-Means, is proposed for solving ... minimum sum of squares clustering problem. The neighborhood of the current solution is defined ... compared with two other well-known local search heuristics, K- and H-Means as well ... local search step, is proposed too. Results on standard test problems from the literature...