4627

Автор(ы): 

Автор(ов): 

2

Параметры публикации

Тип публикации: 

Книга (брошюра, монография, стандарт)

Название: 

A Graphical Approach for Solving NP-Hard Combinatorial Problems

Город: 

  • Magdeburg

Издательство: 

  • Otto-von-Guericke Universitaet

Год издания: 

2008

Объём, стр.: 

27
Аннотация
In this paper we consider a graphical realization of dynamic programming.The concept is discussed on the partition and knapsack problems. In contrast to dynamic programming, the new algorithm can also treat problems with non-integer data without necessary transformations of the corresponding problem. We compare the proposed method with existing lgorithms for these problems on small-size instances of the partition problem with $n \le 10$ numbers. For almost all instances, the new algorithm considers on average substantially less "stages" than the dynamic programming algorithm.

Библиографическая ссылка: 

Лазарев А.А., Werner F. A Graphical Approach for Solving NP-Hard Combinatorial Problems. Magdeburg: Otto-von-Guericke Universitaet, 2008. – 27 с.