• lp_solve

  • Referenced in 79 articles [sw04006]
  • revised simplex method and the Branch-and-bound method for the integers. It contains full...
  • PICO

  • Referenced in 26 articles [sw02252]
  • wide range of branch-and-bound methods on an equally wide range of parallel computing ... package to a simple branch-and-bound method for mixed integer programming, along with computational...
  • Biq Mac

  • Referenced in 89 articles [sw10532]
  • semidefinite and polyhedral relaxations. We present a method for finding exact solutions ... Branch-and-Bound setting that applies a dynamic version of the bundle method as bounding...
  • RealPaver

  • Referenced in 51 articles [sw04401]
  • variables, continuous or discrete, have to be bounded. Functions and constraints have to be defined ... branch-and-bound framework. Its key feature is to combine several methods from various fields...
  • RAPTOR

  • Referenced in 20 articles [sw09002]
  • then solved by the canonical branch-and-bound method. The final solution is globally optimal...
  • WinGULF

  • Referenced in 20 articles [sw19224]
  • understand principals of simplex method and branch-and-bound algorithm in linear (LP) and linear ... problem using simplex method, the package may be used to check correctness of your interim ... problems, current bound, branching variables and appropriate branching constraints. See more detailed information here ... simplex method developed by B.Martos[1] with various pivoting rules and branch-and-bound procedure...
  • BiqCrunch

  • Referenced in 9 articles [sw23686]
  • BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems. This article presents ... optimization problems. BiqCrunch is a branch-and-bound method that uses an original, efficient semidefinite...
  • Bonmin

  • Referenced in 214 articles [sw04766]
  • there is a need for developing new methods and software for solving large-scale problems ... class of hybrid algorithms, of which branch-and-bound and polyhedral outer approximation...
  • PAUP*

  • Referenced in 57 articles [sw07834]
  • inclusion of maximum likelihood and distance methods in PAUP* 4.0, the new version represents ... addition, the speed of the branch-and-bound algorithm has been enhanced and a number...
  • amodMC

  • Referenced in 6 articles [sw06614]
  • this article an adjoint method for the computation of subgradients for McCormick relaxations is presented ... optimization algorithm based on a branch-and-bound method. The superiority of adjoint over tangent...
  • Bob++

  • Referenced in 5 articles [sw22243]
  • solving optimization problems with branch-and-bound methods. This paper describes the design...
  • ADMBB

  • Referenced in 5 articles [sw31752]
  • techniques such as alternative direction method, and branch-and-bound, to find a globally optimal...
  • gBoost

  • Referenced in 8 articles [sw42199]
  • apply the boosting method to graph data, a branch-and-bound pattern search algorithm ... iterations to minimize the computation time. Our method can learn more efficiently than the simpler...
  • Go-ICP

  • Referenced in 8 articles [sw14979]
  • method is based on a branch-and-bound (BnB) scheme that searches the entire ... geometry, we derive novel upper and lower bounds for the registration error function. Local ... scheme, which speeds up the new method while guaranteeing global optimality. We also discuss extensions...
  • MINLPB4

  • Referenced in 3 articles [sw07023]
  • nonlinear programming problems by a branch-and-bound method, where the nodes of the search...
  • MAIC

  • Referenced in 8 articles [sw19964]
  • concretely, we propose methods to find lower and upper bounds, and branching rules for this ... branch-and-bound framework. We show that the proposed method can provide the best statistical...
  • Decogo

  • Referenced in 5 articles [sw32747]
  • deterministic global optimization methods are often based on a branch-and-bound (BB) search tree...
  • QPsimplex

  • Referenced in 5 articles [sw31751]
  • Simplex QP-based methods for minimizing a conic quadratic objective over polyhedra. We consider minimizing ... algorithms are not well-suited for branch-and-bound algorithms for the discrete counterparts ... descent and bisection algorithms utilizing the simplex method for quadratic programming, which makes ... solution methods amenable to warm starts and suitable for branch-and-bound algorithms. We test...
  • BFOUR

  • Referenced in 1 article [sw08458]
  • inequality constraints by a branch-and-bound method...
  • BOB

  • Referenced in 6 articles [sw21601]
  • easy development of the Branch-and-Bound applications (min/maximization). This library has the double goal ... algorithms of Combinatorial Optimization for its parallelization methods and/or tools...