A several new mixed integer linear programming formulations for exploration of online social networks
Zoran Gajic (zorangajicnsgmail.com)
Abstract: 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.
Keywords: Facility Location, Combinatorial Optimization, Social Networks.
Category 1: Integer Programming ((Mixed) Integer Linear Programming )
Category 2: Applications -- Science and Engineering (Facility Planning and Design )
Category 3: Optimization Software and Modeling Systems (Optimization Software Benchmark )
Citation: Faculty of Technical Sciences, University of Novi Sad, Trg Dositeja Obradovica 6, 21000 Novi Sad, Serbia
Entry Submitted: 04/30/2014
Modify/Update this entry
|Visitors||Authors||More about us||Links|
Search, Browse the Repository
Give us feedback
|Optimization Journals, Sites, Societies|