Have a personal or library account? Click to login
DP-solver: automating dynamic programming Cover
By: Zoltan Katai and  Attila Elekes  
Open Access
|Feb 2022

Abstract

Dynamic programming (DP) is a widely used optimization method with several applications in various fields of science. The DP problem solving process can be divided in two phases: mathematical part and programming part. There are a number of researchers for whom the mathematical part is available, but they are not familiar with computer programming. In this paper we present a software tool that automates the programming part of DP and allows users to solve problems based only on their mathematical approach. The application builds up the “d-graph model” of the problem to be solved and applies the “d-variant” of the corresponding single source shortest path algorithm. In addition, we report experimental results regarding the e ciency of the tool relative to the Matlab implementation.

Language: English
Page range: 361 - 372
Submitted on: Dec 10, 2021
|
Accepted on: Dec 26, 2021
|
Published on: Feb 2, 2022
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2022 Zoltan Katai, Attila Elekes, published by Sapientia Hungarian University of Transylvania
This work is licensed under the Creative Commons Attribution 4.0 License.