Syllabus with Lecture Notes

Date	Topic	Reading/Handouts
Session 1 13 January	Course Policies Review of Linear Programming The LP model and its assumptions	Mathematical Programming Examples handout
Session 2 15 January	Solvers Using CPLEX at SMU Introduction to AMPL	Getting Started with ILOG CPLEX handout AMPL Model and Data Files for the Diet Problem. NSC example in AMPL Homework 1
Session 3 20 January	Intro. to AMPL Continued	NSC example in AMPL
Session 4 22 January	Homework 1 due for on-campus students Introduction to Network Flows	Ahuja, Magnanti, and Orlin (AMO): Chapter 1 Glover, Klingman, and Phillips (GKP): Chatper 1
Session 5 27 January	MCNFP Formulation of NSC Problem Review of the MCNFP	AMPL Model for MCNFP TCC Solution
Session 6 29 January	Homework 1 due for on-campus students Personnel Scheduling with MCNFP Node Splitting Algorithm Design and Analysis	AMO: Pages 41 and 42 AMO: Chapters 2.3 and 3.1
Session 7 3 February	Algorithm Design and Analysis	AMO: Pages 41 and 42 AMO: Chapters 2.3 and 3.1
Session 8 5 February	Algorithm Design and Analysis Search Algorithms	AMO: Pages 41 and 42 AMO: Chapters 2.3 and 3.1 AMO: Chapter: 3.4
Session 9 10 February	Search Algorithms Revisited	AMO: Chapter 3.4
Session 10 12 February	Depth-First Search Algorithms for the Shortest Path Problem: Introduction	AMO Chapters: 3.4 AMO Chapters: 4.1, 4.2, 4.3, and 4.4 Midterm 1 available to on-campus students
Session 11 17 February	The Reaching Algorithm Dijkstra's Algorithm	AMO Chapters: 4.5
Session 12 19 February	Dijkstra's Algorithm Midterm 1 available to distance students
	The Bellman-Ford Algorithm	AMO: Chapter 5.4 PPT
Session 13 24 February	Midterm 1 due for on-campus students
	The Floyd-Warshall Algorithm	AMO: Chapter 5 PPT Example 1
	MCNFP and Negative Cycles	Example
	Overview of Shortest Path Algorithms
Session 14 26 February	Sets in AMPL
	Algorithms in AMPL	AMPL code
	Application: The Oracle of Kevin Bacon
Session 15 2 March	Midterm 1 due for distance students
	Shortest Path Applications: Dynamic Programming
	The 0-1 Knapsack Problem	Pages 100 - 102
	Equipment Replacement	www.utdallas.edu/~scniu/OPRE-6201
	Cramming for Finals
	The Maximum Flow Problem	AMO: Chapter 6.1, 6.2, 6.3, and 6.4
	Flows and Cuts	PPT
Session 16 4 March	Scheduling: A Graph Coloring Application	Special Session with CSE 7350
Session 17 16 March	The Max-Flow Min-Cut Theorem	Handout
	The Augmenting Path Algorithm	PPT
	Baseball Elimination	AMO: Section 8.1 PPT
Session 18 18 March	The Ford-Fulkerson Algorithm Drawbacks to Ford-Fulkerson	AMO: Section 6.5
	Flows on Cycles
	Max Flow with Non-Zero Lower Bounds
Session 19 23 March	Max-Flow Min-Cut Applications Vertex Connectivity All-Pairs Minimum Cut Scheduling on Parallel Machines and Distributed Computing
Session 20 25 March	Midterm 2 available to on-campus students
	Open-Pit Mining	AMPL data file
	Matchings, Coverings, and Independent Sets	AMO: Chapter 12
Session 21 30 March	Matchings, Coverings, and Independent Sets
Session 22 1 April	Midterm 2 available to distance students
	Minimum Chain Covering Problem
LP Review	LP in Two Dimensions LP in Standard Form Basic Solutions Preview of the Simplex Method	GKP: Appendix A AMO: Appendix C
Session 23 6 April	Midterm 2 due for on-campus students
	Simplex Method Example The Ratio Test Cramer's Rule
Session 24 8 April	Introduction to the Network Simplex algorithm	AMO: Chapter 11.
	Spanning Trees and Basic Feasible Solutions Node Potentials, and Reduced Arc Costs	AMO: Chapter 11
13 April	Midterm 2 due for distance students
Session 25 13 April	Generalized Network Flows	AMO: Chapter 15 GKP: Chapter 5 AMPL model, data, and output
	Warehouse Location Problem and Solution	GKP: Chapter 6
	LP-Based Branch-and-Bound
Session 26 15 April	Multicommodity Flows Examples	AMO: Chapter 17 AMPL model and data files for examples 1 and 2 output
	Optimal Trees	AMO: Chapter 13 AMPL model file for MST. AMPL script file to generate random MST problem instances. AMPL implementation of Kruskal's algorithm.
Session 27 20 April	Guest Lecturer: Giray Birkan
Session 28 22 April	Graph Coloring Assignment	IP formulation and heuristic implementations in AMPL sample problem instances
27 April		Final Exam available for on-campus students
4 May		Final Exam available for distance students
14 May	Final Exam due for distance students