Search
Now showing items 1-3 of 3
A branch‐and‐cut approach for the least cost influence problem on social networks
(Wiley, 2020-07)
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 ...
Least-cost influence maximization on social networks
(Informs, 2020-03)
Viral-marketing strategies are of significant interest in the online economy. Roughly, in these problems, one seeks to identify which individuals to strategically target in a social network so that a given proportion of ...
Fair-fixture: minimizing carry-over effects in football leagues
(American Institute of Mathematical Sciences, 2019-10)
We study a sports scheduling problem with the objective of minimizing carry-over effects in round robin tournaments. In the first part, focusing on tournaments that allow minimum number of breaks (at most one) for each ...
Share this page