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

Another strand of research has revisited the max-vertex-cover problem, leveraging linear programming and greedy algorithms to refine performance guarantees.

Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear Programming: regression, classification and other engineering applications. Integer Linear Programming: Basics, ...

The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut from given stock lengths of given cost. When expressed as an integer ...

Niv Buchbinder, Kamal Jain, Mohit Singh, Secretary Problems via Linear Programming, Mathematics of Operations Research, Vol. 39, No. 1 (February 2014), pp. 190-206 ...

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975 ...