Biq Mac
From MaRDI portal
Cited in
(only showing first 100 items - show all)- An active-set method for second-order conic-constrained quadratic programming
- 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
- On handling cutting planes in interior-point methods for solving semi-definite relaxations of binary quadratic optimization problems
- A framework for solving mixed-integer semidefinite programs
- Lifting and separation procedures for the cut polytope
- Engineering branch-and-cut algorithms for the equicut problem
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- QPLIB: a library of quadratic programming instances
- Mathematical programming models and exact algorithms
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A new separation algorithm for the Boolean quadric and cut polytopes
- Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
- 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
- QUBO software
- A multilevel analysis of the Lasserre hierarchy
- Semidefinite relaxations for partitioning, assignment and ordering problems
- Semidefinite relaxations for partitioning, assignment and ordering problems
- An exact combinatorial algorithm for minimum graph bisection
- \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM
- A generalized alternating direction method of multipliers with semi-proximal terms for convex composite conic programming
- An improved interior-point cutting-plane method for binary quadratic optimization
- Improving spectral bounds for clustering problems by Lagrangian relaxation
- A unified approach to mixed-integer optimization problems with logical constraints
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Dantzig-Wolfe reformulations for binary quadratic problems
- Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting
- Volume computation for sparse Boolean quadric relaxations
- Local search inequalities
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- Gaussian mean field lattice gas
- Spectral bounds for graph partitioning with prescribed partition sizes
- Extensions on ellipsoid bounds for quadratic integer programming
- Successive Lagrangian relaxation algorithm for nonconvex quadratic optimization
- Faster, but weaker, relaxations for quadratically constrained quadratic programs
- Primal-dual optimization algorithms over Riemannian manifolds: an iteration complexity analysis
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems
- Parametric Lagrangian dual for the binary quadratic programming problem
- New bounds for the -k-cut and chromatic number of a graph
- Maximum-entropy sampling and the Boolean quadric polytope
- Maximum cut in fuzzy nature: models and algorithms
- Generalised 2-circulant inequalities for the max-cut problem
- Computational approaches to MAX-cut
- A class of spectral bounds for max \(k\)-cut
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem
- Certifiably optimal sparse inverse covariance estimation
- A semidefinite optimization approach to the target visitation problem
- Convex optimization under combinatorial sparsity constraints
- A computational study and survey of methods for the single-row facility layout problem
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison
- A novel SDP relaxation for the quadratic assignment problem using cut pseudo bases
- An SDP approach to multi-level crossing minimization
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- A branch-and-bound algorithm for solving max-\(k\)-cut problem
- Cutting plane generation through sparse principal component analysis
- CSDP
- QAPLIB
- Concorde
- CirCut
- COL
- QSDP
- SDPLR
- ConicBundle
- FIR toolbox
- SpeeDP
- CQP
- SDP_S
- race
- PANDA
- SDPNAL
- ACOTSP
- BiqMac
- DISCO
- DryadOpt
- dsyevx
- SDPNAL+
- QuadProgBB
- MADAM
- CLIP
- SCIP-SDP
- TSpack
- QSDPNAL
- FrogCOL
- PARTY
- mplp2
- BOB
- Osprey
- MIQCR-CB
- Rudy
- BiqCrunch
- DQP
- QPLIB
- BBCPOP
- 2EBD-HPE
This page was built for software: Biq Mac
