
Biq Mac
 Referenced in 72 articles
[sw10532]
 Solving Maxcut to optimality by intersecting semidefinite and polyhedral relaxations. We present a method ... finding exact solutions of MaxCut, the problem of finding a cut of maximum weight ... obtain a “nearly optimal” solution of the basic semidefinite MaxCut relaxation, strengthened by triangle ... solving the basic semidefinite relaxation of the MaxCut problem, which has to be done...

CirCut
 Referenced in 42 articles
[sw04782]
 highquality approximation to the MAXCUT problem, but the cost associated with such ... relaxation. In order to achieve better practical performance, we propose an alternative, ranktwo relaxation ... approach leads to continuous optimization heuristics applicable to MAXCUT as well as other binary ... upper bound on the MAXCUT optimal value...

ACCPM
 Referenced in 59 articles
[sw06707]
 cutting plane method. Instead of solving every relaxed master problem to optimality...

ABACUS
 Referenced in 115 articles
[sw02948]
 problem specific parts, i.e., the separation of cutting planes, column generation, and primal heuristics. ABACUS ... used to solve the relaxations. Moreover, ABACUS provides a variety of general algorithmic concepts ... mixed integer optimization problems and for combinatorial optimization problems. It unifies cutting plane and column...

AlphaECP
 Referenced in 45 articles
[sw04940]
 method is an extension of Kelley’s cutting plane method which was originally given ... optimality, but can also be solved to feasibility or only to an integer relaxed solution ... Solving PseudoConvex Mixed Integer Optimization Problems by Cutting Plane Techniques. Optimization and Engineering...

DIP
 Referenced in 18 articles
[sw09870]
 solving largescale discrete optimization problems. The framework provides a simple API for experimenting with ... DantzigWolfe decomposition, Lagrangian relaxation, and various cutting plane methods. Given a compact formulation...

infinite group relaxation
 Referenced in 22 articles
[sw14600]
 group problem, an infinitedimensional relaxation of integer linear optimization problems introduced by Ralph Gomory ... group problem in the modern context of cut generating functions. It focuses on the recent...

DINS
 Referenced in 8 articles
[sw10145]
 branchandbound or a branchandcut MIP solver. The key idea ... distancemetric between the linear programming relaxation optimal solution and the current MIP feasible solution...

GCG
 Referenced in 22 articles
[sw10533]
 cutandprice framework SCIP and is also part of the SCIP Optimization Suite. After ... original problem and solves the LP relaxation of the extended formulation via column generation...

DAOmap
 Referenced in 2 articles
[sw26287]
 mapping costs encoded in the cuts drive the areaoptimization objective more effectively; (ii) after ... timing constraint is determined, we will relax the noncritical paths by searching the solution ... global optimality information to minimize mapping area; (iii) an iterative cut selection procedure is carried...

ADMM_QAP
 Referenced in 5 articles
[sw31756]
 optimization problems. There are several difficulties that arise in efficiently solving the SDP relaxation ... difficulty and high expense in adding cutting plane constraints. We propose using the alternating direction...

SHOT
 Referenced in 9 articles
[sw15630]
 solved to rapidly generate a tight linear relaxation of the original MINLP problem. After ... each iteration. Compared to the extended cutting plane algorithm ESH generates a tighter overestimated ... algorithm is implemented as the supporting hyperplane optimization toolkit (SHOT) solver, and an extensive numerical...

HEPAPS
 Referenced in 1 article
[sw02700]
 cut algorithm with simulated annealing algorithm is presented. In addition, the twodimensional relaxed method ... introduced to solve the geometrical optimization problem...

Muriqui
 Referenced in 1 article
[sw32925]
 convex problems, without the guarantee of obtaining optimal solution. Muriqui implements the main MINLP algorithms ... Approximation; LP/NLP based BranchAndBound; Extended Cutting Plane; Extended Supporting Hyperplane; Nonlinear Branch ... BranchandBound; Feasibility Pump; Diving heuristic; Relaxation Enforced Neighborhood Search; Integrality Gap Minimization Heuristic...

stprbh
 Referenced in 2 articles
[sw31781]
 good compromise between quality of root relaxation bounds and the size of the underlying ... formulation. We implemented a branchandcut algorithm for the STPRBH based ... unsolved ones, can be solved to proven optimality within a time limit...

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

BARON
 Referenced in 316 articles
[sw00066]
 BARON is a computational system for solving nonconvex...

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

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

Coq
 Referenced in 1807 articles
[sw00161]
 Coq is a formal proof management system. It...