|
马上登录,看更多精彩内容!
您需要 登录 才可以下载或查看,没有账号?立即注册
×
𝑚m, and t𝑡t are the variety of demographic zones, number of billboard slots and number of tuples in the trajectory database to calculate affect value, respectively. Second, we observe that the rise in the number of zones results in a smaller number of tags to be handled within the case of the NYC dataset compared to the LA dataset, as LA divided only three zones and NYC divided into 5 demographic zones. In line 10, the allocation value for the selected slots and corresponding tags is calculated. Third, the allocation price for the tag to slots will increase due to greater international and individual affect demand. Algorithm 1 always selects a possible tag slots pair considering minimum allocation prices. Cost-Effective Greedy (CEG) Algorithm. We've proposed a cheap greedy algorithm. Now we have finished an integer programming formulation for this problem. Next, we formalize our problems utilizing integer linear programming. Next, sorted slots are selected to allocate tags individually till the zonal affect necessities and budget constraints are happy. |
|