I SY E 720: Integer Programming
- Catalog Description:
Formulation of integer programming problems and the characterization of optimization problems representable as integer and mixed-integer programs. The degree of difficulty of classes of integer programs and its relation to the structure of their feasible sets. Optimality conditions. Branch-and-bound, cutting plane, and decomposition methods for obtaining solutions or approximating solutions.
- Credits: 3
- Prerequisites: Comp Sci 525 or cons inst
- Official Course Description (pdf)
Moodle and D2L are being retired. Already, many Engineering courses are in Canvas rather than Moodle. Rather than using the Moodle links below, it is recommended that you use the Learn@UW site (learnuw.wisc.edu) to gain access to all of the LSM choices available to campus.
- Engineering Moodle Courses on the Web
- Create an Engineering Moodle Course Homepage (formerly eCOW2)