Transportation Logistics

Course Syllabus
August – December 2024
Timings: Tue and Thu 11:30 AM – 1:00 PM
Location: CiSTUP Classroom

This page contains lecture slides and assignments for ‘CE 205A Transportation Logistics’.

Lectures

  1. Introduction

  2. Linear Programming Review - Part I

  3. Linear Programming Review - Part II

  4. Integer Programming

  5. Branch and Bound

  6. Traveling Salesman Problem

  7. Vehicle Routing Problem

  8. Matching and Location Problems

  9. Complexity Theory

  10. Valid Inequalities

  11. Polyhedral Theory

  12. Cutting Plane Algorithms

  13. Branch and Cut

  14. Cuts for TSPs - Part I

  15. Cuts for TSPs - Part II

  16. Bounds and Heuristics for TSPs

  17. Column Generation

  18. Branch and Price for VRPs

  19. Collaborative Logistics

  20. Vehicle Scheduling PRoblem

  21. Facility Location

  22. Neighborhood Search

  23. Inventory Control

Resources

GitHub Classroom

https://classroom.github.com/videos

CPLEX

https://www-eio.upc.es/lceio/manuals/cplex-11/html/usrcplex/

NetworkX

https://networkx.org/