1 citations · 1 across the 2 of their papers we have counts for
2 papers
math.OC2022★ 1 cited
A Polyhedral Approach to Least Cost Influence Maximization in Social Networks
Cheng-Lung Chen, Eduardo Pasiliao, Vladimir Boginski
The least cost influence maximization problem aims to determine minimum cost of partial (e.g., monetary) incentives initially given to the influential spreaders on a social network…
math.OC2017
A DC Programming Approach for Solving Multicast Network Design Problems via the Nesterov Smoothing Technique
W. Geremew, N. M. Nam, A. Semenov +2
This paper continues our effort initiated in [9] to study Multicast Communication Networks, modeled as bilevel hierarchical clustering problems, by using mathematical optimization…