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
-
OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE
by: S. V. Chebakov, et al.
Published: (2019-06-01) -
MODIFICATION OF FIREWORKS METHOD FOR MULTIOBJECTIVE OPTIMIZATION BASED ON NON-DOMINATED SORTING
by: A. V. Panteleev, et al.
Published: (2019-06-01) -
THE CONSTRUCTION OF SOFT SETS FROM FUZZY SUBSETS
by: Na'imah Hijriati, et al.
Published: (2023-09-01) -
On а Recursive-Parallel Algorithm for Solving the Knapsack Problem
by: Vladimir V. Vasilchikov
Published: (2018-04-01) -
Multi-criteria vehicle routing problem for a real-life parcel locker-based delivery
by: Radosław Idzikowski, et al.
Published: (2025-07-01)