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 Tools annual

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 monthly

Global: Zendy Plus monthly

Presents the access of premium content as premium feature

Premium Content

Global: Zendy Plus annual

Global: Zendy Free Plan

For integer quadratic programming problems, a new branch and bound algorithm is proposed in this paper through a series of improvements on the traditional branch and bound algorithm, which can be used to solve integer quadratic programming problems effectively and efficiently. This algorithm employs a new linear relaxation and bound method and a rectangular deep bisection method. At the same time, a rectangular reduction strategy is used to improve the approximation degree and speed up the convergence of the algorithm. Numerical results show that the proposed algorithm is feasible and effective and has improved the existing relevant branch and bound algorithms. c ©2016 All rights reserved.

A new branch and bound algorithm for integer quadratic programming problems