• J-MEANS

  • Referenced in 70 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 ... assignments. Moves are made in such neighborhoods until a local optimum is reached ... heuristic, which fits into the variable neighborhood search metaheuristic framework and uses J-Means...
  • COMET

  • Referenced in 77 articles [sw03051]
  • programming. After an overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents...
  • SO-I

  • Referenced in 12 articles [sw10100]
  • algorithm, Nonsmooth Optimization by Mesh Adaptive Direct Search (NOMAD), SO-MI (M”uller ... variable neighborhood search, and a version of SO-I that only uses a local search...
  • LPG

  • Referenced in 12 articles [sw20690]
  • planning graph to define the search neighborhood and to evaluate its elements using a parametrized ... partial plan, and are dynamically evaluated during search using discrete Lagrange multipliers. The evaluation function...
  • SNESIM

  • Referenced in 6 articles [sw13366]
  • uninformed locations in the conditioning data search neighborhood. Thus, two improvements are proposed to maximize ... informed to uniformed locations in search neighborhoods: a new multiple-grid approach introducing additional intermediary ... subgrids; and a new search neighborhood designing process to preferentially include previously simulated node locations ... from the training image and build the search tree, a simple method is described...
  • npuScheduler

  • Referenced in 7 articles [sw25798]
  • multi-threaded local search algorithm and computer implementation for the multi-mode, resource-constrained multi ... based on the concepts of variable neighborhood search, together with iterated local search. A particular...
  • MEIGO

  • Referenced in 6 articles [sw08492]
  • systems biology and bioinformatics: enhanced scatter search method (eSS) for continuous nonlinear programming (cNLP ... integer programming (MINLP) problems, and variable neighborhood search (VNS) for Integer Programming (IP) problems. Both...
  • VNDS

  • Referenced in 6 articles [sw07586]
  • Modularity maximization in networks by variable neighborhood search Finding communities or clusters, in networks...
  • LPAm+

  • Referenced in 6 articles [sw07587]
  • Modularity maximization in networks by variable neighborhood search Finding communities or clusters, in networks...
  • GTSP-LIB

  • Referenced in 4 articles [sw25565]
  • GLNS: an effective large neighborhood search heuristic for the generalized traveling salesman problem. This paper ... GTSP based on an adaptive large neighborhood search. The algorithm operates by repeatedly removing from...
  • R-SPLINE

  • Referenced in 12 articles [sw29802]
  • using R-SPLINE: retrospective search with piecewise-linear interpolation and neighborhood enumeration. We consider simulation ... value. We develop R-SPLINE -- a Retrospective-search algorithm that alternates ... between a continuous Search using Piecewise-Linear Interpolation and a discrete Neighborhood Enumeration, to asymptotically ... among the first few gradient-based search algorithms tailored for solving integer-ordered local...
  • ToOLS

  • Referenced in 4 articles [sw21244]
  • hybrid local/global search methods called Large Neighborhood Search, which is very naturally suited...
  • Ts2pack

  • Referenced in 14 articles [sw23796]
  • Schepers, which reduces the size of the search space. We also introduce a general method ... associated neighborhoods, and thus the quality of the search, without increasing the overall complexity...
  • k-Neighborhood

  • Referenced in 3 articles [sw13966]
  • Speeding up k-neighborhood local search in limited memory influence diagrams. Limited memory influence diagrams ... paper we investigate algorithms for $k$-neighborhood local search. We show that finding...
  • Localizer++

  • Referenced in 4 articles [sw20670]
  • declarative abstractions to describe the neighborhood and high-level search constructs to specify local moves...
  • ERG-DE

  • Referenced in 1 article [sw40626]
  • works focused on re-exploring the neighborhood area of the elite solutions, which is definitely ... individual is produced from the search space around each elite individual (i.e. the parent individual ... framework allows thorough exploitation of search neighborhoods around elite individuals and ultimately helps the elite...
  • DRSCRO

  • Referenced in 1 article [sw25692]
  • incorporates CRO with the variable neighborhood search (VNS) method. DRSCRO has two reaction phases ... processor assignment, and the load balance neighborhood structure of VNS is also utilized...
  • Muriqui

  • Referenced in 1 article [sw32925]
  • Feasibility Pump; Diving heuristic; Relaxation Enforced Neighborhood Search; Integrality Gap Minimization Heuristic, versions...
  • jClust

  • Referenced in 1 article [sw21913]
  • Affinity propagation, Bron–Kerbosch, MULIC, Restricted neighborhood search cluster algorithm, Markov clustering and Spectral clustering...
  • MorpheuS

  • Referenced in 1 article [sw36062]
  • piece. An efficient optimization metaheuristic, variable neighborhood search, generates music by assigning pitches that best...