 | | | | |
Home»Graduate Education»Courses»Graduate Course Descriptions»CSE204A
| | | | | Graduate Course Descriptions
CSE204A - Combinatorial Optimization
(New Fall 2002)
Units: 4
Course Description:
Linear programming, simplex method, duality, and column generating technique. Integer programming introduced via the Knapsack problem. The periodic nature of all integer programs. Why the round-off technique cannot work in general. The solution of the Knapsack problem in polonominal time since nonbasic columns form a group.
Prerequisites:
CSE 202 or Linear Algebra or consent of instructor
| | | back to top ^ |
| |
