Construction of Generating Feasible Subsets in the Knapsack Problem
A method for constructing a group of generating feasible subsets in the knapsack problem under the condition that the non-dominance depth of a given Pareto layer is greater than zero is developed. The method is based on a multicriterial mathematical model for solving the knapsack problem with two qu...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | Russian |
| Published: |
Educational institution «Belarusian State University of Informatics and Radioelectronics»
2025-04-01
|
| Series: | Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki |
| Subjects: | |
| Online Access: | https://doklady.bsuir.by/jour/article/view/4115 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|