Courses
ACM726 Integer Programming
[3–0, 3 cr.]
Topics covered are: Polyhedral theory, valid inequalities, branch-and-bound algorithm and its variants, Integral polyhedral, IP duality. Prerequisite: ACM724 Linear Programming.
Topics covered are: Polyhedral theory, valid inequalities, branch-and-bound algorithm and its variants, Integral polyhedral, IP duality. Prerequisite: ACM724 Linear Programming.