• RealPaver

  • Referenced in 51 articles [sw04401]
  • rounded interval-based computations in a branch-and-bound framework. Its key feature ... point operators, constraint propagation and local consistency techniques, local optimization using descent methods and metaheuristics...
  • CorClass

  • Referenced in 5 articles [sw01932]
  • advantage of CorClass, as compared to other techniques for associative classification, is that CorClass directly ... classification by employing a branch-and-bound algorithm. Previous techniques (such as CBA and CMAR...
  • cGOP

  • Referenced in 3 articles [sw20093]
  • these problems using decomposition and branch-and-bound techniques. It also incorporates several improvements made...
  • FilMINT

  • Referenced in 51 articles [sw06197]
  • linearizations at open nodes of the branch-and-bound tree whenever an integer solution ... solver, FilMINT, combines the MINTO branch-and-cut framework for MILP with filterSQP to solve ... show the benefit of such advanced MILP techniques. We offer new suggestions for generating...
  • ADMBB

  • Referenced in 5 articles [sw31752]
  • simple optimization techniques such as alternative direction method, and branch-and-bound, to find...
  • RAPTOR

  • Referenced in 20 articles [sw09002]
  • then solved by the canonical branch-and-bound method. The final solution is globally optimal ... RAPTOR–RApid Protein Threading by Operation Research technique. Large scale benchmark test for fold recognition...
  • ConArg2

  • Referenced in 6 articles [sw22084]
  • argument-acceptance) takes advantage of well-known techniques as local consistency, different heuristics for trying ... variables, and complete search-tree with branch-and-bound...
  • ORCSolver

  • Referenced in 1 article [sw36183]
  • novel solving technique for adaptive ORC layouts, based on a branch-and-bound approach with...
  • DAOOPT

  • Referenced in 3 articles [sw21189]
  • Bound and its Breadth-Rotating AND/OR Branch-and-Bound enhancement for combinatorial optimization problems expressed ... Kalev Kask). join graph cost-shifting techniques (MPLP, JGLP, MBE-MM) (code by Alex Ihler...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • world instances. We introduce a new modelling technique called arc dependences. It generalizes the traditional ... software. We devise a Branch-and-Bound scheme and fill in the contents...
  • BARON

  • Referenced in 354 articles [sw00066]
  • BARON is a computational system for solving nonconvex...
  • CGAL

  • Referenced in 394 articles [sw00118]
  • The goal of the CGAL Open Source Project...
  • Coq

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

  • Referenced in 202 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • C-XSC

  • Referenced in 110 articles [sw00181]
  • C-XSC. A programming environment for verified scientific...
  • C-XSC 2.0

  • Referenced in 127 articles [sw00182]
  • A C++ class library for extended scientific computing...
  • FATCOP

  • Referenced in 11 articles [sw00265]
  • We describe FATCOP 2.0, a new parallel mixed...
  • GAP

  • Referenced in 3189 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • GLOPT

  • Referenced in 19 articles [sw00359]
  • GLOPT is a Fortran 77 program for global...
  • KNITRO

  • Referenced in 197 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...