Spring 2020 - MATH 448 D100
Network Flows (3)
Class Number: 3742
Delivery Method: In Person
Course Times + Location:
Mo 2:30 PM – 4:20 PM
SRYC 2990, Surrey
We 2:30 PM – 3:20 PM
SRYC 2990, Surrey
Exam Times + Location:
Apr 14, 2020
12:00 PM – 3:00 PM
SRYC 5320, Surrey
1 778 782-7611
Prerequisites:MATH 308. Recommended: MATH 345.
Applications of network flow models; flow decomposition; polynomial algorithms for shortest paths, maximum flows and minimum costs flows; convex cost flows; generalized flows, multi-commodity flows. Quantitative.
Shortest path algorithms: Optimality conditions and Ford-Fulkerson label correcting algorithms, special implementations, detection of negative cycles, all pair shortest paths, maximum capacity paths.
Maximum Flows: Review of augmenting path algorithms, labeling algorithm and maximum flow minimum cut theorem, capacity scaling, pre-flow push algorithms, flows in unit capacity networks.
Minimum cost flows: Optimality conditions and duality, cycle-canceling algorithm, capacity scaling algorithm.
Other topics: Convex cost flows, generalized network flow models, multicommodity network flow models.
As time permits: Network location models, network design models, Applications of Network flow models.
- Assignments/Quizzes (4 @ 10% each) 40%
- Midterm Test 20%
- Final Examination 40%
THE INSTRUCTOR RESERVES THE RIGHT TO CHANGE ANY OF THE ABOVE INFORMATION.
Students should be aware that they have certain rights to confidentiality concerning the return of course papers and the posting of marks.
Please pay careful attention to the options discussed in class at the beginning of the semester.
Network Flows: Theory, Algorithms and Applications
RK Ahuja, TL Magnanti, JB Orlin
Speak to the instructor prior to purchasing this text.
SFU’s Academic Integrity web site http://www.sfu.ca/students/academicintegrity.html is filled with information on what is meant by academic dishonesty, where you can find resources to help with your studies and the consequences of cheating. Check out the site for more information and videos that help explain the issues in plain English.
Each student is responsible for his or her conduct as it affects the University community. Academic dishonesty, in whatever form, is ultimately destructive of the values of the University. Furthermore, it is unfair and discouraging to the majority of students who pursue their studies honestly. Scholarly integrity is required of all members of the University. http://www.sfu.ca/policies/gazette/student/s10-01.html
ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS