Submodular maximization is a significant area of interest in combinatorial optimization, with numerous real-world applications.

Combinatorial optimisation problems arise in many fields, from logistics and network design to machine learning and bioinformatics.

The unbounded knapsack problem: given a knapsack of some capacity and a set of items that have a weight and a value, determine ...