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

Approximation algorithms for the TSP endeavour to provide efficient, near‐optimal solutions where exact methods prove computationally prohibitive.

The approximation theory developed in [11] is used to determine the piecewise polynomial approximability of solutions of elliptic problems on polygonal domains in R 2 and polyhedra in R 3. From these ...

We consider efficient construction of nonlinear solution paths for general l₁-regularization. Unlike the existing methods that incrementally build the solution path through a combination of local ...