Overview of algorithms for solving the problem of finding the sum of a subset of elements

This article provides an overview of algorithms for solving the problem of finding the sum of a subset of items. Algorithms with exponential complexity, approximation algorithms with polynomial running time are discussed. We order information about different approaches to the problem of finding the sum of elements of subsets. All algorithms have detailed descriptions and are illustrated by examples.