MATH 566 - Discrete Optimization
Instructor: Bernard Lidický
Office: 422 Carver Hall
email: lidicky -at- iastate.edu
Office hours: ??
Section: 2
Where: LAGOMAR 1520
When: Tue Thu 12:30 PM - 1:45 PM
Final exam: TBD
Syllabus
Homework
HW 1 - Feed ME (cheaply)
Lecture Log
Aug 21 Linear programming
Aug 23 Geometry and Linear programming Duality introduction
Aug 28 Duality Inteprertaion Separation Theorem
Aug 30 Farkas Lemma
Sep 4 Consequenced of Duality Simplex Method
Sep 6 Klee-Minty Cube and Ellipsoid Method
Sep 11 Interior Point Methods
Sep 13 Minium Spanning Tree
Sep 18 Shortest Path
Sep 20 l13 - Shortest Path and Linear Programming
Sep 25 l14 - Network Flows - First Intro
Sep 27 l15 - Network Flows - first algorithm
Oct 2 l16 - Network Flows - Faster Algorithm
Oct 4 l17 - Minimum Cuts in Unidrected Graphs
Oct 9 l18 - Gomory-Hu Trees
Oct 11 l19 - Minimum Cost Flow
Oct 16 l20 - Minimum Mean Cycle
Oct 18 l21 - Integer Programming - Unimodularity
Oct 23 l22 - Integer Programming - Branch and bound
Oct 25 l23 - Integer Programming - Cutting Planes
Oct 30 l24 - Matchings
Nov 1 l25 - Weighted Bipartite Matchings
Nov 6 l26 - Weighted Matching - Goemans-Williamson
Nov 8 l27 - Travelling Salesman Problem
Nov 13 l28 - Semidefinite Programming
Nov 15 l29 - Max-Cut
Nov 20 Thanksgiving
Nov 22 Thanksgiving
Nov 27 l30 - Matroids
Nov 29
Dec 4
Dec 6