Course Syllabus August – December 2022 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’.
Introduction
Linear Programming Review - Part I
Linear Programming Review - Part II
Integer Programming
Branch and Bound
Traveling Salesman Problem
Vehicle Routing Problem
Location, Assignment, and Network Design
Complexity Theory
Valid Inequalities
Polyhedral Theory
Cutting Plane Algorithms
Branch and Cut
Lower Bounds for TSPs
Cuts for TSPs - Part I
Cuts for TSPs - Part II
Heuristics for TSPs
Column Generation
Resource Constrained Shortest Paths
Branch and Price for VRPs
Heuristics for VRPs
https://classroom.github.com/videos
https://www-eio.upc.es/lceio/manuals/cplex-11/html/usrcplex/
https://networkx.org/