View in EDS HTML Full Text PDF Full Text

A branch‐and‐cut approach for the least cost influence problem on social networks.

Saved in:
Bibliographic Details
Title: A branch‐and‐cut approach for the least cost influence problem on social networks.
Authors: Günneç, Dilek1 (AUTHOR), Raghavan, S.2 (AUTHOR), Zhang, Rui3 (AUTHOR) rui.zhang@colorado.edu
Source: Networks. Jul2020, Vol. 76 Issue 1, p84-105. 22p.
Database: Mathematics Source
Full text is not displayed to guests.
Description
ISSN:00283045
DOI:10.1002/net.21941