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 simp...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	IEEE transactions on knowledge and data engineering Ročník 20; číslo 3; s. 383 - 396
Hlavní autoři:	Yong-Hyuk Kim, Yoon, Y., Byung-Ro Moon
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York, NY IEEE 01.03.2008 IEEE Computer Society The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:	Algorithm design and analysis Algorithms for data and knowledge management Applied sciences Computer science; control theory; systems Constrained optimization Constraint optimization Customer satisfaction Customers Data processing. List processing. Character string processing Dynamic programming Electronic Commerce Evolutionary Evolutionary computing and genetic algorithms Exact sciences and technology Genetic algorithms Heuristic algorithms Lagrange multipliers Lagrangian functions Large-scale systems Marketing Mathematical analysis Mathematical models Memory organisation. Data processing Moon Operations research Optimization Personalized Software Studies Upper bound Vectors (mathematics) Algorithm design and analysis Electronic Commerce Evolutionary computing and genetic algorithms Algorithms for data and knowledge management Marketing Constrained optimization Lagrangian Evolutionary algorithm Customization Linear time multicampaign assignment Modeling Recommendation Lagrange multiplier Genetic algorithm Optimal solution Lagrangian method Personalized campaign
ISSN:	1041-4347, 1558-2191
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!