Cited in
(52)- Computational study of a branching algorithm for the maximum \(k\)-cut problem
- A novel approach for solving semidefinite programs
- Theoretical and computational study of several linearisation techniques for binary quadratic problems
- BiqBin: moving boundaries for NP-hard problems by HPC
- Lifting and separation procedures for the cut polytope
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- A new separation algorithm for the Boolean quadric and cut polytopes
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Alternating direction augmented Lagrangian methods for semidefinite programming
- Conic approximation to quadratic optimization with linear complementarity constraints
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- A unified approach to mixed-integer optimization problems with logical constraints
- A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- Maximum cut in fuzzy nature: models and algorithms
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- Cutting plane generation through sparse principal component analysis
- FIR toolbox
- race
- Biq Mac
- SDPNAL
- ACOTSP
- dsyevx
- SDPNAL+
- MADAM
- TSpack
- FrogCOL
- BOB
- Rudy
- BiqCrunch
- BBCPOP
- 2EBD-HPE
- POLIP
- BiqBin
- quadprogIP
- Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
- Computational study of valid inequalities for the maximum \(k\)-cut problem
- CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
- Valuated matroid-based algorithm for submodular welfare problem
- MADAM
- Capping methods for the automatic configuration of optimization algorithms
- SDPSymmetryReduction.jl
- SOS-SDP
- ACVIZ
- CAPOPT
- HHBQP
- A Newton-bracketing method for a simple conic optimization problem
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
- MQLib
- A robust Lagrangian-DNN method for a class of quadratic optimization problems
This page was built for software: BiqMac
