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...
| Hlavní autoři: | , |
|---|---|
| Médium: | Článek |
| Jazyk: | Russian |
| Vydáno: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2019-10-01
|
| Edice: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Témata: | |
| On-line přístup: | https://doklady.bsuir.by/jour/article/view/1197 |