.png){kind=icon}
返回
Mobile coupons delivery problem: Postponable online multi-constraint knapsack
.png){kind=icon}
PRE
AI
DOI：10.1016/j.dss.2018.10.004.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We study the mobile coupons delivery problem (MCDP) in a push-based location based advertisement where an advertiser proactively sends mobile coupons to prospective customers on behalf of stores based on the customers' location and preferences. MCDP provides a new capability called postponable selection that enables an advertiser to better capitalize on the plethora of customer information provided by mobile phone users through network service providers. Postponable selection allows a customer to be reconsidered for selection for coupon delivery (i.e. postponed) as more information becomes available. We formulate MCDP as a new problem category referred to as the postponable online multi-constraint knapsack. We propose a single threshold-type algorithm with different design options and conduct extensive computational experiments to discuss the effectiveness of our algorithm as well as the benefit of postponable selection. Our experimental results show that the proposed algorithm outperforms the First-Come-First-Serve heuristic by 46% and postponable selection additionally improves performance by 4% on average.
Keyword:
Mobile coupons delivery problem
Online multi-constraint knapsack problem
Online algorithm
Postponable selection
Computational experiment
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.8
论文数:
3.8K
被引数:
1.5W
机构
引用论文
.png){kind=icon}
分享收藏The Role of Push-Pull Technology in Privacy Calculus: The Case of Location-Based Services推拉技术在隐私演算中的作用: 以基于位置的服务为例
PREAI
分享收藏
分享收藏
查看更多内容