Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint

TL;DR

This paper introduces an exact branch-and-bound algorithm for the submodular knapsack problem, providing optimal solutions with improved efficiency over existing approximation methods, crucial for applications requiring precision.

Contribution

The paper presents a novel branch-and-bound approach with a tight upper bound and dual branching, enabling efficient exact solutions to the submodular knapsack problem.

Findings

Outperforms conventional methods in efficiency

Provides optimal solutions in various applications

Demonstrates effectiveness in real-world scenarios

Abstract

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 approximation algorithms. However, in domains such as health-care facility location and risk management, the need for optimal solutions is still critical, necessitating the use of exact algorithms over approximation methods. In this paper, we present an optimal branch-and-bound approach, featuring a novel upper bound with a worst-case tightness guarantee and an efficient dual branching method to minimize repeat computations. Experiments in applications such as facility location, weighted coverage, influence maximization, and so on show that the algorithms that implement the new ideas are far more efficient than conventional methods.