Now showing items 1-1 of 1
A branch‐and‐cut approach for the least cost influence problem on social networks
This paper studies a problem in the online targeted marketing setting called the least cost influence problem (LCIP) that is known to be NP-hard. The goal is to find the minimum total amount of inducements (individuals to ...
Share this page