• GSA

  • Referenced in 129 articles [sw40815]
  • search algorithm. In recent years, various heuristic optimization methods have been developed. Many of these ... nature. In this paper, a new optimization algorithm based on the law of gravity ... been compared with some well-known heuristic search methods. The obtained results confirm the high...
  • GWO

  • Referenced in 104 articles [sw40816]
  • work proposes a new meta-heuristic called Grey Wolf Optimizer (GWO) inspired by grey wolves ... comparative study with Particle Swarm Optimization (PSO), Gravitational Search Algorithm (GSA), Differential Evolution (DE), Evolutionary ... results compared to these well-known meta-heuristics. The paper also considers solving three classical...
  • CirCut

  • Referenced in 42 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 ... algorithm, as well as with a purely heuristic code for effectively solving a particular ... upper bound on the MAX-CUT optimal value...
  • MOPSO

  • Referenced in 59 articles [sw18795]
  • proposal to extend the heuristic called ”particle swarm optimization” (PSO) to deal with multiobjective optimization...
  • TTTPLOTS

  • Referenced in 58 articles [sw07712]
  • case in local search based heuristics for combinatorial optimization, such as simulated annealing, genetic algorithms...
  • HeuristicLab

  • Referenced in 12 articles [sw07053]
  • flexible and extensible environment for parallel heuristic optimization. Heuristic optimization techniques turned ... relevant in real world applications. Consequently, parallel optimization methods like parallel genetic algorithms are widely ... present a new environment for parallel heuristic optimization based upon the already proposed HeuristicLab...
  • MAPCLUS

  • Referenced in 31 articles [sw20021]
  • squares method combined with a mathematical programming optimization procedure based on a penalty function approach ... other numerical techniques (notably a heuristically based combinatorial optimization procedure) to provide an efficient general...
  • LKH

  • Referenced in 148 articles [sw04735]
  • effective implementation of the Lin-Kernighan heuristic for solving the traveling salesman problem. Computational experiments ... effective. Even though the algorithm is approximate, optimal solutions are produced with an impressively high...
  • POPMUSIC

  • Referenced in 26 articles [sw20508]
  • meta-heuristic that has been successfully applied to various combinatorial optimization problems. This metaheuristic ... designing heuristic methods for large combinatorial problems that can be partially optimized. The basic idea...
  • Sparsity

  • Referenced in 13 articles [sw08686]
  • transformations with data structure transformations and optimization heuristics that are specific to sparse matrices...
  • gCol

  • Referenced in 25 articles [sw41492]
  • graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they...
  • MOAPPS

  • Referenced in 11 articles [sw13459]
  • design problems using the modern heuristics optimization techniques (i.e. tabu search, genetic algorithms, etc.). This ... need to investigate the suitability of modern heuristics for their solution. In this paper...
  • Volcano

  • Referenced in 22 articles [sw30956]
  • education in database systems design, heuristics for query optimization, parallel query execution, and resource allocation...
  • Chaco

  • Referenced in 118 articles [sw09640]
  • interprocessor communication is kept small. Finding an optimal decomposition is provably hard ... effort has been devoted to developing heuristics for this problem. The decomposition problem...
  • OPT4J

  • Referenced in 8 articles [sw07054]
  • implementation of arbitrary meta-heuristic optimization algorithms. For this purpose, Opt4J relies on a module...
  • MINTO

  • Referenced in 135 articles [sw04587]
  • also provides automatic constraint classification, preprocessing, primal heuristics and constraint generation. Moreover, the user ... used as a general purpose mixed-integer optimizer, MINTO attempts to: improve the formulation...
  • HotFrame

  • Referenced in 7 articles [sw13457]
  • HotFrame: a heuristic optimization framework. n this paper we survey the design and application...
  • ANewDsc

  • Referenced in 11 articles [sw19984]
  • almost any overhead by integrating additional optimizations and heuristics...
  • PBS

  • Referenced in 38 articles [sw04622]
  • optimization (Max/Min) problems. Includes incremental features. PBS options include: Static/Dynamic decision heuristics, 1-UIP conflict...
  • COMET

  • Referenced in 80 articles [sw03051]
  • book introduces a method for solving combinatorial optimization problems that combines constraint programming and local ... 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 ... approaches to cope with both satisfiability and optimization problems in a uniform fashion...