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...
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: | |
Online Access: | https://doklady.bsuir.by/jour/article/view/1197 |
Similar Items
-
OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE
by: S. V. Chebakov, et al.
Published: (2019-06-01) -
Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01) -
A Feature-Independent Hyper-Heuristic Approach for Solving the Knapsack Problem
by: Xavier Sánchez-Díaz, et al.
Published: (2021-10-01) -
Evolution of Knapsack Ciphersystems
by: Georgii Ivanovich Borzunov, et al.
Published: (2015-03-01) -
Binary light spectrum optimizer for knapsack problems: An improved model
by: Mohamed Abdel-Basset, et al.
Published: (2023-03-01)