Dynamic Programming: Models and Applications

317 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Dynamic Programming (2018, neutral): “A more comprehensive analysis of DP and other examples can be found, e.g., in [2,3].”
The dynamic transshipment problem (2001, background): “THEOREM 1 (see, e.g., Denardo [ 5 ]): Inanyminimumcostuncapacitatednetworkflowproblemwithconcavecoststhereexistsanoptimalflowwhichdoesnotcontainanyloop(anundirected cycle of arcs) with a positive flow on all arcs of the loop.”
Routing, flow, and capacity design in communication and computer networks (2004, background): “The literature on dynamic programming is rich; a brief summary can be found in [Den78]; the reader may consult books such as [Bel58], [BD62], and [Den82] for additional detail.”
Learning to predict by the methods of temporal differences (1988, methodology): “Similar methods have been used in Holland's (1986) bucket brigade, in the author's Adaptive Heuristic Critic (Sutton, 1984; Barto, Sutton & Anderson, 1983), and in learning systems studied by Witten (1977), Booker (1982), and Hampson (1983).”
Multi-objective topology optimization of multi-component continuum structures via a Kriging-interpolated level set approach (2014, background): “ii) If structure is disconnected, calculate a connectivity penalty function Pcon and set e X 1⁄4 0 iii) If structure is connected, form the matrix e X It should be noted that all the performed graph search tasks rely on the well-established one-to-all shortest path algorithms (Denardo 2003), and are”