• ABACUS

  • Referenced in 106 articles [sw02948]
  • bound algorithms using linear programming relaxations. Cutting planes or columns can be generated dynamically (branch ... specific parts, i.e., the separation of cutting planes, column generation, and primal heuristics. ABACUS supports ... combinatorial optimization problems. It unifies cutting plane and column generation within one algorithm framework. Simple...
  • ACCPM

  • Referenced in 56 articles [sw06707]
  • code is an implementation of the cutting plane method. Instead of solving every relaxed master...
  • AlphaECP

  • Referenced in 29 articles [sw04940]
  • Programming) solver based on the extended cutting plane (ECP) method. The solver can be applied ... extension of Kelley’s cutting plane method which was originally given for convex NLP problems ... Convex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization and Engineering...
  • bc-prod

  • Referenced in 31 articles [sw10663]
  • system including lot-sizing specific preprocessing, cutting planes for different aspects of lot-sizing problems ... plus general cutting planes, and a lot-sizing-specific primal heuristic. Results are presented...
  • FilMINT

  • Referenced in 35 articles [sw06197]
  • framework allows us to easily employ cutting planes, primal heuristics, and other well-known MILP...
  • Pueblo

  • Referenced in 26 articles [sw00743]
  • achieve this, we adopt the cutting-plane technique to draw inferences among PB constraints...
  • DIP

  • Referenced in 8 articles [sw09870]
  • Wolfe decomposition, Lagrangian relaxation, and various cutting plane methods. Given a compact formulation ... decomposition-based algorithms, such as branch and cut, branch and price, branch...
  • GGPECP

  • Referenced in 3 articles [sw08450]
  • solving non-convex MINLP problems by cutting plane and transformation techniques...
  • EMOSL

  • Referenced in 3 articles [sw13460]
  • implementations of three MIP heuristics and cutting planes techniques...
  • CUTSDP

  • Referenced in 2 articles [sw05123]
  • Toolbox for a Cutting-Plane Approach Based on Semidefinite Programming...
  • CPA

  • Referenced in 1 article [sw10520]
  • Cutting plane algorithms for two-stage stochastic programming. 2002, URL: http//www-neos.mcs.anl.gov/neos/solvers/SLP:CPA/, accessed April...
  • ALIBABA

  • Referenced in 1 article [sw00028]
  • step line search algorithm and/or the cutting plane method. Secondly, a simple algorithm for optimization...
  • SHOT

  • Referenced in 1 article [sw15630]
  • each iteration. Compared to the extended cutting plane algorithm ESH generates a tighter overestimated...
  • ElAM

  • Referenced in 1 article [sw12498]
  • also produce 2D cuts in any given plane, compute averages following diverse schemes and query...
  • GeoSteiner

  • Referenced in 14 articles [sw04320]
  • dissertation described a new branch-and-cut code for finding minimum spanning trees in arbitrary ... problems: Euclidean Steiner Tree Problem in the Plane, Rectilinear Steiner Tree Problem in the Plane...
  • GeoSMA-3D

  • Referenced in 1 article [sw19569]
  • techniques are applied to distinguish all blocks cut by 3D finite random or fixed discontinuities ... requirements of spatial block modeling, joint plane simulation, key block identification and analysis and sliding...
  • FHI-gap

  • Referenced in 1 article [sw10804]
  • code based on the all-electron augmented plane wave method. The GWGW method has become ... results with respect to various cut-off parameters. These include the size of the basis...
  • BARON

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

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

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