This course will be an introduction to combinatorial optimization and geometry, with a strong emphasis on polyhedral combinatorics. The topics include Polyhedral basics, Linear programming and duality, modelling, Integrality of polyhedra, and their connection with graph theory. Prerequisites: Math 309, or permission of instructor. Some familiarity with what a proof is and how to produce one will be helpful, but students need not have taken Math 310.
Course Attributes: FA NSMAR NSMAS NSM
Section 01Topics in Algebra, Combinatorial Optimization
INSTRUCTOR: Escobar VegaView Course Listing