Computer Science – Computational Complexity
Scientific paper
2009-06-30
Proceedings of the 2010 ACM Symposium on Applied Computing (SAC), pages 94-98, 2010
Computer Science
Computational Complexity
14 pages, 1 figure
Scientific paper
Within personalized marketing, a recommendation issue known as multicampaign assignment is to overcome a critical problem, known as the multiple recommendation problem which occurs when running several personalized campaigns simultaneously. This paper mainly deals with the hardness of multicampaign assignment, which is treated as a very challenging problem in marketing. The objective in this problem is to find a customer-campaign matrix which maximizes the effectiveness of multiple campaigns under some constraints. We present a realistic response suppression function, which is designed to be more practical, and explain how this can be learned from historical data. Moreover, we provide a proof that this more realistic version of the problem is NP-hard, thus justifying to use of heuristics presented in previous work.
Kim Yong-Hyuk
Yoon Yourim
No associations
LandOfFree
A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Note on Mathematical Modelling of Practical Multicampaign Assignment and Its Computational Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-440708