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

In this paper we develop a discretized version of the dynamic programming algorithm and study its convergence and stability properties. We show that the computed value function converges quadratically ...

Jonathan Eckstein, Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming, Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 202-226 ...

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

GCSE Computer Science Computational thinking, algorithms and programming learning resources for adults, children, parents and teachers.

1 Describe key models of computation and associated programming language paradigms based on them. 2 Evaluate the advantages and disadvantages of various programming languages for different ...