It covers basic algorithm design techniques such as divide and conquer, dynamic programming, and greedy algorithms. It concludes with a brief introduction to intractability (NP-completeness) .

Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

Goal programming is a very powerful technique for solving multiple objective optimisation problems. It has been successfully applied to numerous diverse real life problems. In this paper a Taboo ...

For the first time, anyone with a web browser will soon be able to log in and run basic algorithms on a quantum chip hooked up to the internet.