• Hyperheuristics

  • Referenced in 112 articles [sw00424]
  • authors as a high-level heuristic that adaptively controls several low-level knowledge-poor heuristics ... only cheap, easy-to-implement low-level heuristics, we may achieve solution quality approaching that...
  • MINTO

  • Referenced in 127 articles [sw04587]
  • also provides automatic constraint classification, preprocessing, primal heuristics and constraint generation. Moreover, the user...
  • FEASPUMP

  • Referenced in 77 articles [sw04802]
  • practice. Feasibility Pump (FP) is a heuristic scheme for finding a feasible solution to general ... somehow blind) with more clever rounding heuristics. In particular, we investigate...
  • ABACUS

  • Referenced in 105 articles [sw02948]
  • cutting planes, column generation, and primal heuristics. ABACUS supports the Open Solver Interface (Osi) developed...
  • Chaco

  • Referenced in 101 articles [sw09640]
  • effort has been devoted to developing heuristics for this problem. The decomposition problem...
  • J-MEANS

  • Referenced in 55 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 ... local optimum is reached. The new heuristic is compared with two other well-known local ... search heuristics, K- and H-Means as well as with H-Means+, an improved version...
  • ILUT

  • Referenced in 90 articles [sw08734]
  • based on a strategy which combines two heuristics. This ILUT factorization extends the usual...
  • PSI-BLAST

  • Referenced in 90 articles [sw17324]
  • word hits, combined with a new heuristic for generating gapped alignments, yields a gapped BLAST...
  • LKH

  • Referenced in 85 articles [sw04735]
  • effective implementation of the Lin-Kernighan heuristic for solving the traveling salesman problem. Computational experiments...
  • COMET

  • Referenced in 58 articles [sw03051]
  • overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents the architecture ... variety of applications, arranged by meta-heuristics. It presents scheduling applications, along with the background...
  • BoomerAMG

  • Referenced in 75 articles [sw00086]
  • independent set algorithms and the application of heuristic designed to insure the quality...
  • CirCut

  • Referenced in 39 articles [sw04782]
  • Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs The Goemans--Williamson ... proposed approach leads to continuous optimization heuristics applicable to MAX-CUT as well as other ... code based on the rank-two relaxation heuristics is compared with two state ... algorithm, as well as with a purely heuristic code for effectively solving a particular...
  • QUALEX

  • Referenced in 41 articles [sw04742]
  • proved. Within this framework a trust region heuristic is developed. In contrast to usual trust...
  • Gecode

  • Referenced in 37 articles [sw06272]
  • modeling layer; advanced branching heuristics (accumulated failure count, activity); many search engines (parallel, interactive graphical...
  • CAPUSHE

  • Referenced in 20 articles [sw13365]
  • Slope heuristics: overview and implementation. Model selection is a general paradigm which includes many statistical ... multiplicative factor: the “slope heuristics”. Theoretical works validate this heuristic method in some situations ... twofold. First, an introduction to the slope heuristics and an overview of the theoretical ... practical difficulties occurring for applying the slope heuristics. A new practical approach is carried...
  • TTTPLOTS

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

  • Referenced in 35 articles [sw04104]
  • implementation issues of new local search heuristics in a more principled way. Furthermore, the framework...
  • FilMINT

  • Referenced in 35 articles [sw06197]
  • easily employ cutting planes, primal heuristics, and other well-known MILP enhancements for MINLPs...
  • PT-Scotch

  • Referenced in 35 articles [sw07038]
  • nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations of which...
  • PBS

  • Referenced in 34 articles [sw04622]
  • incremental features. PBS options include: Static/Dynamic decision heuristics, 1-UIP conflict diagnosis, Random restarts...