Catalog Entries |
Date
Apr 20, 2024 |
|
 |
||
 | Select the Course Number to get further detail on the course. Select the desired Schedule Type to find available classes for the course. |
| ACM 726 - Integer Programming |
|
Topics covered are: Polyhedral theory, valid inequalities, branch-and-bound algorithm and its variants, Integral polyhedral, IP duality. Prerequisite: ACM724 Linear Programming.[3-0,3 Cr.]
3.000 Credit hours 3.000 Lecture hours Levels: Graduate Schedule Types: Lecture, Tutorial Computer Science & Mathematics Department |
|