Abstract:
We consider the scalability issues in the static data segment location problem in information networks and provide integer linear programming (ILP) formulations for user ...Show MoreMetadata
Abstract:
We consider the scalability issues in the static data segment location problem in information networks and provide integer linear programming (ILP) formulations for user aggregation. We explore three approaches based on k-means clustering, locality-of-reference and biased locality of reference. The second and third approaches are innovatively modeled as discrete optimization problems. The models are tested in IBM ILOG CPLEX Optimization Studio platform and the computational results are discussed in this paper.
Published in: 2020 IEEE International Conference on Industrial Engineering and Engineering Management (IEEM)
Date of Conference: 14-17 December 2020
Date Added to IEEE Xplore: 12 January 2021
ISBN Information:
Contents 