BiqMac
From MaRDI portal
Software:24588
No author found.
Related Items (27)
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints ⋮ CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization ⋮ Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints ⋮ Computational study of valid inequalities for the maximum \(k\)-cut problem ⋮ Conic approximation to quadratic optimization with linear complementarity constraints ⋮ Cutting Plane Generation through Sparse Principal Component Analysis ⋮ Capping methods for the automatic configuration of optimization algorithms ⋮ Computational study of a branching algorithm for the maximum \(k\)-cut problem ⋮ Lifting and separation procedures for the cut polytope ⋮ Alternating direction augmented Lagrangian methods for semidefinite programming ⋮ BiqBin: Moving Boundaries for NP-hard Problems by HPC ⋮ Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis ⋮ Improved semidefinite bounding procedure for solving max-cut problems to optimality ⋮ On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming ⋮ \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM ⋮ Valuated matroid-based algorithm for submodular welfare problem ⋮ A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints ⋮ A robust Lagrangian-DNN method for a class of quadratic optimization problems ⋮ Maximum cut in fuzzy nature: models and algorithms ⋮ A Hopfield neural network applied to the fuzzy maximum cut problem under credibility measure ⋮ Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints ⋮ Theoretical and computational study of several linearisation techniques for binary quadratic problems ⋮ Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results ⋮ A Newton-bracketing method for a simple conic optimization problem ⋮ A novel approach for solving semidefinite programs ⋮ A new separation algorithm for the Boolean quadric and cut polytopes ⋮ A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
This page was built for software: BiqMac
