Kavli Affiliate: Yi Zhou | First 5 Authors: Yimin Hao, Yimin Hao, , , | Summary: The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimization problem. The majority of existing approaches to solving the SKP are […]
Continue.. Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint