• PAUP*

  • Referenced in 57 articles [sw07834]
  • branch-and-bound algorithm has been enhanced and a number of new features have been...
  • ECOS

  • Referenced in 58 articles [sw12123]
  • small number of binary or integer variables by employing a simple branch and bound technique ... Prof. Stephen Boyd of Stanford University. A number of helpful contributors have provided interfaces...
  • DeepONet

  • Referenced in 39 articles [sw42093]
  • fixed number of sensors xi,i=1,…,m (branch net), and another for encoding ... approximation error in terms of the number of sensors (where the input function is defined...
  • TRACER

  • Referenced in 12 articles [sw09484]
  • number of paths on the number of program branches, and infinite-length symbolic paths...
  • CALMA

  • Referenced in 106 articles [sw03235]
  • limit the interference between links. The number of frequencies used is to be minimized. Problems ... participants developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques...
  • MaxSolver

  • Referenced in 20 articles [sw01990]
  • satisfy the maximum number of clauses in a Boolean formula. A branch and bound algorithm ... this paper, we propose and investigate a number of strategies for max-SAT. The first...
  • LINDOGlobal

  • Referenced in 50 articles [sw06196]
  • LINDO Global employs branch-and-cut methods to break an nonlinearly constrained optimization problem model ... tolerances, after a finite, though possibly large number of steps a solution provably global optimal...
  • BiqMac

  • Referenced in 23 articles [sw12662]
  • Branch & Bound code (see [RRW07] or [Wie06]). The dimension of the problems (i.e., number...
  • Bison

  • Referenced in 40 articles [sw17681]
  • items having different sizes into a minimum number of equal-sized bins. For solving ... known meta-strategy tabu search and a branch and bound procedure based on known...
  • Spartacus

  • Referenced in 15 articles [sw12426]
  • number of optimization techniques, including a new technique that we call lazy branching. We evaluate...
  • PIPO

  • Referenced in 1 article [sw41606]
  • masking implementations, since it uses a minimal number of nonlinear operations. Our implementations demonstrate that ... operations. Furthermore, its differential and linear branch numbers are both 3. This characteristic enables PIPO...
  • pde2path

  • Referenced in 44 articles [sw08571]
  • Matlab pdetool, and is explained by a number of examples, including Bratu’s problem ... time-integration are also supported. The continuation, branch-switching, plotting etc are performed via matlab...
  • FindSteinerTree

  • Referenced in 12 articles [sw08245]
  • This algorithm uses a branch-and-bound approach. It will therefore find the optimal tree ... computational effort increases very rapidly with increasing numbers of data points. Smith’s algorithm uses ... that has the shortest possible sum of branch lengths measured as Euclidean distance (Euclidean Steiner...
  • pplacer

  • Referenced in 5 articles [sw26774]
  • linear time and memory complexity in the number of reference taxa, and is easy ... software provides visualizations using branch thickness and color to represent number of placements and their...
  • RealPaver

  • Referenced in 51 articles [sw04401]
  • satisfaction and optimization problems over the real numbers. The decision variables, continuous or discrete, have ... correctly rounded interval-based computations in a branch-and-bound framework. Its key feature...
  • MULKNAP

  • Referenced in 37 articles [sw06467]
  • reduce the problem size. Next, in the branch-and-bound framework, we make ... environment. However, solving instances with relatively large number of knapsacks, when compared to the number...
  • ALPS

  • Referenced in 17 articles [sw00036]
  • requirements and communication overhead. ALPS incorporates a number of new ideas to address this challenge ... ALPS. The first is the Branch, Constrain, and Price Software (BiCePS) library, a framework that...
  • PEBBL

  • Referenced in 13 articles [sw13809]
  • operations, while managing the generic aspects of branch and bound, such as maintaining the active ... provide highly scalable performance on large numbers of processor cores. We describe the basics ... state of the art in scalability for branch-and-bound implementations. We also show...
  • SATGraf

  • Referenced in 3 articles [sw14761]
  • decaying sum (VSIDS) branching heuristic consistently chooses variables with a high number of inter-community ... variables. Second, we observe that the VSIDS branching heuristic and hence the CDCL search procedure...