Dynamic programming and d-graphs
From MaRDI portal
Dynamic programming and \(d\)-graphs
Recommendations
Cited in
(9)- Dynamic programming on a directed graph
- Dynamic Programming for H-minor-free Graphs
- On the connections between PCTL and dynamic programming
- Modelling dynamic programming problems by generalized d-graphs
- Dynamic programming as optimal path problem in weighted digraphs
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base
- Dynamic programming with ordered structures: Theory, examples and applications
- 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: Dynamic programming and \(d\)-graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5309493)