• CVRPSP

  • Referenced in 120 articles [sw13447]
  • various classes of cuts in branch-and-cut algorithms for the Capacitated Vehicle Routing Problem ... were used in ”A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem...
  • CALMA

  • Referenced in 105 articles [sw03235]
  • participants developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques ... variety of local search methods, genetic algorithms, neural networks, and potential reduction. These algorithms were...
  • CVRPSEP

  • Referenced in 38 articles [sw11809]
  • various classes of cuts in branch-and-cut algorithms for the Capacitated Vehicle Routing Problem ... were used in ”A New Branch-and-Cut Algorithm for the Capacitated Vehicle Routing Problem...
  • ABACUS

  • Referenced in 115 articles [sw02948]
  • implementation of branch-and-bound algorithms using linear programming relaxations. Cutting planes or columns ... generated dynamically (branch-and-cut, branch-and-price, branch-and-cut-and-price). ABACUS allows ... problem specific parts, i.e., the separation of cutting planes, column generation, and primal heuristics. ABACUS ... Moreover, ABACUS provides a variety of general algorithmic concepts, e.g., a list of different enumeration...
  • OGDF

  • Referenced in 32 articles [sw04102]
  • that allow to reuse and replace particular algorithm phases by using a dedicated module mechanism ... libraries (except for some optional branch-and-cut algorithms). Portable C++-code that supports...
  • FilMINT

  • Referenced in 44 articles [sw06197]
  • Grossmann} [“An LP/NLP based branch-and-bound algorithm for convex MINLP optimization problems.” Comput. Chemical ... linearizations at open nodes of the branch-and-bound tree whenever an integer solution ... solver, FilMINT, combines the MINTO branch-and-cut framework for MILP with filterSQP to solve ... programs that arise as subproblems in the algorithm. The MINTO framework allows us to easily...
  • LaGO

  • Referenced in 25 articles [sw02040]
  • Branch-and-Cut solver for block-separable not necessarily convex MINLPs. This algorithm is illustrated...
  • Octane

  • Referenced in 24 articles [sw19782]
  • unit hypercube. We give efficient algorithms to carry out the enumeration, and we explain ... heuristic can be embedded in a branch-and-cut framework. Finally, we present computational results...
  • LPCCbnc

  • Referenced in 4 articles [sw31750]
  • optimization problem. We develop a branch-and-cut algorithm to find a global optimum...
  • GeoSteiner

  • Referenced in 22 articles [sw04320]
  • influenced by Winter, published the Salowe-Warme algorithm. It used backtrack search to concatenate rectilinear ... dissertation described a new branch-and-cut code for finding minimum spanning trees in arbitrary...
  • stprbh

  • Referenced in 2 articles [sw31781]
  • formulation. We implemented a branch-and-cut algorithm for the STPRBH based...
  • VIPR

  • Referenced in 3 articles [sw18034]
  • elementary file format for LP-based branch-and-cut certificates proposed in the article ”Kevin ... exact arithmetic may suffer from programming or algorithmic errors, motivating the desire...
  • ALPS

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

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

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

  • Referenced in 200 articles [sw00169]
  • CSDP, A C Library for Semidefinite Programming. This...
  • GAP

  • Referenced in 2948 articles [sw00320]
  • GAP is a system for computational discrete algebra...
  • KNITRO

  • Referenced in 180 articles [sw00490]
  • KNITRO is a solver for nonlinear optimization. It...
  • LAPACK

  • Referenced in 1647 articles [sw00503]
  • LAPACK is written in Fortran 90 and provides...
  • LEDA

  • Referenced in 261 articles [sw00509]
  • In the core computer science areas -- data structures...