OPTIMIZATION OF THE PROBLEM SOLVING WITH LIMITED RESOURCE

Doklady Belorusskogo gosudarstvennogo universiteta informatiki i radioèlektroniki

L. V. Serebryanaya¹  S. V. Chebakov² 

[1] Белорусский государственный университет информатики и радиоэлектроники;Объединенный институт проблем информатики НАН Беларуси;

关键词: knapsack problem;    pareto layers;    pareto set;   

DOI  :  

来源: DOAJ

【 摘 要 】

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 data is developed. The algorithm of pareto elements division into subsets with ordered upper and lower criteria borders is executed. The complexity estimation of proposed algorithms is realized and the general approach to the knapsack problem solving is presented.

【 授权许可】

Unknown