Math 443/543

Slides and handouts

· Introduction to Discrete Optimization

· Introduction to Integer Programming

· IP modeling techniques I

· IP modeling techniques II

· IP modeling techniques III

· IP applications handout

· Modeling process

· Solution Methods for Discrete Optimization Problems

· Solution Methods for NP-hard Discrete Optimization Problems

· Solving Integer Programs

· Branch-and-Bound I

· Branch-and-Bound II

· Cutting Planes I

· Cutting Planes II

· Network Models: Minimum Spanning Tree

· Approximation Algorithms

· Maximum Flow Problem

· Minimum Cut Problem

· Applications of Maximum Flow Problem

· Baseball Elimination Problem

· Summary of “Big Ideas”