NETWORK FLOWS

Section

Professor

Daniel Bienstock

Survey Results

9 of 16 students responded

Instructor: Organization and Preparation4.44
Instructor: Classroom Delivery4.22
Instructor: Approachability4.33
Instructor: Overall Quality4.33
Course: Amount Learned4
Course: Appropriateness of Workload4.11
Course: Fairness of Grading Process3.78
Course: Quality of Text4
Course: Overall Quality4.33

Course Information

Prerequisite: a working knowledge of programming. Corequisite: linear programming, or the instructor's permission. A computational approach to network algorithms. Data structures for networks, max. flow-min. cut theorem, algorithms and applications. Minimum cost circulation algorithms, and applications, including assignment, transportation, scheduling, inventory, and matching. Out-of-kilter algorithm, multi-commodity flow, and flow with multipliers.

Department: Industrial Engineering and Operations Research(IEOR)

Subject: Industrial Engineering and Operations Research(IEOR)

School: Fu Foundation School of Engineering and Applied Science

Division: School of Engineering and Applied Science: Graduate

Course ID: 6605