• Maple

  • Referenced in 5363 articles [sw00545]
  • result of over 30 years of cutting-edge research and development, Maple helps you analyze...
  • SCIP

  • Referenced in 536 articles [sw01091]
  • framework for constraint integer programming and branch-cut-and-price. It allows for total control...
  • ETPS

  • Referenced in 160 articles [sw06302]
  • type theory. The latter is a cut-down version of TPS intended ... natural deduction proofs which do not contain cuts into expansion proofs, and solving unification problems...
  • ABACUS

  • Referenced in 116 articles [sw02948]
  • bound algorithms using linear programming relaxations. Cutting planes or columns can be generated dynamically (branch ... cut, branch-and-price, branch-and-cut-and-price). ABACUS allows the software developer ... problem specific parts, i.e., the separation of cutting planes, column generation, and primal heuristics. ABACUS ... combinatorial optimization problems. It unifies cutting plane and column generation within one algorithm framework. Simple...
  • CVRPSP

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

  • Referenced in 115 articles [sw15842]
  • GrabCut: interactive foreground extraction using iterated graph cuts. The problem of efficient, interactive foreground/background segmentation ... approach based on optimization by graph-cut has been developed which successfully combines both types ... this paper we extend the graph-cut approach in three respects. First, we have developed...
  • CutFEM

  • Referenced in 182 articles [sw15034]
  • robust unfitted finite element methods on cut meshes. These methods are designed to facilitate computations...
  • GLPK

  • Referenced in 181 articles [sw04560]
  • primal-dual interior-point method, branch-and-cut method, translator for GNU MathProg, application program...
  • Biq Mac

  • Referenced in 88 articles [sw10532]
  • Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations. We present a method ... finding exact solutions of Max-Cut, the problem of finding a cut of maximum weight ... optimal” solution of the basic semidefinite Max-Cut relaxation, strengthened by triangle inequalities. The expensive ... basic semidefinite relaxation of the Max-Cut problem, which has to be done several times...
  • MAXFLOW

  • Referenced in 134 articles [sw13223]
  • described in ”An Experimental Comparison of Min-Cut/Max-Flow Algorithms for Energy Minimization in Vision...
  • VTK

  • Referenced in 115 articles [sw10593]
  • implicit modeling, polygon reduction, mesh smoothing, cutting, contouring, and Delaunay triangulation. VTK has an extensive...
  • CALMA

  • Referenced in 106 articles [sw03235]
  • developed optimization algorithms based on branch-and-cut and constraint satisfaction, and approximation techniques including...
  • TPS

  • Referenced in 73 articles [sw00973]
  • type theory. The latter is a cut-down version of TPS intended ... natural deduction proofs which do not contain cuts into expansion proofs, and solving unification problems...
  • CHIP

  • Referenced in 82 articles [sw03450]
  • Solving a cutting-stock problem with the constraint logic programming language CHIP...
  • AlphaECP

  • Referenced in 49 articles [sw04940]
  • Linear Programming) solver based on the extended cutting plane (ECP) method. The solver ... method is an extension of Kelley’s cutting plane method which was originally given ... Pseudo-Convex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization and Engineering...
  • Outward rotations

  • Referenced in 45 articles [sw08660]
  • semidefinite programming relaxations, with applications to MAX CUT and other problems. We present a tool ... obtain an approximation algorithm for MAX CUT that, in many interesting cases, performs better than ... Introduction MAX CUT is perhaps the simplest and most natural APX-complete constraint satisfaction problem ... example, is just choosing a random cut. No performance guarantee better than 1/2 was known...
  • LIMDEP

  • Referenced in 77 articles [sw04925]
  • provided many recent innovations including cutting edge techniques in panel data analysis, frontier and efficiency...
  • GloMIQO

  • Referenced in 77 articles [sw06266]
  • problems formulated as MIQCQP include: point packing, cutting convex shapes from rectangles, maximizing the area...
  • CirCut

  • Referenced in 42 articles [sw04782]
  • Rank-two relaxation heuristics for MAX-CUT and other binary quadratic programs The Goemans--Williamson ... high-quality approximation to the MAX-CUT problem, but the cost associated with such ... continuous optimization heuristics applicable to MAX-CUT as well as other binary quadratic programs ... code for effectively solving a particular MAX-CUT problem arising in physics. Computational results show...
  • FilMINT

  • Referenced in 51 articles [sw06197]
  • solver, FilMINT, combines the MINTO branch-and-cut framework for MILP with filterSQP to solve ... MINTO framework allows us to easily employ cutting planes, primal heuristics, and other well-known...