1.204 | Spring 2010 | Graduate
Computer Algorithms in Systems Engineering
Course Description
This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph …
This course covers concepts of computation used in analysis of engineering systems. It includes the following topics: data structures, relational database representations of engineering data, algorithms for the solution and optimization of engineering system designs (greedy, dynamic programming, branch and bound, graph algorithms, nonlinear optimization), and introduction to complexity analysis. Object-oriented, efficient implementations of algorithms are emphasized.
Learning Resource Types
notes Lecture Notes
grading Exams
assignment Programming Assignments
Diagram of a network with five nodes and ten paths.
Network equilibrium can be applied to transportation. See Lecture 18 for more information. (Figure by MIT OpenCourseWare.)