6.231 | Fall 2015 | Graduate

Dynamic Programming and Stochastic Control

6-231f15-th.jpg

Description:

Label correcting methods for shortest paths. See Lecture 4 for more information.

Alt text:
Diagram in which nodes can be inserted into or removed from a list of active nodes.
Caption:
Label correcting methods for shortest paths. See Lecture 3 for more information. (Figure by MIT OpenCourseWare, adapted from course notes by Prof. Dimitri Bertsekas.)
Credit:
Figure by MIT OpenCourseWare, adapted from course notes by Prof. Dimitri Bertsekas.
Diagram in which nodes can be inserted into or removed from a list of active nodes.

Course Info

As Taught In
Fall 2015
Level