Abstract: Competitive opinion maximization (COM) aims to determine some individuals (i.e., seed nodes) from social networks, propagating the desired opinions toward a target entity to their neighbors ...

Abstract: The Branch-and-Bound(B&B) algorithm is an effective method for solving the Mixed Integer Linear Programming (MILP) problem. Its performance significantly impacts the overall performance of ...