Spring 2024 - MATH 448 D400

Network Flows (3)

Class Number: 3797

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 8 – Apr 12, 2024: Mon, 2:30–4:20 p.m.
    Surrey

    Jan 8 – Apr 12, 2024: Wed, 2:30–3:20 p.m.
    Surrey

  • Exam Times + Location:

    Apr 19, 2024
    Fri, 8:30–11:30 a.m.
    Surrey

  • Prerequisites:

    MATH 308 with a minimum grade of C-. Recommended: MATH 345.

Description

CALENDAR DESCRIPTION:

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.

COURSE DETAILS:

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.

Grading

  • Assignments/Quizzes (4 @ 10% each) 40%
  • Midterm Test 20%
  • Final Examination 40%

NOTES:

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.

Materials

RECOMMENDED READING:

Network Flows: Theory, Algorithms and Applications
1st Edition
RK Ahuja, TL Magnanti, JB Orlin
Pearson

ISBN: 978013617590

REQUIRED READING NOTES:

Your personalized Course Material list, including digital and physical textbooks, are available through the SFU Bookstore website by simply entering your Computing ID at: shop.sfu.ca/course-materials/my-personalized-course-materials.

Registrar Notes:

ACADEMIC INTEGRITY: YOUR WORK, YOUR SUCCESS

SFU’s Academic Integrity website 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