Theory of linear and integer programming
Theory of linear and integer programming
Lagrangean decomposition: A model yielding stronger lagrangean bounds
Mathematical Programming: Series A and B
Integer and combinatorial optimization
Integer and combinatorial optimization
Linear programming and network flows (2nd ed.)
Linear programming and network flows (2nd ed.)
Unintrusive customization techniques for Web advertising
WWW '99 Proceedings of the eighth international conference on World Wide Web
Branch-And-Price: Column Generation for Solving Huge Integer Programs
Operations Research
Order Allocation for Stock Cutting in the Paper Industry
Operations Research
WAM-Miner: in the search of web access motifs from historical web log data
Proceedings of the 14th ACM international conference on Information and knowledge management
AdROSA-Adaptive personalization of web advertising
Information Sciences: an International Journal
An advanced bidding agent for advertisement selection on public displays
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Experimental comparison of scalable online ad serving
Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
Pervasive symbiotic advertising
Proceedings of the 9th workshop on Mobile computing systems and applications
Auction Mechanisms for Efficient Advertisement Selection on Public Displays
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
COWES: Web user clustering based on evolutionary web sessions
Data & Knowledge Engineering
Single Pattern Generating Heuristics for Pixel Advertisements
WISE '09 Proceedings of the 10th International Conference on Web Information Systems Engineering
Maximizing revenue with allocation of multiple advertisements on a Web banner
Computers and Operations Research
Multi-agent system for web advertising
KES'05 Proceedings of the 9th international conference on Knowledge-Based Intelligent Information and Engineering Systems - Volume Part II
A framework for intermediated online targeted advertising with banner ranking mechanism
Information Systems and e-Business Management
Discovering coverage patterns for banner advertisement placement
PAKDD'12 Proceedings of the 16th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part II
| Hi-index | 0.00 |
Despite the slowdown in the economy, advertisement revenue remains a significant source of income for many Internet-based organizations. Banner advertisements form a critical component of this income, accounting for 40 to 50 percent of the total revenue. There are considerable gains to be realized through the efficient scheduling of banner advertisements. This problem has been observed to be intractable via traditional optimization techniques, and has received only limited attention in the literature. This paper presents a procedure to generate advertisement schedules under the most commonly used advertisement pricing scheme---the CPM model. The solution approach is based on Lagrangean decomposition and is seen to provide extremely good advertisement schedules in a relatively short period of time, taking only a few hundred seconds of elapsed time on a 450 MHz PC compared to a few thousand seconds of CPU time on a workstation that other approaches need. Additionally, this approach can be incorporated into an actual implementation with minimal alterations and hence is of particular interest.