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

Andris A. Zoltners, Prabhakant Sinha, Integer Programming Models for Sales Resource Allocation, Management Science, Vol. 26, No. 3 (Mar., 1980), pp. 242-260 ...