Duration: 4 hours. This module will cover integer linear programming and its use in solving NP-hard (combinatorial optimization) problems. We will cover some examples of what integer linear ...

A project headed by the SEI’s Scott McMillan took a step in 2020 toward standardizing graph algorithm application development in C++.

Brief Description of Course Content. Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and ...