COMP.6040 Network Optimization (Formerly 91.604)
Id: 035779
Credits: 3-3
Description
This course covers advanced topics in network optimization on continuous and discrete models, including the max-flow problem, the min-cost flow problem, simplex methods for min-cost flow, dual ascent methods for min-cost flow, auction algorithms for min-cost flow, nonlinear network optimization, convex separable network problems, and network problems with integer constraints.
Prerequisites
Pre-Req: 91.503 Algorithms.
View Current Offerings
Course prerequisites/corequisites are determined by the faculty and approved by the curriculum committees. Students are required to fulfill these requirements prior to enrollment. For courses offered through online or GPS delivery, students are responsible for confirming with the instructor or department that all enrollment requirements have been satisfied before registering.