Featured Image
Why is it important?
The paper describes a general modification of dynamic programming algorithms, called graphical algorithm. It reduces the number of states to be considered and typically leads to a reduction of the running time and sometimes also of the complexity compared with the standard dynamic programming algorithm.
Read the Original
This page is a summary of: A graphical realization of the dynamic programming method for solving <mml:math altimg="si18.gif" display="inline" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3...., Computers & Mathematics with Applications, August 2009, Elsevier,
DOI: 10.1016/j.camwa.2009.06.008.
You can read the full text:
Contributors
The following have contributed to this page
