Welcome to the course website of CE 510/610 Transportation Network Analysis for the Spring 2017 quarter

- Name of the Instructor: Avinash Unnikrishnan
- Contact Information: uavinash@pdx.edu see Homepage for more information
- Class Time: Tuesday and Thursday, 12:00 to 1:50
- Location: Engineering Building 315
- Office: 301D Engineering Building
- Phone & Voicemail: 503-725-2872
- Office Hours: 1:00 PM - 3:00 PM and anytime by appointment
- Mailbox Location: CEE Office, Engineering Building Room 200
- Reference Textbook:
- Yosef Sheffi. Equilibrium Analysis with Mathematical Programming Methods. Prentice Hall, NJ, 1985. Available at here
- Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin. Network Flows: Theory, Algorithms, and Applications. Pearson,1 edition, 1993.

- Syllabus: Click Here

- Introduction: Lecture Notes
- Introduction to Python: Link
- Minimum Spanning Tree: Lecture Notes Handout

- Shortest Path: Lecture Notes Handout
- Data Structures and Network Representation: Lecture Notes Handout
- Shortest Path: Lecture Notes Handout
- Search Algorithms, Maximum Flow Problem: Lecture Notes Handout
- Minimum Cost Flow Problem: Lecture Notes Handout
- Unconstrained Optimization: Lecture Notes Handout
- Unconstrained Optimization: Lecture Notes Handout
- Constrained Optimization: Lecture Notes Handout
- Algorithms for Constrained Optimization: Lecture Notes Handout

These are some additional readings for students who do not have a background in optimization.I have not had time to proof-read and improve the writing. So please excuse the editorial mistakes.