• Knapsack

  • Referenced in 461 articles [sw04723]
  • Knapsack problems are the simplest NP-hard problems...
  • XPRESS

  • Referenced in 218 articles [sw04834]
  • FICO Xpress is the premier mathematical modeling and...
  • LEMON

  • Referenced in 39 articles [sw05043]
  • LEMON – an Open Source C++ Graph Template Library...
  • LBFGS-B

  • Referenced in 313 articles [sw05142]
  • Algorithm 778: L-BFGS-B Fortran subroutines for...
  • Inc-cluster

  • Referenced in 4 articles [sw06866]
  • Clustering large attributed information networks: an efficient incremental...
  • SA-cluster

  • Referenced in 8 articles [sw06867]
  • Clustering large attributed information networks: an efficient incremental...
  • RAxML

  • Referenced in 34 articles [sw07716]
  • Parallel inference of a 10.000-taxon phylogeny with...
  • DIMACS

  • Referenced in 515 articles [sw08221]
  • The DIMACS Implementation Challenges address questions of determining...
  • ILUT

  • Referenced in 137 articles [sw08734]
  • ILUT: A dual threshold incomplete LU factorization. In...
  • gSpan

  • Referenced in 108 articles [sw11908]
  • gSpan: graph-based substructure pattern mining. We investigate...
  • BEAGLE

  • Referenced in 4 articles [sw12586]
  • BEAGLE: An Application Programming Interface and High-Performance...
  • BEAST

  • Referenced in 44 articles [sw12588]
  • BEAST 2 is a cross-platform program for...
  • DPRml

  • Referenced in 4 articles [sw12590]
  • DPRml: distributed phylogeny reconstruction by maximum likelihood. Motivation...
  • pIQPNNI

  • Referenced in 3 articles [sw12591]
  • pIQPNNI: parallel reconstruction of large maximum likelihood phylogenies...
  • MAXFLOW

  • Referenced in 124 articles [sw13223]
  • MAXFLOW - software for computing mincut/maxflow in a graph...
  • CSparse

  • Referenced in 195 articles [sw20382]
  • Direct methods for sparse linear systems. Computational scientists...