|
|
Prerequisites: CSCI 106, MATH 303, 308. Offered approximately every 3 semesters.
Network flows, minimal-cost network flows, maximal-flow problems. Critical-path methods and PERT. Transportation and assignment problems. Deterministic inventory theory. Deterministic dynamic programming and integer programming. |
|