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) .

Basic Concepts in Algorithms focuses on paradigms and methods combining basic programming constructs as building blocks and shows their usefulness in the derivation of algorithms.

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 ...