2024 Fall
INDENG 266 101 - DIS 101
Network Flows and Graphs
Dorit S Hochbaum
Class #:34181
Units: 3
Instruction Mode:
In-Person Instruction
Offered through
Industrial Engineering and Operations Research
Current Enrollment
Total Open Seats:
31
Enrolled: 4
Waitlisted: 0
Capacity: 35
Waitlist Max: 10
No Reserved Seats
Hours & Workload
1 hours of the exchange of opinions or questions on course material per week, 3 hours of instructor presentation of course materials per week, and 6 hours of outside work hours per week.
Other classes by Dorit S Hochbaum
Course Catalog Description
Survey of solution techniques and problems that have formulations in terms of flows in networks. Max-flow min-cut theorem. Minimum cost flows. Multiterminal and multicommodity flows. Relationship with linear programming, transportation problems, electrical networks and critical path scheduling.
Rules & Requirements
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials