Scheduling web banner advertisements with multiple display frequencies

被引:17
作者
Amiri, A [1 ]
Menon, S
机构
[1] Oklahoma State Univ, Coll Business Adm, Stillwater, OK 74078 USA
[2] Univ Texas, Sch Management, Richardson, TX 75083 USA
来源
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART A-SYSTEMS AND HUMANS | 2006年 / 36卷 / 02期
关键词
banner advertising; multifrequency; scheduling; WWW;
D O I
10.1109/TSMCA.2005.855918
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Online advertising continues to be a significant source of income for many Internet-based organizations. Recent indications of improved economic growth are having an impact on advertisement revenue, with the estimated online advertising revenue in the United States for the fourth quarter of 2003 totaling a record of $2.2 billion. A substantial portion of this income comes from banner advertisements, and efficient scheduling of these advertisements could result in a considerable increase in profits. The problem of scheduling banner advertisements has been observed to be intractable via traditional optimization techniques and has received only limited attention in the literature. In addition, all past attempts to address this problem have been based on an "all-or-nothing" framework, where a customer specifies the exact number of copies of the ad to be displayed over the planning horizon, if it is selected for display by the provider of the advertisement space. This paper extends it to a more realistic setting, where the customer is allowed to specify a set of acceptable display frequencies. The Lagrangian decomposition-based solution approaches presented in this paper are observed to provide good schedules in a reasonable period of time.
引用
收藏
页码:245 / 251
页数:7
相关论文
共 21 条
[1]  
Adler M, 2002, J SCHEDULING, V5, P103, DOI 10.1002/jos.074
[2]   Branch-and-price: Column generation for solving huge integer programs [J].
Barnhart, C ;
Johnson, EL ;
Nemhauser, GL ;
Savelsbergh, MWP ;
Vance, PH .
OPERATIONS RESEARCH, 1998, 46 (03) :316-329
[3]  
Bazarra M.S., 1993, Nonlinear programming
[4]  
BUCHWALTER C, 2001, STATE ONLINE ADVERTI
[5]   THE LAGRANGIAN-RELAXATION METHOD FOR SOLVING INTEGER PROGRAMMING-PROBLEMS [J].
FISHER, ML .
MANAGEMENT SCIENCE, 1981, 27 (01) :1-18
[6]  
Garey M. R., 1975, SIAM Journal on Computing, V4, P187, DOI 10.1137/0204015
[7]  
Geoffrion A, 1974, MATHEMATICAL PROGRAM, V2, P82, DOI DOI 10.1007/BFB0120690
[8]   LAGRANGEAN DECOMPOSITION - A MODEL YIELDING STRONGER LAGRANGEAN BOUNDS [J].
GUIGNARD, M ;
KIM, S .
MATHEMATICAL PROGRAMMING, 1987, 39 (02) :215-228
[9]   TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].
HELD, M ;
KARP, RM .
OPERATIONS RESEARCH, 1970, 18 (06) :1138-&
[10]  
Held M., 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]