A Lagrangian Approach for Multiple Personalized Campaigns

The multicampaign assignment problem is a campaign model to overcome the multiple-recommendation problem that occurs when conducting several personalized campaigns simultaneously. In this paper, we propose a Lagrangian method for the problem. The original problem space is transformed to another simpler one by introducing Lagrange multipliers, which relax the constraints of the multicampaign assignment problem. When the Lagrangian vector is supplied, we can compute the optimal solution under this new environment in O

• Type: Journal
• Year: 2008
• Where: TKDE
• Authors: Yong-Hyuk Kim, Yourim Yoon, Byung Ro Moon
• Keywords: Lagrangian, Lagrangian Method, Multicampaign Assignment Problem, TKDE 2008