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

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

Robert E. Jensen, A Dynamic Programming Algorithm for Cluster Analysis, Operations Research, Vol. 17, No. 6 (Nov. - Dec., 1969), pp. 1034-1057 Free online reading for over 10 million articles Save and ...

K. Deb, Nonlinear Goal Programming Using Multi-Objective Genetic Algorithms, The Journal of the Operational Research Society, Vol. 52, No. 3 (Mar., 2001), pp. 291-302 ...