Overview
\[\,\]
The length of time that we recommend members of each team spend on this topic are as follows:
\[\,\]
Alpha – 12 days
Bravo – 9 days
Charlie – 7 days
Delta – 6 days
Echo – 4 days
\[\,\]
Happy learning!
\[\,\]
Learning Objectives
Use Dijkstra’s Algorithm to find the shortest path(s) between two nodes
Apply Bellman’s Principle of Optimality to find the shortest path(s) between two nodes
State what is meant by a greedy algorithm
Explain why Dijkstra’s Algorithm is considered greedy
State what is meant by dynamic programming
State what is meant by a multi-stage network
Use Bellman’s Algorithm to find the shortest path(s) between two nodes of a multi-stage network
Explain why Bellman’s Algorithm is not considered greedy
Apply Bellman’s Algorithm using a table
Apply dynamic programming to routing problems
Apply dynamic programming to the allocation of resources
Apply dynamic programming to equipment replacement and maintenance
Apply dynamic programming to stock control
\[\,\]
Keywords
Dijkstra’s Algorithm
Bellman’s Principle of Optimality
Dijkstra Key
greedy
Bellman’s Algorithm
dynamic programming
multi-stage network
stage
state
action
source
sink
forward recursion
backward recursion
optimal
destination
\[\,\]
