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

This scientific paper deals with the knapsack optimization task and solving method based on the local search in the boolean space. The obtained by the author analytical formulas for assessment of the upper bound for the amount of enumeration of points in the boolean space and lower bound for the quality of suboptimal solutions in the process of solving the knapsack optimization problem by the local search method are also discussed. Finally, the results of experimental research of the amount of enumeration of points in the boolean space and quality of suboptimal solutions for the different initial conditions of the knapsack optimization task, which confirmed the analytical formulas, are also given.

Analysis of characteristics of the local search method in the process of solving the knapsack optimization problem in the decision support systems