BiqCrunch
From MaRDI portal
Publication:3133583
DOI10.1145/3005345zbMath1380.90284OpenAlexW2562729437WikidataQ113310149 ScholiaQ113310149MaRDI QIDQ3133583
Nathan Krislock, Frédéric Roupin, Jérôme Malick
Publication date: 5 February 2018
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/3005345
quasi-Newton methodssemidefinite relaxationsNP-hard problemsbinary quadratic programmingexact resolution
Semidefinite programming (90C22) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Quadratic programming (90C20) Complexity and performance of numerical algorithms (65Y20)
Related Items
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, Dantzig-Wolfe reformulations for binary quadratic problems, Mathematical Programming Models and Exact Algorithms, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, BDD-based optimization for the quadratic stable set problem, \texttt{EXPEDIS}: an exact penalty method over discrete sets, Partial Lasserre relaxation for sparse Max-Cut, An entropy-regularized ADMM for binary quadratic programming, Faster exact solution of sparse maxcut and QUBO problems, A new global algorithm for max-cut problem with chordal sparsity, A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming, A subgradient approach for constrained binary optimization via quantum adiabatic evolution, A matrix nonconvex relaxation approach to unconstrained binary polynomial programs, An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating, \texttt{MADAM}: a parallel exact solver for max-cut based on semidefinite programming and ADMM, QPLIB: a library of quadratic programming instances, BiqCrunch
Uses Software
