• Tabu search

  • Referenced in 939 articles [sw08556]
  • basic implementation principles for solving combinatorial or nonlinear problems. We also identify recent developments...
  • Chaff

  • Referenced in 527 articles [sw06916]
  • probably the most studied of combinatorial optimization/search problems. Significant effort has been devoted to trying...
  • Knapsack

  • Referenced in 392 articles [sw04723]
  • problems are the simplest NP-hard problems in combinatorial optimization, as they maximize an objective ... variants of the classical 0-1 knapsack problem will be considered with respect to relaxations...
  • VRP

  • Referenced in 738 articles [sw05207]
  • Vehicle Routing Problem (VRP) is one of the most challenging combinatorial optimization task. Defined more...
  • 4ti2

  • Referenced in 105 articles [sw04379]
  • software package for algebraic, geometric and combinatorial problems on linear spaces...
  • ABACUS

  • Referenced in 112 articles [sw02948]
  • mixed integer optimization problems and for combinatorial optimization problems. It unifies cutting plane and column...
  • COMET

  • Referenced in 66 articles [sw03051]
  • 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 ... level of abstraction. Local search approaches to combinatorial optimization are able to isolate optimal ... book introduces a method for solving combinatorial optimization problems that combines constraint programming and local...
  • Stony Brook

  • Referenced in 59 articles [sw05040]
  • Stony Brook Algorithm Repository mainly for combinatorial problems...
  • SDPLIB

  • Referenced in 54 articles [sw00838]
  • semidefinite programming (SDP) test problems. The problems are drawn from a variety of applications, including ... control systems engineering, and relaxations of combinatorial optimization problems. The current version of the library...
  • Algorithm 39

  • Referenced in 29 articles [sw20048]
  • Algorithm 39: Clusterwise linear regression. The combinatorial problem of clusterwise discrete linear approximation is defined...
  • SPADE

  • Referenced in 82 articles [sw02226]
  • Sequential Patterns. The existing solutions to this problem make repeated database scans, and use complex ... poor locality. SPADE utilizes combinatorial properties to decompose the original problem into smaller sub-problems...
  • POPMUSIC

  • Referenced in 19 articles [sw20508]
  • been successfully applied to various combinatorial optimization problems. This metaheuristic is especially useful ... designing heuristic methods for large combinatorial problems that can be partially optimized. The basic idea...
  • Zoltan

  • Referenced in 38 articles [sw07458]
  • important and well studied problem in combinatorial scientific computing, and is commonly used to reduce...
  • NP-SPEC

  • Referenced in 20 articles [sw02243]
  • class NP. The specification of several combinatorial problems in NP-SPEC is shown...
  • METSlib

  • Referenced in 20 articles [sw05867]
  • Search solver for the quadratic assignment problem, a combinatorial optimization problem that arises in many...
  • SALSA

  • Referenced in 30 articles [sw02661]
  • efficient technique for solving hard combinatorial optimization problems. However, it is best used in conjunction ... examples from combinatorial optimization for which we specify complex optimization procedures with a few simple...
  • cc(FD)

  • Referenced in 16 articles [sw21237]
  • implementation of the combinators. Results on numerous problems, including scheduling, resource allocation, sequencing, packing ... procedural languages on a number of combinatorial problems. In addition, a small cc(FD) program...
  • MALLBA

  • Referenced in 22 articles [sw00542]
  • MALLBA project tackles the resolution of combinatorial optimization problems using algorithmic skeletons implemented...
  • Beam-ACO

  • Referenced in 21 articles [sw11745]
  • metaheuristic approach to tackle hard combinatorial optimization problems. The basic component...
  • Localizer

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