IE 511
Spring 2016 All Classes
All Classes
Credit: 4 hours.
Optimization of linear systems involving integer variables and discrete alternatives. Modeling; computational complexity; matroids; branch and bound methods; Langrangian and surrograte duality; cutting plane methods and polyhedral theory; special structured problems such as knapsack, set packing and covering, and traveling salesman.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
34285
|
Lecture-Discussion
|
L
|
9:30AM
-10:50AM
|
TR
|
Education Building
|
Davis, J
|
|