Biq Mac

MaRDI QIDQ22491swMATHFDO

Official website http://biqmac.uni-klu.ac.at/

Described by source

• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

Cited in

(only showing first 100 items - show all)

• CSDP
• MADAM
• SDPSymmetryReduction.jl
• QAPLIB
• SOS-SDP
• CAPOPT
• ACVIZ
• HHBQP
• Computational study of valid inequalities for the maximum \(k\)-cut problem
• QSDP
• SDPLR
• Concorde
• CirCut
• COL
• On global optimization with indefinite quadratics
• ConicBundle
• FIR toolbox
• A multilevel analysis of the Lasserre hierarchy
• A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
• Local search inequalities
• Gaussian mean field lattice gas
• Maximum-entropy sampling and the Boolean quadric polytope
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
• SpeeDP
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
• An exact algorithm for graph partitioning
• CQP
• SDP_S
• race
• Parametric Lagrangian dual for the binary quadratic programming problem
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
• Convex optimization under combinatorial sparsity constraints
• Dantzig-Wolfe reformulations for binary quadratic problems
• Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
• A class of spectral bounds for max \(k\)-cut
• A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring
• Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
• Certifiably optimal sparse inverse covariance estimation
• Cuts in undirected graphs. I
• Cuts in undirected graphs. II
• 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
• A branch-and-bound algorithm for solving max-\(k\)-cut problem
• SDPNAL
• QPLIB: a library of quadratic programming instances
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints
• Theoretical and computational study of several linearisation techniques for binary quadratic problems
• Volume computation for sparse Boolean quadric relaxations
• A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
• Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
• ACOTSP
• Spectral bounds for graph partitioning with prescribed partition sizes
• A novel approach for solving semidefinite programs
• A new separation algorithm for the Boolean quadric and cut polytopes
• Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem
• LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
• On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
• A note on the 2-circulant inequalities for the MAX-cut problem
• A new approximation hierarchy for polynomial conic optimization
• Improved semidefinite bounding procedure for solving max-cut problems to optimality
• Computational protein design as an optimization problem
• PANDA
• BiqMac
• DISCO
• SDPNAL+
• DryadOpt
• dsyevx
• QuadProgBB
• MADAM
• CLIP
• A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
• Capping methods for the automatic configuration of optimization algorithms
• Generalised 2-circulant inequalities for the max-cut problem
• \texttt{EXPEDIS}: an exact penalty method over discrete sets
• Computational study of a branching algorithm for the maximum \(k\)-cut problem
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs
• A semidefinite relaxation based global algorithm for two-level graph partition problem
• SCIP-SDP
• TSpack
• Computational approaches to MAX-cut
• Discrete optimization with decision diagrams
• From Graph Orientation to the Unweighted Maximum Cut
• Relaxing nonconvex quadratic functions by multiple adaptive diagonal perturbations
• Exact solution methods for the k-item quadratic knapsack problem
• A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
• Engineering branch-and-cut algorithms for the equicut problem
• Techniques for submodular maximization
• An improved interior-point cutting-plane method for binary quadratic optimization
• On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
• Linear programing relaxations for a strategic pricing problem in electricity markets
• CBLIB 2014: a benchmark library for conic mixed-integer and continuous optimization
• Polynomially solvable cases of binary quadratic programs
• QSDPNAL
• Contraction-based separation and lifting for solving the max-cut problem
• Duality gap estimation of linear equality constrained binary quadratic programming
• FrogCOL
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• PARTY
• mplp2
• Osprey

This page was built for software: Biq Mac