English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

We present BiqBin, an exact solver for linearly constrained binary quadraticproblems. Our approach is based on an exact penalty method to first efficientlytransform the original problem into an instance of Max-Cut, and then to solvethe Max-Cut problem by a branch-and-bound algorithm. All the main ingredientsare carefully developed using new semidefinite programming relaxations obtainedby strengthening the existing relaxations with a set of hypermetricinequalities, applying the bundle method as the bounding routine and using newstrategies for exploring the branch-and-bound tree.  Furthermore, an efficient C implementation of a sequential and a parallelbranch-and-bound algorithm is presented. The latter is based on a loadcoordinator-worker scheme using MPI for multi-node parallelization and isevaluated on a high-performance computer.  The new solver is benchmarked against BiqCrunch, GUROBI, and SCIP on fourfamilies of (linearly constrained) binary quadratic problems. Numerical resultsdemonstrate that BiqBin is a highly competitive solver. The serial versionoutperforms the other three solvers on the majority of the benchmark instances.We also evaluate the parallel solver and show that it has good scalingproperties. The general audience can use it as an on-line service available athttp://www.biqbin.eu.

BiqBin: a parallel branch-and-bound solver for binary quadratic problems with linear constraints