IE 511
spring 2006
All Classes
Integer Programming
Credit: 4 hours.
Optimization of linear systems involving integer variables and discrete alternatives. Covers: modeling; computational complexity; matroids; branch and bound methods; Langrangian and surrograte duality; cutting plane methods and polyhedral theory; and special structured problems such as knapsack, set packing and covering, traveling salesman, etc. Prerequisite: IE 411 or MATH 482 or equivalent; or consent of instructor.
- Section Status Closed
- Section Status Open
- Section Status Pending
- Section Status Open (Restricted)
- Section Status Unknown
Section Status updates every 10 minutes.
| Detail | Status | CRN | Type | Section | Time | Day | Location | Instructor |
|---|