Finding algorithm of optimal subset structure based on the Pareto layers in the knapsack problem
An algorithm is developed for finding the structure of the optimal subset in the knapsack problem based on the proposed multicriteria optimization model. A two-criteria relation of preference between elements of the set of initial data is introduced. This set has been split into separate Pareto laye...
Main Authors: | Sergey V. Chebakov, Liya V. Serebryanaya |
---|---|
Format: | Article |
Language: | Belarusian |
Published: |
Belarusian State University
2020-07-01
|
Series: | Журнал Белорусского государственного университета: Математика, информатика |
Subjects: | |
Online Access: | https://journals.bsu.by/index.php/mathematics/article/view/2738 |
Similar Items
-
FINDING OF OPTIMAL SUBSET STRUCTURE IN THE KNAPSACK PROBLEM
by: S. V. Chebakov, et al.
Published: (2019-10-01) -
OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE
by: S. V. Chebakov, et al.
Published: (2019-06-01) -
Multicriteria Optimization of Gasification Operational Parameters Using a Pareto Genetic Algorithm
by: Miguel Caldas, et al.
Published: (2005-04-01) -
On the invariance of the Pareto optimal set
by: Vincentiu Dumitru, et al.
Published: (1993-12-01) -
The PARETO RATING Software System for the Paretoapproximation Quality Assessment in Multi-criteria Optimization Problem
by: S. V. Groshev, et al.
Published: (2014-01-01)