BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
From MaRDI portal
Publication:5883708
DOI10.1145/3514039OpenAlexW3085548870WikidataQ113309844 ScholiaQ113309844MaRDI QIDQ5883708FDOQ5883708
Authors: Nicolò Gusmeroli, Timotej Hrga, Borut Lužar, Janez Povh, Melanie Siebenhofer, Angelika Wiegele 
Publication date: 22 March 2023
Published in: ACM Transactions on Mathematical Software (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2009.06240
Cites Work
- The quadratic knapsack problem -- a survey
- An introduction to statistical learning. With applications in R
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- QPLIB: a library of quadratic programming instances
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- Title not available (Why is that?)
- Reducibility among combinatorial problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Applications of cut polyhedra. II
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Metaheuristic clustering
- A review on algorithms for maximum clique problems
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- A survey on parallel computing and its applications in data-parallel problems using GPU architectures
- Polynomial integrality gaps for strong SDP relaxations of densest \(k\)-subgraph
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- Experiments in quadratic 0-1 programming
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- A MAX-CUT formulation of 0/1 programs
- Title not available (Why is that?)
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
Cited In (6)
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- BiqBin
- Faster exact solution of sparse maxcut and QUBO problems
Uses Software
This page was built for publication: BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5883708)
