Kátai, Zoltán (2008) Dynamic programming as optimal path problem in weighted digraphs. ACTA MATHEMATICA ACADEMIAE PAEDAGOGICAE NYÍREGYHÁZIENSIS, 1 (2). pp. 201-208. ISSN 0866-0174
|
Text
amapn24_18.pdf Download (178kB) | Preview |
Official URL: http://www.emis.de/journals/AMAPN/index.html
Abstract
In this paper we are going to present a method that can help us to deal with several dynamic programming problems as optimal path problems in weighted digraphs, even problems which apparently don't have anything in common with graph theory. Furthermore, this approach makes possible such a classification of the dynamic programming strategies which can help in the comprehension of the essence of this programming technique.
| Item Type: | Article |
|---|---|
| Subjects: | Q Science / természettudomány > QA Mathematics / matematika |
| SWORD Depositor: | MTMT SWORD |
| Depositing User: | MTMT SWORD |
| Date Deposited: | 01 Feb 2024 10:07 |
| Last Modified: | 01 Feb 2024 10:07 |
| URI: | http://real.mtak.hu/id/eprint/186960 |
Actions (login required)
 |
Edit Item |
