.png){kind=icon}
Return
Multicampaign assignment problem
.png){kind=icon}
OA
AI
DOI：10.1109/TKDE.2006.49.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
It is crucial to maximize targeting efficiency and customer satisfaction in personalized marketing. State-of-the-art techniques for targeting focus on the optimization of individual campaigns. Our motivation is the belief that the effectiveness of a campaign with respect to a customer is affected by how many precedent campaigns have been recently delivered to the customer. We raise the multiple recommendation problem, which occurs when performing several personalized campaigns simultaneously. We formulate the multicampaign assignment problem to solve this issue and propose algorithms for the problem. The algorithms include dynamic programming and efficient heuristic methods. We verify by experiments the effectiveness of the problem formulation and the proposed algorithms.
Keywords:
personalized marketing
multicampaign assignment
dynamic programming
heuristic algorithms
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
10.4
Papers:
6.8K
Citations:
3.2W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSaveShareSave
View more