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...
Saved in:
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 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Construction of Generating Feasible Subsets in the Knapsack Problem
by: S. V. Chebakov, et al.
Published: (2025-04-01) -
OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE
by: S. V. Chebakov, et al.
Published: (2019-06-01) -
Sequential Model of Economic System and Constrained Pareto Optimality
by: Zoran Popovic, et al.
Published: (2017-03-01) -
Method of Achieving the Goal on a Graph Model with Two Quality Criteria
by: S. V. Chebakov, et al.
Published: (2023-08-01) -
MODIFICATION OF FIREWORKS METHOD FOR MULTIOBJECTIVE OPTIMIZATION BASED ON NON-DOMINATED SORTING
by: A. V. Panteleev, et al.
Published: (2019-06-01)