A several new mixed integer linear programming formulations for exploration of online social networks

The goal of this paper is to identify the most promising sets of closest assignment constraints from the literature, in order to improve mixed integer linear programming formulations for exploration of information flow within a social network. The direct comparison between proposed formulations is performed on standard single source capacitated facility location problem instances. Therefore, in contrast to previous work, these results could be verified, validated and used in direct comparison by some possible future method.

Citation

Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovica 6, 21000 Novi Sad, Serbia

Article

Download

View A several new mixed integer linear programming formulations for exploration of online social networks