|Select the desired Level or Schedule Type to find available classes for the course.|
|ENGN 2912P - Topics in Optimization|
This course will cover various topics in discrete and continuous optimization. Topics include graph algorithms, dynamic programming, linear programming, convex optimization and coarse-to-fine methods. Prerequisites: basic theory of algorithms (at the level of an undergraduate algorithms course) and linear algebra.
1.000 Credit hours
1.000 Lecture hours
Levels: Graduate, Undergraduate
Schedule Types: Primary Meeting
|Return to Previous||New Search|