MATH 588

spring 2011
 
All Classes
Optimization in Networks

Credit: 4 hours.

Theory and methods for optimization over directed graphs; paths, cuts, flows, and potentials; matchings; PERT and CPM; max flow, min path, out-of-kilter, Hungarian, and other algorithms; nonlinear cost functionals; painting theory; and existence and duality. Prerequisite: MATH 241.

Closed
Section Status Closed
Open
Section Status Open
Pending
Section Status Pending
Open (Restricted)
Section Status Open (Restricted)
Unknown
Section Status Unknown
Section Status updates every 10 minutes.
Detail Status CRN Type Section Time Day Location Instructor