
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
YongHyuk Kim, Yourim Yoon, ByungRo Moon, "A Lagrangian Approach for Multiple Personalized Campaigns," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 3, pp. 383396, March, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2007.190701, author = {YongHyuk Kim and Yourim Yoon and ByungRo Moon}, title = {A Lagrangian Approach for Multiple Personalized Campaigns}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {3}, issn = {10414347}, year = {2008}, pages = {383396}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190701}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  A Lagrangian Approach for Multiple Personalized Campaigns IS  3 SN  10414347 SP383 EP396 EPD  383396 A1  YongHyuk Kim, A1  Yourim Yoon, A1  ByungRo Moon, PY  2008 KW  Electronic Commerce KW  Marketing KW  Constrained optimization KW  Algorithm design and analysis KW  Algorithms for data and knowledge management KW  Evolutionary computing and genetic algorithms VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] “Email Marketing Maximized,” Insight Report 2000, Peppers and Rogers Group, 2000.
[2] C.C. Aggarwal, J.L. Wolf, K.L. Wu, and P.S. Yu, “Horting Hatches an Egg: A New GraphTheoretic Approach to Collaborative Filtering,” Proc. Fifth ACM SIGKDD Conf. Knowledge Discovery and Data Mining (KDD '99), pp. 201212, 1999.
[3] R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[4] M.J.A. Berry and G. Linoff, Data Mining Techniques: For Marketing, Sales, and Customer Support. John Wiley & Sons, 1997.
[5] M.J.A. Berry and G. Linoff, Mastering Data Mining: The Art and Science of Customer Relationship Management. John Wiley & Sons, 2000.
[6] M. Blum, R.W. Floyd, V. Pratt, R.L. Rivest, and R.E. Tarjan, “Time Bounds for Selection,” J. Computer and System Sciences, vol. 7, no. 4, pp. 448461, 1973.
[7] T.N. Bui and B.R. Moon, “Genetic Algorithm and Graph Partitioning,” IEEE Trans. Computers, vol. 45, no. 7, pp. 841855, July 1996.
[8] D. Cavicchio, “Adaptive Search Using Simulated Evolution,” PhD dissertation, Univ. of Michigan, Ann Arbor, 1970.
[9] E. Cela, The Quadratic Assignment Problem: Theory and Applications. Kluwer Academic Publishers, 1998.
[10] Y.J. Chang and B.W. Wah, “Lagrangian Techniques for Solving a Class of ZeroOne Integer Linear Programs,” Proc. 19th Ann. Int'l Computer Software and Applications Conf. (COMPSAC '95), pp. 156161, 1995.
[11] P.C. Chu and J.E. Beasley, “A Genetic Algorithm for the Generalized Assignment Problem,” Computers and Operations Research, vol. 24, pp. 1723, 1997.
[12] J. Dyché, The CRM Handbook: A Business Guide to Customer Relationship Management. AddisonWesley, 2001.
[13] H. Everett, “Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources,” Operations Research, vol. 11, pp. 399417, 1963.
[14] M.L. Fisher, “The Lagrangian Relaxation Method for Solving Integer Programming Problems,” Management Science, vol. 27, no. 1, pp. 118, 1981.
[15] B. Gavish, “On Obtaining the “Best” Multipliers for a Lagrangean Relaxation for Integer Programming,” Computers and Operations Research, vol. 5, pp. 5571, 1978.
[16] A.M. Geoffrion, “Lagrangean Relaxation for Integer Programming,” Math. Programming Study, vol. 2, pp. 82114, 1974.
[17] D. Greening, “Building Consumer Trust with Accurate Product Recommendations,” Technical Report LMWSWP2106966, LikeMinds white paper, 1997.
[18] S. Handdadi and H. Ouzia, “An Effective Lagrangian Heuristic for the Generalized Assignment Problem,” Information Systems and Operational Research, vol. 39, no. 4, 2001.
[19] J.L. Herlocker, J.A. Konstan, A. Borchers, and J. Riedl, “An Algorithmic Framework for Performing Collaborative Filtering,” Proc. ACM SIGIR '99, pp. 230237, 1999.
[20] Y.H. Kim and B.R. Moon, “LockGain Based Graph Partitioning,” J. Heuristics, vol. 10, no. 1, pp. 3757, Jan. 2004.
[21] Y.H. Kim and B.R. Moon, “Multicampaign Assignment Problem,” IEEE Trans. Knowledge and Data Eng., vol. 18, no. 3, pp. 405414, Mar. 2006.
[22] J.A. Konstan, B.N. Miller, D. Maltz, J.L. Herlocker, L.R. Gordan, and J. Riedl, “GroupLens: Applying Collaborative Filtering to Usenet News,” Comm. ACM, vol. 40, pp. 7787, 1997.
[23] H.W. Kuhn, “The Hungarian Method for the Assignment Problem,” Naval Research Logistics Quarterly, vol. 2, pp. 8397, 1955.
[24] Y.K. Kwon and B.R. Moon, “Personalized Email Marketing with a Genetic Programming Circuit Model,” Proc. Genetic and Evolutionary Computation Conf. (GECCO '01), pp. 13521358, 2001.
[25] D.G. Luenberger, Optimization by Vector Space Methods. John Wiley & Sons, 1969.
[26] M.J. Magazine and O. Oguz, “A Heuristic Algorithm for the Multidimensional ZeroOne Knapsack Problem,” European J. Operational Research, vol. 16, pp. 319326, 1984.
[27] R.K. Martin, Large Scale Linear and Integer Optimization: A Unified Approach. Kluwer Academic Publishers, 1998.
[28] L. McCauley and S. Franklin, “A LargeScale MultiAgent System for Navy Personnel Distribution,” Connection Science, vol. 14, no. 4, pp. 371385, 2002.
[29] P. Merz and B. Freisleben, “Fitness Landscape Analysis and Memetic Algorithms for the Quadratic Assignment Problem,” IEEE Trans. Evolutionary Computation, vol. 4, no. 4, pp. 337352, 2000.
[30] M.G. Narciso and L.A.N. Lorena, “Lagrangean/Surrogate Relaxation for Generalized Assignment Problems,” European J. Operational Research, vol. 114, pp. 165177, 1999.
[31] G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization. John Wiley & Sons, 1988.
[32] G. Raidl, “WeightCodings in a Genetic Algorithm for the Multiconstraint Knapsack Problem,” Proc. Congress on Evolutionary Computation (CEC '99), vol. 1, pp. 596603, 1999.
[33] Modern Heuristic Techniques for Combinatorial Problems, C.R. Reeves, ed. Halsted Press, 1993.
[34] P. Resnick, N. Iacovou, M. Sushak, P. Bergstrom, and J. Riedl, “GroupLens: An Open Architecture for Collaborative Filtering of Netnews,” Proc. Computer Supported Collaborative Work Conf. (CSCW '94), pp. 175186, 1994.
[35] D. Schuurmans, F. Southey, and R.C. Holte, “The Exponentiated Subgradient Algorithm for Heuristic Boolean Programming,” Proc. 17th Int'l Joint Conf. Artificial Intelligence (IJCAI '01), pp.334341, 2001.
[36] J.F. Shapiro, “A Survey of Lagrangian Techniques for Discrete Optimization,” Annals of Discrete Math., vol. 5, pp. 113138, 1979.
[37] U. Shardanand and P. Maes, “Social Information Filtering: Algorithms for Automating “Word of Mouth”,” Proc. ACM Conf. Human Factors in Computing Systems (CHI '95), vol. 1, pp. 210217, 1995.
[38] G. Syswerda, “Uniform Crossover in Genetic Algorithms,” Proc. Third Int'l Conf. Genetic Algorithms (ICGA '89), pp. 29, 1989.
[39] B.W. Wah and Z. Wu, “The Theory of Discrete Lagrange Multipliers for Nonlinear Discrete Optimization,” Proc. Fifth Int'l Conf. Principles and Practice of Constraint Programming (CP '99), pp.2842, 1999.
[40] Y. Yoon, Y.H. Kim, and B.R. Moon, “An Evolutionary Lagrangian Method for the 0/1 Multiple Knapsack Problem,” Proc. Genetic and Evolutionary Computation Conf. (GECCO '05), pp. 629635, 2005.
[41] Y. Yoon, Y.H. Kim, and B.R. Moon, “On the Computational Intractability of Multicampaign Assignment,” technical report, preprint, http://soar.snu.ac.kr/~yhdflymcapnpc.pdf , 2007.