Тип публикации: доклад, тезисы доклада, статья из сборника материалов конференций
Конференция: XI Международная конференция студентов и молодых ученых; Томск; Томск
Год издания: 2014
Аннотация: Classical knapsack problem (CKP) refers to the number of well-known problems of discrete optimization. First CKP was formulated D. Danzig and since then has been actively studied, and its popularity is primarily caused by the large number of applications. Relevance of research predetermined prevalence and the importance of applied Показать полностьюproblems formulated in the framework of multicriteria problems knapsack type. The aim of this work is to study the various options setting of the knapsack problem, the implementation of the basic methods of solving these problems, classification and comparison of these methods. Supposed to perform a comparison of methods for solving the speed and accuracy of finding a solution.
Журнал: ПЕРСПЕКТИВЫ РАЗВИТИЯ ФУНДАМЕНТАЛЬНЫХ НАУК
Номера страниц: 591-593
Издатель: Национальный исследовательский Томский политехнический университет