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 Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

We study the computational complexity of one of the particular cases of theknapsack problem: the subset sum problem. For solving this problem we considerone of the basic variants of the Branch-and-Bound method in which anysub-problem is decomposed along the free variable with the maximal weight. Bythe complexity of solving a problem by the Branch-and-Bound method we mean thenumber of steps required for solving the problem by this method. In the paperwe obtain upper bounds on the complexity of solving the subset sum problem bythe Branch-and-Bound method. These bounds can be easily computed from the inputdata of the problem. So these bounds can be used for the the preliminaryestimation of the computational resources required for solving the subset sumproblem by the Branch-and-Bound method.

Upper bound on the number of steps for solving the subset sum problem by the Branch-and-Bound method