— Discrete & Mixed-Integer Optimization

Prerequisites & course information

This version has ended; see updated course, below. Course Description: Combinatorial, integer, and mixed-integer linear optimization problems. Ideal and strong formulations, cutting planes, branch and cut, decomposition methods. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Grade Mode: Letter. MAT 258B — Discrete & Mixed-Integer Optimization (4 units) Course Description: Combinatorial, integer, and mixed-integer linear optimization problems. Ideal and strong formulations, cutting planes, branch and cut, decomposition methods. Prerequisite(s): MAT 025; MAT 167 ; or consent of instructor. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Enrollment Restriction(s): Open to graduate students; open to undergraduate students with consent of instructor. Grade Mode: Letter. This course version is effective from, and including: Winter Quarter 2027. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Grade Mode: Letter. MAT 258B — Discrete & Mixed-Integer Optimization (4 units) Course Description: Combinatorial, integer, and mixed-integer linear optimization problems. Ideal and strong formulations, cutting planes, branch and cut, decomposition methods. Prerequisite(s): MAT 025; MAT 167 ; or consent of instructor. Learning Activities: Lecture 3 hour(s), Term Paper/Discussion 1 hour(s). Enrollment Restriction(s): Open to graduate students; open to undergraduate students with consent of instructor. Grade Mode: Letter. This course version is effective from, and including: Winter Quarter 2027.