Dynamic Programming, Greedy Algorithms can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform.

This is an advanced undergraduate course on algorithms. This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for ...

Sequence alignment methods often use something called a 'dynamic programming' algorithm. What is dynamic programming and how does it work?

Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy ...

Tour of the most important data structures, fundamental algorithms, and algorithm design techniques: lists, stacks, queues, dynamic arrays, hash tables, priority queues, disjoint set unions, binary ...

View on Coursera Course Description This course continues our data structures and algorithms specialization by focussing on the use of linear and integer programming formulations for solving ...

Solution approaches developed to date have not been efficient enough to handle realistically sized problems. The main approaches have been general integer programming algorithms and the specialized ...

This paper presents a constraint logic programming model for the traveling salesman problem with time windows which yields an exact branch-and-bound optimization algorithm without any restrictive ...