Dynamic Programming and Associated Topics
General and special techniques of dynamic programming developed by means of examples. Shortest-path algorithms. Deterministic equipment replacement models. Resource allocation problem. Traveling-salesman problem. Knapsack problem. Analysis of inventory systems. General stochastic formulations. Markovian decision processes. Students are strongly encouraged to have knowledge of mathematical optimization (e.g.,COMP SCI/I SY E/MATH/STAT 525,I SY E 623,COMP SCI/I SY E/MATH/STAT 726), knowledge of analysis (e.g.,MATH/STAT 431or521) and programming ability (e.g.,COMP SCI 200or 301)
Summary
Recent recorded grades — Fall 2023: 3.89 GPA, 89.5% A/AB (n=19 letter grades); Fall 2024: 3.95 GPA, 100.0% A/AB (n=22 letter grades); Fall 2025: 3.87 GPA, 93.3% A/AB (n=15 letter grades).
Grade history
↗letter grades
All recorded terms · compare terms & instructors
Not enough comparable courses for Spring 2027 in UW–Madison.