DPGraphJ: A Java package for the implementation of dynamic programming algorithms

This paper introduces the DPGraphJ package, a collection of reusable Java functions to solve optimisation problems using a dynamic programming algorithm. The latter is based on a recursive schema that follows a top-down approach and uses the memoisation technique. This algorithm is a reusable softwa...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:SoftwareX Ročník 28; s. 101948
Hlavní autori: Borrego, Diana, Barba, Irene, Del Valle, Carmelo, Toro, Miguel
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.12.2024
Elsevier
Predmet:
AND/OR graphs
Computational thinking
Design & implementation
Dynamic programming
Software quality
Computational thinking
Dynamic programming
Design & implementation
AND/OR graphs
Software quality
ISSN:2352-7110, 2352-7110
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:This paper introduces the DPGraphJ package, a collection of reusable Java functions to solve optimisation problems using a dynamic programming algorithm. The latter is based on a recursive schema that follows a top-down approach and uses the memoisation technique. This algorithm is a reusable software component that is generic and efficient. Moreover, it has been developed by paying special attention to good practices in the design of software. For using DPGraphJ, the problem to be solved needs to be modelled as an AND/OR graph. In the DPGraphJ package, we provide 5 academic case studies with detailed comments. We strongly believe that our proposal can be helpful for several kinds of users, such as students, researchers, and practitioners.
ISSN:2352-7110
2352-7110
DOI:10.1016/j.softx.2024.101948