• Juniper

  • Referenced in 2 articles [sw26689]
  • Juniper: an open-source nonlinear branch-and-bound solver in Julia. Nonconvex mixed-integer nonlinear ... global optimization algorithms, which have limited scalability. However, nonlinear branch-and-bound has recently been ... based open-source solver for nonlinear branch-and-bound. Leveraging the high-level Julia programming ... further exploration in utilizing nonlinear branch-and-bound algorithms as heuristics for nonconvex MINLPs...
  • OOBB

  • Referenced in 3 articles [sw16365]
  • help the development of parallel branch-and-bound algorithms. The main aim of the OOBB...
  • htSNPer1.0

  • Referenced in 2 articles [sw35554]
  • Results: A heuristic algorithm, generalized branch-and-bound algorithm, is applied to the searching...
  • ConsRank

  • Referenced in 3 articles [sw25204]
  • incomplete. The package contains both branch-and-bound algorithms and heuristic solutions recently proposed...
  • amodMC

  • Referenced in 5 articles [sw06614]
  • deterministic global optimization algorithm based on a branch-and-bound method. The superiority of adjoint...
  • DipPy

  • Referenced in 2 articles [sw06278]
  • variety of decomposition-based branch-and-bound algorithms for solving mixed integer linear programs). DipPy...
  • Optimal-SPCA

  • Referenced in 2 articles [sw31821]
  • optimization. We propose a tailored branch-and-bound algorithm, Optimal-SPCA, that enables...
  • RealPaver

  • Referenced in 51 articles [sw04401]
  • Algorithm 852 Realpaver: nonlinear constraint solving & rigorous global optimization. Problems: Realpaver allows modeling and solving ... variables, continuous or discrete, have to be bounded. Functions and constraints have to be defined ... correctly rounded interval-based computations in a branch-and-bound framework. Its key feature...
  • multfisher

  • Referenced in 1 article [sw25602]
  • Optimization is achieved by a branch-and-bound algorithm. By application of the closed testing...
  • IncMaxCLQ

  • Referenced in 1 article [sw21468]
  • used to develop an efficient branch-and-bound algorithm for MaxClique, called IncMaxCLQ, which...
  • BBMCL

  • Referenced in 14 articles [sw11525]
  • coloring as a new paradigm for branch-and-bound exact maximum clique search. Approximate coloring ... remaining uncolored vertices give rise to algorithmic variants integrated in a new BBMCL framework. BBMCL...
  • BNB

  • Referenced in 1 article [sw05033]
  • optimization problems. It is a branch-and-bound type algorithm...
  • RAPTOR

  • Referenced in 20 articles [sw09002]
  • then solved by the canonical branch-and-bound method. The final solution is globally optimal ... linear programs generate integral solutions directly. Our algorithm has been implemented as a software package...
  • Bob++

  • Referenced in 5 articles [sw22243]
  • framework for solving optimization problems with branch-and-bound methods. This paper describes the design ... framework for implementing sequential and/or parallel search algorithms. To our knowledge, the Bob++ is among...
  • cGOP

  • Referenced in 3 articles [sw20093]
  • global optimality. The package implements the GOP algorithm (Floudas and Visweswaran, 1993), which is applicable ... branch-and-bound techniques. It also incorporates several improvements made to the original GOP algorithm...
  • ADMBB

  • Referenced in 3 articles [sw31752]
  • such as alternative direction method, and branch-and-bound, to find a globally optimal solution ... establish the convergence of the ADMBB algorithm and estimate its complexity. Second, we develop...
  • BDMLP

  • Referenced in 0 articles [sw21972]
  • well scaled. The Branch-and-Bound algorithm for solving MIP is not in the same...
  • Decogo

  • Referenced in 3 articles [sw32747]
  • algorithms for global optimization. Traditional deterministic global optimization methods are often based on a branch ... bound (BB) search tree, which may grow rapidly, preventing the method to find a good...
  • Go-ICP

  • Referenced in 6 articles [sw14979]
  • This paper presents the first globally optimal algorithm, named Go-ICP, for Euclidean (rigid) registration ... method is based on a branch-and-bound (BnB) scheme that searches the entire...
  • DryadOpt

  • Referenced in 1 article [sw13406]
  • DryadOpt: branch-and-bound on distributed data-parallel execution engines. We introduce Dryad ... massively parallel and distributed execution of optimization algorithms for solving hard problems. Dryad Opt performs ... search of the solution space using branch-and-bound, by recursively splitting the original problem...