• J-MEANS

  • Referenced in 67 articles [sw02649]
  • MEANS: A new local search heuristic for minimum sum of squares clustering. A new local ... search heuristic, called J-Means, is proposed for solving the minimum sum of squares clustering ... compared with two other well-known local search heuristics, K- and H-Means as well ... removed. Moreover, another heuristic, which fits into the variable neighborhood search metaheuristic framework and uses...
  • COMET

  • Referenced in 71 articles [sw03051]
  • programming. After an overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents ... modeling and search components of constraint-based local ... search and describes how constraint-based local search is supported in COMET. The book describes ... illustrating the ability of constraint-based local search approaches to cope with both satisfiability...
  • TTTPLOTS

  • Referenced in 54 articles [sw07712]
  • often the case in local search based heuristics for combinatorial optimization, such as simulated annealing...
  • EasyLocal++

  • Referenced in 36 articles [sw04104]
  • design and implementation issues of new local search heuristics in a more principled way. Furthermore...
  • TSPAntSim

  • Referenced in 6 articles [sw04980]
  • solving TSP using ACO algorithms with local search heuristics. Algorithms are tested on benchmark problems...
  • KaHyPar

  • Referenced in 4 articles [sw20718]
  • level approach combined with strong local search heuristics, it computes solutions of very high quality...
  • QCQP

  • Referenced in 3 articles [sw27001]
  • quadratic programs (QCQPs) using relaxations and local search heuristics. Our heuristics are based ... local method. Improve method takes a point from the Suggest method and performs a local ... search to find a better point. The notion of better points is defined...
  • DINS

  • Referenced in 8 articles [sw10145]
  • introduce Distance Induced Neighbourhood Search (DINS), a MIP improvement heuristic that tries to find improved ... based on a variation of local search that is embedded in an exact MIP solver ... solution to define search neighbourhoods at different nodes of the search tree generated ... improvement heuristics Local Branching due to Fischetti and Lodi and Relaxation Induced Neighbourhood Search...
  • CCASat

  • Referenced in 11 articles [sw12924]
  • strategy results in a simple local search algorithm for SAT called Swcc, which shows promising ... variable selection heuristic called configuration checking with aspiration (CCA). The CCA heuristic leads ... third contribution concerns improving local search algorithms for random $ k$-SAT instances with ... Swcca and CCAsubscore, we obtain a local search SAT solver called CCASat, which was ranked...
  • ADATE

  • Referenced in 3 articles [sw02854]
  • heuristic optimization code using ADATE. Local Search based meta-heuristic methods for finding good solutions...
  • HAS-QAP

  • Referenced in 35 articles [sw20506]
  • colony system coupled with a local search, applied to the quadratic assignment problem ... compared with some of the best heuristics available for the QAP: two versions of tabu...
  • evtree

  • Referenced in 10 articles [sw14304]
  • efficient heuristic, the results of recursive tree methods are only locally optimal, as splits ... next step only. An alternative way to search over the parameter space of trees...
  • POMDPS

  • Referenced in 35 articles [sw03055]
  • alleviate the computational complexity by computing good local policies at each decision step during ... Online algorithms generally consist of a lookahead search to find the best action to execute ... indicate that state-of-the-art online heuristic search methods can handle large POMDP domains...
  • CCLS

  • Referenced in 14 articles [sw36049]
  • efficient approximate methods, mainly stochastic local search (SLS) ones. However, few works exist ... this paper, we propose a new heuristic called CCM for weighted...
  • ConArg2

  • Referenced in 5 articles [sw22084]
  • valid extension for that semantics. Searching for solutions of problems (as enumerating extensions or checking ... local consistency, different heuristics for trying to assign values to variables, and complete search-tree...
  • Localizer++

  • Referenced in 4 articles [sw20670]
  • high-level search constructs to specify local moves and meta-heuristics. It also supports...
  • CCEHC

  • Referenced in 3 articles [sw36050]
  • breakthroughs have been made on stochastic local search (SLS) for weighted ... extended framework of CCLS with a heuristic emphasizing hard clauses, called EHC. With strong accents...
  • iOpt

  • Referenced in 8 articles [sw00448]
  • which specifically suit the operations of heuristic search, tedious code optimisations which are often required ... large number of available algorithms -- both local search and population-based -- which make it difficult ... providing problem modelling facilities well-matched to heuristic search operations, a generic framework for developing...
  • NuMVC

  • Referenced in 11 articles [sw08219]
  • used in designing a new MVC local search algorithm, which is referred to as NuMVC ... comparing NuMVC with state-of-the-art heuristic algorithms show that NuMVC is at least...
  • NCVX

  • Referenced in 3 articles [sw24075]
  • heuristics, which employ convex relaxations, convex restrictions, local neighbour search methods, and the alternating direction ... problems, and show that our general purpose heuristics are effective in finding approximate solutions...