This paper is a study of several problems of best approximation to a given function in a normed linear space from a convex subset of a finite-dimensional subspace. Specific problems treated are ...

Carlos F. Daganzo, Karen R. Smilowitz, Bounds and Approximations for the Transportation Problem of Linear Programming and Other Scalable Network Problems, Transportation Science, Vol. 38, No. 3 ...

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

The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route ...