Unintrusive customization techniques for Web advertising
WWW '99 Proceedings of the eighth international conference on World Wide Web
An entropy approach to unintrusive targeted advertising on the Web
Proceedings of the 9th international World Wide Web conference on Computer networks : the international journal of computer and telecommunications netowrking
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Framework for the Optimizing of WWW Advertising
TREC '98 Proceedings of the International IFIP/GI Working Conference on Trends in Distributed Systems for Electronic Commerce
Targeted advertising on the Web with inventory management
Interfaces - Wagner prize papers
Performance bounds of algorithms for scheduling advertisements on a web page
Journal of Scheduling
Approximating the Advertisement Placement Problem
Journal of Scheduling
Scheduling Banner Advertisements on the Web
INFORMS Journal on Computing
Improvements to the Linear Programming Based Scheduling of Web Advertisements
Electronic Commerce Research
Scheduling Web Advertisements: A Note on the Minspace Problem
Journal of Scheduling
An Improved Augmented Neural-Network Approach for Scheduling Problems
INFORMS Journal on Computing
Optimal Scheduling and Placement of Internet Banner Advertisements
IEEE Transactions on Knowledge and Data Engineering
Scheduling web banner advertisements with multiple display frequencies
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Hi-index | 12.05 |
Worldwide growth of the online community continues to push the popularity of internet marketing. Fueled by this trend, the online advertising industry is experiencing unprecedented revenue growth. One of the most important drivers of this revenue is banner advertising, which has long been a staple of the online advertising industry. Previous research has introduced quantitative models and solution approaches for the challenging basic scheduling optimization problem. We extend this work by incorporating the most common and popular trend in the in the industry, online advertisement targeting. In addition, motivated by the NP-hard nature of the resulting problem, we propose and test several heuristic and metaheuristic based solution techniques for the proposed problem.