Автор(ы): Лазарев А. А. (ИПУ РАН, Лаборатория 68)Werner F. (?)Автор(ов): 2 Параметры публикацииТип публикации: Статья в журнале/сборникеНазвание: A Graphical Realization of the Dynamic Programming Method for Solving NP-Hard Combinatorial ProblemsЭлектронная публикация: ДаISBN/ISSN: 0898-1221Наименование источника: Computers & Mathematics with ApplicationsОбозначение и номер тома: 58Город: MagdeburgИздательство: ElsevierГод издания: 2009Страницы: 619-631 АннотацияIn this paper we consider a graphical realization of dynamic programming. The concept isdiscussed on the partition and knapsack problems. In contrast to dynamic programming,the new algorithm can also treat problems with non-integer data without necessarytransformations of the corresponding problem. We compare the proposed method withexisting algorithms for these problems on small-size instances of the partition problemwith n Библиографическая ссылка: Лазарев А.А., Werner F. A Graphical Realization of the Dynamic Programming Method for Solving NP-Hard Combinatorial Problems // Computers & Mathematics with Applications. 2009. 58. С. 619-631.