• lp_solve

  • Referenced in 75 articles [sw04006]
  • programming solver based on the revised simplex method and the Branch-and-bound method...
  • UG

  • Referenced in 23 articles [sw03500]
  • generic framework to parallelize branch-and-bound based solvers (e.g., MIP, MINLP, ExactIP...
  • FilMINT

  • Referenced in 44 articles [sw06197]
  • that implements a linearization-based algorithm. The solver is based on an algorithm ... Grossmann} [“An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems.” Comput. Chemical ... branch-and-bound tree whenever an integer solution is found. The new solver, FilMINT, combines...
  • ABACUS

  • Referenced in 115 articles [sw02948]
  • framework for the implementation of branch-and-bound algorithms using linear programming relaxations. Cutting planes ... generated dynamically (branch-and-cut, branch-and-price, branch-and-cut-and-price). ABACUS allows ... primal heuristics. ABACUS supports the Open Solver Interface (Osi) developed by the COIN-OR (COmputational...
  • DINS

  • Referenced in 8 articles [sw10145]
  • namely a branch-and-bound or a branch-and-cut MIP solver. The key idea...
  • Juniper

  • Referenced in 2 articles [sw26689]
  • Juniper: an open-source nonlinear branch-and-bound solver in Julia. Nonconvex mixed-integer nonlinear ... which have limited scalability. However, nonlinear branch-and-bound has recently been shown ... Julia-based open-source solver for nonlinear branch-and-bound. Leveraging the high-level Julia ... comparable with other nonlinear branch-and-bound solvers, such as {sc Bonmin}, {sc Minotaur...
  • BiqCrunch

  • Referenced in 7 articles [sw23686]
  • BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems. This article presents ... exact solver for binary quadratic optimization problems. BiqCrunch is a branch-and-bound method that...
  • SCIPPlan

  • Referenced in 2 articles [sw30743]
  • leverage the spatial branch-and-bound solver of SCIP inside a nonlinear constraint generation framework...
  • BBMCL

  • Referenced in 12 articles [sw11525]
  • coloring as a new paradigm for branch-and-bound exact maximum clique search. Approximate coloring ... years been at the heart of leading solvers in the field. Selective coloring proposes...
  • COCONUT

  • Referenced in 38 articles [sw04760]
  • converters and the two available global optimization solvers. For more information on obtaining the COCONUT ... solution algorithm is an advanced branch-and-bound scheme which proceeds by working...
  • QPBB

  • Referenced in 2 articles [sw31774]
  • branch-and-bound algorithm to solve it globally. We also derive bounds on key variables ... method with two well known global solvers, one of which requires the computed bounds...
  • BBMCSP

  • Referenced in 6 articles [sw17718]
  • paper describes a new very efficient branch-and-bound exact maximum clique algorithm BBMCSP, designed ... leading bit-parallel non-sparse solver but employs a novel sparse encoding for the adjacency...
  • Muriqui

  • Referenced in 1 article [sw32925]
  • Muriqui Optimizer is a solver of convex Mixed Integer Nonlinear Programming (MINLP) problems. Moreover, Muriqui ... such as: Outer Approximation; LP/NLP based Branch-And-Bound; Extended Cutting Plane; Extended Supporting Hyperplane...
  • Decogo

  • Referenced in 3 articles [sw32747]
  • methods are often based on a branch-and-bound (BB) search tree, which may grow ... global optimizer), a new parallel decomposition MINLP solver implemented in Python and Pyomo...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • Branch-and-Bound scheme and fill in the contents for its functional ingredients: branching strategies ... structural pruning, upper and lower cost bounds. This includes two novel ideas for strengthening ... tasks, the combinatorial core engine of the solver is an assortment of specially adapted cheapest...
  • ORCSolver

  • Referenced in 1 article [sw36183]
  • specification. Unfortunately, solving ORC layouts with current solvers is time-consuming and the needed time ... adaptive ORC layouts, based on a branch-and-bound approach with heuristic preprocessing. We demonstrate...
  • cGOP

  • Referenced in 1 article [sw20093]
  • solve these problems using decomposition and branch-and-bound techniques. It also incorporates several improvements ... Floudas, 1995). The algorithms use local optimization solvers (currently MINOS (Murtagh and Saunders...
  • BDMLP

  • Referenced in 0 articles [sw21972]
  • GAMS/BDMLP is a LP and MIP solver that comes for free with any GAMS system ... degenerate and are well scaled. The Branch-and-Bound algorithm for solving ... GAMS/BDMLP provides free access to a MIP solver that supports all of the discrete variable...
  • pyADCG

  • Referenced in 0 articles [sw15157]
  • preliminary implementation of a new parallel solver for nonconvex MINLPs in Pyomo/Python. In this talk ... Generation), is not based on the branch-and-bound approach. The basic idea of ADCG...
  • ALPS

  • Referenced in 15 articles [sw00036]
  • This paper describes the design of the Abstract...