BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints
From MaRDI portal
(Redirected from Publication:5883708)
Cites work
- \texttt{EXPEDIS}: an exact penalty method over discrete sets
- A MAX-CUT formulation of 0/1 programs
- A review on algorithms for maximum clique problems
- A survey on parallel computing and its applications in data-parallel problems using GPU architectures
- An introduction to statistical learning. With applications in R
- Applications of cut polyhedra. II
- BiqCrunch: a semidefinite branch-and-bound method for solving binary quadratic problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Different Formulations for Solving the HeaviestK-Subgraph Problem
- Experiments in quadratic 0-1 programming
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2159019 (Why is no real title available?)
- scientific article; zbMATH DE number 4119953 (Why is no real title available?)
- scientific article; zbMATH DE number 778133 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Improved semidefinite bounding procedure for solving max-cut problems to optimality
- Metaheuristic clustering
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture
- Polynomial integrality gaps for strong SDP relaxations of densest k-subgraph
- QPLIB: a library of quadratic programming instances
- Reducibility among combinatorial problems
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- The quadratic knapsack problem -- a survey
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
Cited in
(14)- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- BiqBin
- Faster exact solution of sparse maxcut and QUBO problems
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B
- BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints
- Solving the set covering problem with conflicts on sets: a new parallel GRASP
- Branch-and-bound algorithms for the K -cluster problem based on SDP bounds evaluated by Lagrangian relaxation
- Quantum computing and the stable set problem
- On the numerical solution of Lasserre relaxations of unconstrained binary quadratic optimization problem
- SDP-based Benders decomposition for solving p-median quadratic facility location problems
- Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints
- A large population island framework for the unconstrained binary quadratic problem
- Computing the edge expansion of a graph using semidefinite programming
- Edge expansion of a graph: SDP-based computational strategies
Describes a project that uses
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)
