Advanced Integer Programming 097334

This course follows my new research book (details and links below) which develops a new algorithmic theory of (nonlinear) discrete optimization that enables polynomial time solution of broad fundamental classes of nonlinear combinatorial optimization and integer programming problems in variable dimension. An important part of this theory is enhanced by recent developments in the algebra of Graver bases. The power of the theory is demonstrated by deriving polynomial time algorithms in a variety of application areas including vector partitioning, matroid optimization, experimental design, multi-index transportation and flow, and privacy in databases. The course is for grads and advanced undergrads. The main prerequisite is mathematical maturity.

New Book: Nonlinear Discrete Optimization Zurich Lectures in Advanced Mathematics European Mathematical Society, 2010, 147 pages

More Information