COMP.6040 — Graduate

Id: 035779 Offering: 1 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

COMP.6040 — Online and Continuing Education

Id: 035779 Offering: 2 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

Students with a CSCE or UGRD career need permission to take Graduate Level Courses.

View Current Offerings