FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM

FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM

An algorithm for solving the knapsack problem based on the proposed multi-criteria model is considered. The implementation of this algorithm allows to define the structure of the optimal subset as a union of certain elements of a Pareto layers group into which a initial data set is divided. The firs...

Full description

Bibliographic Details
Main Authors: S. V. Chebakov, L. V. Serebryanaya
Format: Article
Language:Russian
Published: Educational institution «Belarusian State University of Informatics and Radioelectronics» 2019-10-01
Series:Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki
Subjects:
the knapsack problem
two-critarial optimization
pareto subset
optimal subset
pareto layers
Online Access:https://doklady.bsuir.by/jour/article/view/1197

Similar Items

Similar Items