• Tabu search

  • Referenced in 1079 articles [sw08556]
  • describe the main features of tabu search, emphasizing a perspective for guiding a user ... basic implementation principles for solving combinatorial or nonlinear problems. We also identify recent developments ... useful aspects of tabu search is the ability to adapt a rudimentary prototype implementation...
  • 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 ... specifying search procedures at a high level of abstraction. Local search approaches to combinatorial optimization ... solving combinatorial optimization problems that combines constraint programming and local search, using constraints to describe...
  • Chaff

  • Referenced in 591 articles [sw06916]
  • probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying ... provide practical solutions to this problem for problem instances encountered in a range of applications ... variants of the Davis-Putnam (DP) search algorithm. In this paper we describe the development...
  • Localizer

  • Referenced in 21 articles [sw21238]
  • traditional technique to solve combinatorial search problems which has raised much interest in recent years...
  • METSlib

  • Referenced in 35 articles [sw05867]
  • Tabu Search solver for the quadratic assignment problem, a combinatorial optimization problem that arises...
  • SPADE

  • Referenced in 89 articles [sw02226]
  • SPADE utilizes combinatorial properties to decompose the original problem into smaller sub-problems, that ... solved in main-memory using efficient lattice search techniques, and using simple join operations...
  • SALSA

  • Referenced in 30 articles [sw02661]
  • efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction ... with other optimization paradigms such as local search, yielding hybrid algorithms with constraints. Such combinations ... hybrid) search algorithms. We illustrate its use on a few examples from combinatorial optimization...
  • Beam-ACO

  • Referenced in 25 articles [sw11745]
  • hybridizing ant colony optimization with beam search: an application to open shop scheduling. Ant colony ... metaheuristic approach to tackle hard combinatorial optimization problems. The basic component ... regarded as a tree search method. Based on this observation, we hybridize the solution construction...
  • TOAST

  • Referenced in 3 articles [sw32206]
  • declarative programming particularly suited to difficult combinatorial search problems. However...
  • TTTPLOTS

  • Referenced in 59 articles [sw07712]
  • combinatorial optimization, such as simulated annealing, genetic algorithms, iterated local search, tabu search, WalkSAT ... algorithms or strategies for solving a given problem and have been widely used...
  • LocalSolver

  • Referenced in 16 articles [sw04850]
  • focus on the modeling of the problem using a simple formalism, and then to defer ... solver based on efficient and reliable local-search techniques. Started in 2007, the goal ... combinatorial optimization problems which are out of reach of existing black-box tree-search solvers...
  • NILS

  • Referenced in 7 articles [sw20669]
  • numerous solutions from the search space. Many combinatorial optimization problems share this property, that...
  • CUD@SAT

  • Referenced in 7 articles [sw42761]
  • parallelising a class of search problems, where the combinatorial nature leads to large parallel tasks...
  • L0Learn

  • Referenced in 21 articles [sw36841]
  • problems (aka best subset selection). The algorithms are based on coordinate descent and local combinatorial ... search. For more details, check the paper by Hazimeh and Mazumder (2018) ; the link...
  • NuMVC

  • Referenced in 13 articles [sw08219]
  • local search algorithm for minimum vertex cover The Minimum Vertex Cover (MVC) problem ... hard combinatorial optimization problem of great importance in both theory and application. Local search...
  • MCS

  • Referenced in 9 articles [sw02814]
  • search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers ... algorithm alternates several Branch & Bound searches following diversified search strategies. It is implemented...
  • Paracooba

  • Referenced in 10 articles [sw41083]
  • solve hard combinatorial problems in parallel. It organizes the search in two phases. First...
  • HyFlex

  • Referenced in 12 articles [sw07688]
  • search methodologies. The framework features a common software interface for dealing with different combinatorial optimisation ... problems and provides the algorithm components that are problem specific. In this way, the algorithm ... general-purpose optimisation algorithms. Six hard combinatorial problems are fully implemented: maximum satisfiability, one dimensional ... state-of-the-art problem specific heuristics and search operators. HyFlex represents a valuable...
  • DualGrounder

  • Referenced in 1 article [sw40700]
  • paradigm that is geared towards difficult combinatorial search problems. Sometimes, run times of ASP systems...
  • CABOB

  • Referenced in 31 articles [sw17813]
  • algorithm for winner determination in combinatorial auctions. Combinatorial auctions where bidders can bid on bundles ... present CABOB, a sophisticated optimal search algorithm for the problem. It uses decomposition techniques, upper...