Topics include: Run time analysis, divide-and-conquer algorithms, dynamic programming algorithms, network flow algorithms, linear and integer programming, large-scale search algorithms and heuristics, ...

This scheduling problem is formulated as a combinatorial optimization model. As this model is proved to be NP-hard, we design a dynamic programming algorithm to solve it efficiently. In this algorithm ...

This project is a professional implementation of various data structures and algorithms in C++. Currently, the focus is on a graph data structure along with implementations of Depth-First Search (DFS) ...

Modeling language for Mathematical Optimization (linear, mixed-integer, conic, semidefinite, nonlinear) ...