A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems

Authors:
Alexander A. Lazarev;Frank Werner
Affiliations:
Institute of Control Sciences of the Russian Academy of Sciences, Profsoyuznaya street 65, 117997 Moscow, Russia;Fakultät für Mathematik, Otto-von-Guericke-Universität Magdeburg, PSF 4120, 39016 Magdeburg, Germany
Venue:
Computers & Mathematics with Applications
Year:
2009

Citing 3
Cited 2

Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Dynamic Programming

Dynamic Programming
Algorithms for special cases of the single machine total tardiness problem and an application to the even-odd partition problem

Mathematical and Computer Modelling: An International Journal

Algorithms for some maximization scheduling problems on a single machine

Automation and Remote Control
Graphical algorithm for the knapsack problems

PaCT'11 Proceedings of the 11th international conference on Parallel computing technologies

Quantified Score

Hi-index	0.09

Visualization

Abstract

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 algorithms for these problems on small-size instances of the partition problem with n@?10 numbers. For almost all instances, the new algorithm considers on average substantially less ''stages'' than the dynamic programming algorithm.