BiqBin: moving boundaries for NP-hard problems by HPC

DOI10.1007/978-3-030-55347-0_28MaRDI QIDQ5119114zbMATH OpenOpenAlexFDO

Authors Timotej Hrga, Borut Lužar, Janez Povh, Angelika Wiegele

Publication date 3 September 2020

Published in Advances in High Performance Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-55347-0_28

zbMATH Keywords

high-performance computingmathematical optimizationonline solverstable set problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Numerical algorithms for specific classes of architectures (65Y10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 1163098
• Solving large quadratic assignment problems on computational grids
• BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
• A parallel branch and bound algorithm for the quadratic assignment problem
• Solving large quadratic assignment problems in parallel

Cites work

• A boundary point method to solve semidefinite programs
• A MAX-CUT formulation of 0/1 programs
• An introduction to statistical learning. With applications in R
• Contribution of copositive formulations to the graph partitioning problem
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Handbook on semidefinite, conic and polynomial optimization
• scientific article; zbMATH DE number 956839 (Why is no real title available?)
• Linear and nonlinear optimization
• Regularization methods for semidefinite programming
• Semidefinite approximations for quadratic programs over orthogonal matrices
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations

Cited in

(3)

• BiqBin
• An experimental evaluation of semidefinite programming and spectral algorithms for max cut
• Quantum computing and the stable set problem

Describes a project that uses

Uses Software

• BiqMac
• BiqCrunch
• MKL

This page was built for publication: BiqBin: moving boundaries for NP-hard problems by HPC

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5119114)