Approximation and complexity in numerical optimization

by Panos M. Pardalos

There has been much recent progress in approximation algorithms for nonconvex continuous and discrete problems, from both a theoretical and a practical perspective. In discrete (or combinatorial) o…