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

A timetabling problem is formulated as a large integer linear programming problem in 0-1 variables. A solution method based on Lagrangean relaxation coupled with subgradient optimization is presented.

This article is concerned with the computational aspect of l₁ regularization problems with a certain class of piecewise linear loss functions. The problem of computing the l₁ regularization path for a ...

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

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