検索結果 - S. V. Chebakov

The decision method of two combinatorial tasks about finding of optimum subset on the given set of initial data is offered. The task about knapsack and the task about length covering are founded on use the mathematical formulas of many-critarial optimization. In developed algorithms is executed sear...

詳細記述

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...

詳細記述

The many-criterial task of pareto alternatives finding at a dynamic set of initial data is considered. The general scheme of construction of partial solutions in a case when each element is formed on certain computing algorithm is presented. Concepts of dominating and dominated vectors on pareto set...

詳細記述

The features of the construction and application of graph models for solving applied problems are considered. A graph model with two quality criteria is proposed, on which the search for optimal paths between given graph vertices is performed. Each edge of the graph has a weighting factor that deter...

詳細記述

The knapsack problem is analyzed on the basis of the mathematical model, which uses the means of multicriterial optimization. The method which defines possible redundancy of the initial data set is offered for the problem. The algorithm of the transition to the task with a changed set of initial dat...

詳細記述

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...

詳細記述

A two-stage algorithm for solving the optimization task for finding the Pareto set on a given finite set of initial data N is proposed. A method is developed for finding a subset of dominated elements of the initial set N by constructing the Pareto layers on two-criterial subspaces that does not use...

詳細記述