In this thesis a bundle pricing problem with single-minded customers will be analyzed. After a literature review on algorithmic pricing we will move on to a deep analysis of bundle pricing problems, the different types analyzed so far in the literature and we will try to propose some taxonomies to classify them. Then we will focus on a specific single-minded bundle pricing problem, proposing two different algorithms to solve it: the first will be an algorithm that uses the python-MIP solver and which has proven to be more efficient for smaller instances, while the second is a more efficient heuristic algorithm for larger instances.