Simon Fraser University
Engaging the World

Course Outlines

Spring 2020 - MATH 748 G100

Network Flows (3)

Class Number: 3769

Delivery Method: In Person

Overview

  • Course Times + Location:

    Jan 6 – Apr 9, 2020: Mon, 2:30–4:20 p.m.
    Surrey

    Jan 6 – Apr 9, 2020: Wed, 2:30–3:20 p.m.
    Surrey

  • Exam Times + Location:

    Apr 14, 2020
    Tue, 12:00–3:00 p.m.
    Location: TBA

Description

CALENDAR DESCRIPTION:

Held jointly with MATH 448-3. See description for MATH 448-3. Students may not take a 700 division course if it is being offered in conjunction with a 400 division course which they have taken previously.

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:

MATH 748 is cross-listed with MATH 448. Students enrolled in the graduate section MATH 748 will have additional assignment questions, and may have different exam questions than those enrolled in MATH 448.


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

REQUIRED READING:

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

Speak to the instructor prior to purchasing this text.
ISBN: 9780136175490

Graduate Studies Notes:

Important dates and deadlines for graduate students are found here: http://www.sfu.ca/dean-gradstudies/current/important_dates/guidelines.html. The deadline to drop a course with a 100% refund is the end of week 2. The deadline to drop with no notation on your transcript is the end of week 3.

Registrar Notes:

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