• BIANCA

  • Referenced in 12 articles [sw02081]
  • genetic algorithm to solve hard combinatorial optimisation problems in engineering The genetic algorithm BIANCA developed ... design and optimisation of composite laminates is a multi-population genetic algorithm capable ... deal with unconstrained and constrained hard combinatorial optimisation problems in engineering. The effectiveness and robustness...
  • HyFlex

  • Referenced in 10 articles [sw07688]
  • software interface for dealing with different combinatorial optimisation problems and provides the algorithm components that ... designing adaptive general-purpose optimisation algorithms. Six hard combinatorial problems are fully implemented: maximum satisfiability...
  • G12

  • Referenced in 10 articles [sw10112]
  • platform for solving large scale industrial combinatorial optimisation problems. The core design involves three languages...
  • MCS

  • Referenced in 9 articles [sw02814]
  • algorithm for multicriteria optimisation in constraint programming. We propose a new algorithm called ... search for solutions to multicriteria combinatorial optimisation problems. To quickly produce a solution that offers...
  • FC-TLBO

  • Referenced in 1 article [sw22855]
  • parametric algorithm using teaching-learning-based optimisation technique with an inbuilt constraints maintenance mechanism using ... unmixing problem is transformed into a combinatorial optimisation problem by introducing abundance...
  • QAPgrid

  • Referenced in 1 article [sw23152]
  • algorithms and models from combinatorial optimisation. Datasets often contain ”hidden regularities” and a combined identification ... large instances of this NP-hard combinatorial optimization problem, and we show its performance...
  • SHGO

  • Referenced in 1 article [sw26954]
  • purpose global optimisation algorithm based on applications of simplicial integral homology and combinatorial topology. SHGO ... solving higher dimensional black and grey box optimisation problems. This complex is built up using...
  • Visiplan

  • Referenced in 2 articles [sw00999]
  • implementation details behind the optimisation technique). Approximation methods that mix artificial intelligence and operation research ... techniques are successfully used for solving combinatorial problems. The key elements of this approach...
  • ADOL-C

  • Referenced in 207 articles [sw00019]
  • ADOL-C: Automatic Differentiation of C/C++. We present...
  • cdd

  • Referenced in 100 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • Coq

  • Referenced in 1522 articles [sw00161]
  • Coq is a formal proof management system. It...
  • EOlib

  • Referenced in 19 articles [sw00239]
  • EO is a template-based, ANSI-C++ evolutionary...
  • HSL

  • Referenced in 229 articles [sw00418]
  • HSL (formerly the Harwell Subroutine Library) is a...
  • iOpt

  • Referenced in 8 articles [sw00448]
  • iOpt: A software toolkit for heuristic search methods...
  • LANCELOT

  • Referenced in 263 articles [sw00500]
  • LANCELOT. A Fortran package for large-scale nonlinear...
  • LAPACK

  • Referenced in 1504 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LEDA

  • Referenced in 241 articles [sw00509]
  • In the core computer science areas -- data structures...
  • LSQR

  • Referenced in 304 articles [sw00530]
  • Algorithm 583: LSQR: Sparse Linear Equations and Least...