MATH 4623: Discrete And Combinatorial Optimization
OVERVIEW:
COURSE DESCRIPTION:
The course emphasizes practical algorithms in discrete optimization. It provides an introduction to polyhedral theory and complexity theory. Topics in general integer programming include facets and strong valid inequalities, Langrangean relaxation and duality, and analysis of general-purpose algorithms such as branch and bound and cutting plane algorithms.
PREREQUISITES:
Math 3603.