Study on An Extended Web Advertising Placement Problem
In this paper, we discussed a layout optimization problem of web advertising to help the web site owners to maximize their profits. Unlike most of previous research, we established an integer programming model to maximize the spaces occupied by the web advertisements displayed in the first view of a web page. Then we adopted a subgradient optimization based Lagrangian Decomposition approach for the integer programming model. After that, a heuristic algorithm is used to make the length of the web page in each time interval as nearly identical as possible in a planning horizon. Finally, an example is given to illustrate the effectiveness of the above methods.
web advertising Integer Programming Lagrangian decomposition subgradient method heuristic algorithm
Lei liu Lihua Zhang
School of Mathematics and Systems Science Shenyang Normal University Shenyang, China
国际会议
西安
英文
373-377
2010-08-07（万方平台首次上网日期，不代表论文的发表时间）