• MAiNGO

  • Referenced in 8 articles [sw27878]
  • MAiNGO: McCormick based Algorithm for mixed integer Nonlinear Global Optimization. MAiNGO is a deterministic global ... branch-and-bound with some state-of-the-art bound tightening techniqueslike duality-based bound ... tightening and optimization-based bound tightening, it implements spe-cialized heuristics for tightening McCormick relaxations ... multistart heuristic. Thisreport summarizes the capabilities, algorithm, and software structure of the current version ofMAiNGO...
  • Muriqui

  • Referenced in 2 articles [sw32925]
  • MINLP algorithms from Literature, such as: Outer Approximation; LP/NLP based Branch-And-Bound; Extended Cutting...
  • DOGS-PFSP

  • Referenced in 1 article [sw42308]
  • minimization). This algorithm combines branching strategies inspired by recent branch-and-bounds and a guidance ... compared to the state-of-the-art algorithms, reports many new-best-so-far solutions...
  • ROCS

  • Referenced in 5 articles [sw28114]
  • dynamical systems. This paper presents ROCS, an algorithmic control synthesis tool for nonlinear dynamical systems ... core of ROCS is the interval branch-and-bound scheme with a precision control parameter...
  • 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...
  • MAIC

  • Referenced in 8 articles [sw19964]
  • propose a branch and bound search algorithm for a mixed integer nonlinear programming formulation ... methods to find lower and upper bounds, and branching rules for this minimization. We then ... mathematical optimization software and a branch-and-bound framework. We show that the proposed method...
  • ODEA

  • Referenced in 3 articles [sw07671]
  • practical enough to allow for efficient algorithmic treatment of real-world instances. We introduce ... 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 ... testbed and perform extensive testing of our algorithms throughout all development stages. We conclude with...
  • pyADCG

  • Referenced in 0 articles [sw15157]
  • Generation), is not based on the branch-and-bound approach. The basic idea of ADCG ... zero, see http://www.optimization-online.org/DB_HTML/2015/12/5233.html. We discuss algorithmic variants and report first numerical results...
  • ALPS

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

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

  • Referenced in 41 articles [sw00088]
  • BPMPD is a state-of-the-art implementation...
  • cdd

  • Referenced in 119 articles [sw00114]
  • The program cdd+ (cdd, respectively) is a C...
  • CDT

  • Referenced in 12 articles [sw00116]
  • Algorithm 750: CDT: A subroutine for the exact...
  • CGAL

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

  • Referenced in 1898 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 3190 articles [sw00320]
  • GAP is a system for computational discrete algebra...