Dynamic programming as optimal path problem in weighted digraphs

MaRDI QIDQ3615326zbMATH OpenFDO

Authors Zoltán Kátai

Publication date 19 March 2009

Full work available at URL https://eudml.org/doc/55747

zbMATH Keywords

dynamic programminggraph theoryoptimal path algorithms

Mathematics Subject Classification ID

Distance in graphs (05C12) Paths and cycles (05C38) Dynamic programming in optimal control and differential games (49L20) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• Modelling dynamic programming problems by generalized d-graphs
• scientific article; zbMATH DE number 5520408
• scientific article; zbMATH DE number 5199104
• Dynamic programming and d-graphs
• scientific article; zbMATH DE number 1215002

Cited in

(5)

• Dynamic programming on a directed graph
• Modelling dynamic programming problems by generalized d-graphs
• Speeding up Dynamic Programming Algorithms for Finding Optimal Lattice Paths
• Dynamic programming and d-graphs
• DP-solver: automating dynamic programming

This page was built for publication: Dynamic programming as optimal path problem in weighted digraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3615326)