Modelling dynamic programming problems by generalized d-graphs

MaRDI QIDQ3000077zbMATH OpenFDO

Authors Zoltán Kátai

Publication date 18 May 2011

Full work available at URL https://arxiv.org/abs/1012.0058

zbMATH Keywords

dynamic programminggraph theoryshortest path algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39)

Recommendations

• Dynamic programming and d-graphs
• Dynamic programming as optimal path problem in weighted digraphs
• scientific article; zbMATH DE number 5520408
• scientific article; zbMATH DE number 5199104
• A Comprehensive Model of Dynamic Programming

Cited in

(5)

• Dynamic programming as optimal path problem in weighted digraphs
• Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
• Dynamic programming and d-graphs
• DP-solver: automating dynamic programming
• A graphical realization of the dynamic programming method for solving NP-hard combinatorial problems

This page was built for publication: Modelling dynamic programming problems by generalized \(d\)-graphs

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