IE 511
Spring 2005 All Classes
All Classes
Credit: 4 hours.
(I E 403) 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 updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
34285
|
Lecture-Discussion
|
L
|
10:00AM
-11:50AM
|
TR
|
243 Mechanical Engineering Bldg
|
Klabjan, D
|
|