Generalization of the dynamic programming scheme
From MaRDI portal
Publication:1027697
DOI10.1134/S0005117909020076zbMATH Open1163.49029OpenAlexW1984329185MaRDI QIDQ1027697FDOQ1027697
Publication date: 30 June 2009
Published in: Automation and Remote Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0005117909020076
Cites Work
Cited In (10)
- Bicriterial servicing problems for stationary objects in a one-dimensional working zone of a processor
- A stronger model of dynamic programming algorithms
- Choice functions in multistage optimization
- A dynamic programming solution to a generalized LCS problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- General limit value in dynamic programming
- A combinatorial structure ensuring applicability of the dynamic programming method
- Search for \(C\)-optimal routes in graphs
Recommendations
- Theory and applications of generalized dynamic programming: An overview π π
- Title not available (Why is that?) π π
- Pansystems optimization, generalized principles of optimality, and fundamental equations of dynamic programming π π
- Title not available (Why is that?) π π
- A new look at Bellman's principle of optimality π π
This page was built for publication: Generalization of the dynamic programming scheme
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1027697)