CIEG 647 - Network Optimization

Credit(s): 3

NETWORK OPTIMIZATION
Component: Lecture
Theory practice of network flows/extensions: graph search algorithms, community structure detection, shortest path, flow decomposition, multi-commodity flow, computational complexity of network problems, Lagrangian relaxation method, with applications to transport, computer science, disaster and project management.
Repeatable for Credit: N Allowed Units: 3 Multiple Term Enrollment: N Grading Basis: Student Option
PREREQ: CIEG 646. RESTRICTIONS: Graduate students in Civil and Environmental Engineering, and Engineering and Public Policy.

Course Typically Offered: Spring