convex programming and KKT conditions, algorithms for linear and convex optimisation problems, theory of good formulations for integer linear programming models, integer linear programming methods ...

See How It Works for details. This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving algorithmic ...

Algorithm Design Approaches: Divide and Conquer including analysis using recurrences Greedy Algorithms Dynamic Programming Algorithms Algorithms for the following primitives: Sorting: bubblesort, ...