of University Southern California Department of Industrial and Systems Engineering Course Syllabus ISE 532: Network Flows Spring 2006
Meeting Time and Location: Meeting Hour: Thursday 6:30 9: 10 pm Classroom: OHE 100B Instruction Staff: Instructor Name: Dr. Xu Yang Phone Number: 949-230-4902 Email Address: [e-mail] Office Hours: 6:00 6:30 pm and 9:10 9:30 pm Thursday Course Text Book: Ahuja, Ravendra A., Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice-Hall: New Jersey, 1993. Prerequisites: ISE 330, Introduction to Operations Research 1, or ISE 536, Linear Programming and Extensions, or Department approval. Course Objectives: Network models have been used to represent a broad variety of real systems, including manufacturing, transportation, utilities, and project activities. The purpose of this course is to instill in the students an understanding of the concepts and theory of graphs and networks, an ability to use networks to model real systems, and a proficiency in using the range of available algorithms to solve network problems. Due to instructors background, some transportation network applications will also discussed. Course Outline and Schedule: See list and table. Course Assignment: See table. Grading: Activity Class participation Assignments/ Projects Mid-term examination Final examination Total Grade Percentage 10 50 20 20 100
ISE 532: Network Flows Tentative Course Outline: 1. Introduction to Graphs and Networks. (1 Lecture: 01/12/2006) a. Examples of network flows b. Examples of graph problems c. LP review and complexity 2. Distance Networks (3 Lectures: 01/19/2006 02/02/2006) a. Introduction b. Single-pair shortest algorithms c. All-pairs shortest path algorithms e. Computational analysis of Algorithms d. Optimality conditions f. Kth shortest paths g. Time-dependent case 3. Flow Networks (2 Lectures: 02/09/2006 02/16/2006) a. Maximum flow algorithms: Basics b. Maximum flow algorithms: Advanced c. Multi-terminal maximum flow d. Multi-terminal maximum capacity flow 4. Minimum Cost Flow (2 Lectures: 02/23/2006 03/02/2006) a. Cycle canceling algorithm b. Successive shortest path algorithm c. Out algorithm of-kilter d. Applications 5. Graph Problems (1 Lecture: 03/23/2006) a. Matching and assignment problems b. Minimum spanning trees 6. Multicommodity Flows (1 Lecture: 03/30/2006) a. Formulation b. Lagrangian relaxation 7. Transportation Planning Applications (2 Lectures: 04/06/2006 04/13/2006) a. Assignment formulation b. The user equilibrium (UE) assignment c. The system Optimal (SO) assignment 8. Routing Problems (1 Lecture: 04/20/2006) a. Arc routing problems b. Vertex routing problems 9. Review or Final Exam (1 Lecture: 04/27/2006) No. of Lectures: 14 Midterm Test: 1 Final Exam: 1 Total: 16
Academic integrity: The Department of Industrial and Systems Engineering adheres to the Universitys policies and procedures governing academic integrity as described in Campus. Students are expected to be aware of and to observe the academic integrity standards described in campus, and to expect those standards to be enforced in this course. Any Student requesting academic accommodations based on a disability is required to register with Disability Services and Programs (DSP) each semester. A letter of verification for approved accommodations can be obtained from DSP. Please be sure the letter is delivered to me (or to TA) as early in the semester as possible. DSP is located in STU 301 and is open 8:30 am 5:00 pm, Monday through Friday. The phone number for DSP is [phone].
Course Schedule: Spring 2006 Week 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 Date 1/12/2006 1/19/2006 1/26/2006 2/2/2006 2/9/2006 2/16/2006 2/23/2006 3/2/2006 3/9/2006 3/16/2006 3/23/2006 3/30/2006 4/6/2006 4/13/2006 4/20/2006 4/27/2006 Topic Introduction to Graphic and Net Shortest Path Problem Shortest Path Problem Shortest Path Problem Max Flow Problem Max Flow Problem Min Cost Problem Min Cost Problem Mid-term exam Spring Recess Graph Problems Multicommodity Flows Transportation Application Transportation Application Routing Problem Review or Final Exam Reading 1,2,3 4 5 Notes 6 7 9 10, 11 12, 13 16, 17 Notes Notes Notes Assignment PS1 PS2 PS3 PS4 PS5 PS6 PS7 PS8 PS9 PS10 PS11 PS12 Due 1/26/2006 2/16/2006 2/2/2006 2/9/2006 2/16/2006 2/23/2006 3/2/2006 3/9/2006 3/30/2006 4/6/2006 4/20/2006 4/27/2006