BiqBin: Moving Boundaries for NP-hard Problems by HPC

DOI10.1007/978-3-030-55347-0_28zbMath1440.90061OpenAlexW3047949933MaRDI QIDQ5119114

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

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 optimizationstable set problemonline solver

Mathematics Subject Classification ID

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

Related Items

BiqBin

Uses Software

• MKL
• BiqMac
• BiqCrunch

Cites Work

• Unnamed Item
• Semidefinite approximations for quadratic programs over orthogonal matrices
• Handbook on semidefinite, conic and polynomial optimization
• Copositive and semidefinite relaxations of the quadratic assignment problem
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• A boundary point method to solve semidefinite programs
• A MAX-CUT formulation of 0/1 programs
• Linear and nonlinear optimization
• An Introduction to Statistical Learning
• Contribution of copositive formulations to the graph partitioning problem
• Regularization Methods for Semidefinite Programming