BiqMac

swMATH12662MaRDI QIDQ24588FDOQ24588

Author name not available (Why is that?)

Cited In (27)

• 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
• Lifting and separation procedures for the cut polytope
• Cutting Plane Generation through Sparse Principal Component Analysis
• 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 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
• 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
• BiqBin: Moving Boundaries for NP-hard Problems by HPC
• Capping methods for the automatic configuration of optimization algorithms
• A Newton-bracketing method for a simple conic optimization problem
• Valuated matroid-based algorithm for submodular welfare problem
• BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
• A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints
• A robust Lagrangian-DNN method for a class of quadratic optimization problems

This page was built for software: BiqMac