EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

A Pedagogical Note on the Design of Dynamic Programming Algorithms

Bertrand M. T. Lin

Mathematics · 09.11.2026 · 14 (21) · 4117

DOI: 10.3390/math14214117 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Mathematics, online erschienen am 09.11.2026. Verfasst von Bertrand M. T. Lin. Die Arbeit nennt 29 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: National Science and Technology Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Dynamic programming is extensively used to formulate and solve a wide range of optimization problems, especially those involving sequential decisions. When designing dynamic programming algorithms, either a backward or forward approach can be employed. Previous studies have not explicitly addressed the choices between the two approaches that may lead to different time complexities. This note highlights this question by examining four distinct optimization problems, demonstrating how adopting different design approaches impacts the efficiency and complexity of the developed algorithms. Comparative analysis of the examples suggests the option of selecting an effective strategy for developing efficient dynamic programming algorithms.

Förderung

  • National Science and Technology Council

Zitieren

APA

Lin, B. M. T. (2026). A Pedagogical Note on the Design of Dynamic Programming Algorithms. Mathematics, 14(21), 4117. https://doi.org/10.3390/math14214117

Vancouver

Lin BMT. A Pedagogical Note on the Design of Dynamic Programming Algorithms. Mathematics. 2026;14(21):4117. doi:10.3390/math14214117

BibTeX
@article{Lin2026,
  author = {Lin, Bertrand M. T.},
  title = {A Pedagogical Note on the Design of Dynamic Programming Algorithms},
  journal = {Mathematics},
  year = {2026},
  volume = {14},
  number = {21},
  pages = {4117},
  doi = {10.3390/math14214117}
}
Kostenlos starten →