• libcgrpp

  • Referenced in 2 articles [sw07205]
  • bound-constrained global optimization with continuous GRASP. This paper describes libcgrpp, a GNU-style dynamic ... library of the continuous greedy randomized adaptive search procedure (C-GRASP) for bound constrained global...
  • Maple

  • Referenced in 5040 articles [sw00545]
  • The result of over 30 years of cutting...
  • Mathematica

  • Referenced in 5883 articles [sw00554]
  • Almost any workflow involves computing results, and that...
  • Matlab

  • Referenced in 12074 articles [sw00558]
  • MATLAB® is a high-level language and interactive...
  • QEPCAD

  • Referenced in 275 articles [sw00752]
  • QEPCAD B: A program for computing with semi...
  • SymPy

  • Referenced in 104 articles [sw00940]
  • SymPy is a Python library for symbolic mathematics...
  • TSPLIB

  • Referenced in 661 articles [sw00983]
  • TSPLIB is a library of sample instances for...
  • SCIP

  • Referenced in 459 articles [sw01091]
  • SCIP is currently one of the fastest non...
  • GRASP

  • Referenced in 129 articles [sw01094]
  • Algorithm 754: Fortran subroutines for approximate solution of...
  • PERL

  • Referenced in 262 articles [sw01225]
  • Programming Perl. Perl is a language for easily...
  • COMET

  • Referenced in 71 articles [sw03051]
  • Constraint-Based Local Search. The ubiquity of combinatorial...
  • SDPA

  • Referenced in 172 articles [sw03275]
  • SDPA (SemiDefinite Programming Algorithm)” is one of the...
  • UCI-ml

  • Referenced in 3041 articles [sw04074]
  • UC Irvine Machine Learning Repository. We currently maintain...
  • CPLEX

  • Referenced in 2551 articles [sw04082]
  • IBM® ILOG® CPLEX® offers C, C++, Java, .NET...
  • LINPACK

  • Referenced in 514 articles [sw04209]
  • LINPACK is a collection of Fortran subroutines that...
  • Qhull

  • Referenced in 297 articles [sw04419]
  • The convex hull of a point set P...
  • Genocop

  • Referenced in 1080 articles [sw04707]
  • Genocop, by Zbigniew Michalewicz, is a genetic algorithm...
  • Knapsack

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