IDEAS home Printed from https://ideas.repec.org/a/eee/jomega/v40y2012i5p562-570.html
   My bibliography  Save this article

Scheduling online advertisements to maximize revenue under variable display frequency

Author

Listed:
  • Deane, Jason
  • Agarwal, Anurag

Abstract

The online advertising industry realized annual revenues estimated at over $26 billion, in the United States alone, in 2010. Banner advertising accounts for an estimated 23% of all online advertising revenues. Publishers of banner advertisements face a scheduling optimization problem on a daily basis. Several papers in the literature have proposed mathematical models and solution approaches to address a publisher's banner advertisement scheduling problem and the problem has been shown to be NP-hard. In this paper we propose a new model variation for the problem, which incorporates variable display frequencies. We find that the variable-display frequency model provides significantly improved space utilization relative to the fixed-display frequency model and consequently higher revenues for the publishers.

Suggested Citation

  • Deane, Jason & Agarwal, Anurag, 2012. "Scheduling online advertisements to maximize revenue under variable display frequency," Omega, Elsevier, vol. 40(5), pages 562-570.
    • Handle: RePEc:eee:jomega:v:40:y:2012:i:5:p:562-570
    DOI: 10.1016/j.omega.2011.11.001
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048311001666
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2011.11.001?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Adenso-Díaz, B. & Rodríguez, F., 1997. "A simple search heuristic for the MCLP: Application to the location of ambulance bases in a rural region," Omega, Elsevier, vol. 25(2), pages 181-187, April.
    2. Egon Balas & Clarence H. Martin, 1980. "Pivot and Complement--A Heuristic for 0-1 Programming," Management Science, INFORMS, vol. 26(1), pages 86-96, January.
    3. Syam Menon & Ali Amiri, 2004. "Scheduling Banner Advertisements on the Web," INFORMS Journal on Computing, INFORMS, vol. 16(1), pages 95-105, February.
    4. P. C. Gilmore & R. E. Gomory, 1966. "The Theory and Computation of Knapsack Functions," Operations Research, INFORMS, vol. 14(6), pages 1045-1074, December.
    5. Dimitris Bertsimas & Ramazan Demir, 2002. "An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems," Management Science, INFORMS, vol. 48(4), pages 550-565, April.
    6. Albareda-Sambola, Maria & Fernandez, Elena & Laporte, Gilbert, 2007. "Heuristic and lower bound for a stochastic location-routing problem," European Journal of Operational Research, Elsevier, vol. 179(3), pages 940-955, June.
    7. Vasquez, Michel & Vimont, Yannick, 2005. "Improved results on the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 165(1), pages 70-81, August.
    8. Syam, Siddhartha S. & Côté, Murray J., 2010. "A location-allocation model for service providers with application to not-for-profit health care organizations," Omega, Elsevier, vol. 38(3-4), pages 157-166, June.
    9. Albareda-Sambola, Maria & Fernández, Elena & Saldanha-da-Gama, Francisco, 2011. "The facility location problem with Bernoulli demands," Omega, Elsevier, vol. 39(3), pages 335-345, June.
    10. Redondo, Juana L. & Fernández, José & Arrondo, Aránzazu G. & García, Inmaculada & Ortigosa, Pilar M., 2012. "Fixed or variable demand? Does it matter when locating a facility?," Omega, Elsevier, vol. 40(1), pages 9-20, January.
    11. Costa, Alysson M. & França, Paulo M. & Lyra Filho, Christiano, 2011. "Two-level network design with intermediate facilities: An application to electrical distribution systems," Omega, Elsevier, vol. 39(1), pages 3-13, January.
    12. Kumar, Subodha & Jacob, Varghese S. & Sriskandarajah, Chelliah, 2006. "Scheduling advertisements on a web page to maximize revenue," European Journal of Operational Research, Elsevier, vol. 173(3), pages 1067-1089, September.
    13. Eilon, Samuel, 1987. "Application of the knapsack model for budgeting," Omega, Elsevier, vol. 15(6), pages 489-494.
    14. Hübner, Alexander H. & Kuhn, Heinrich, 2012. "Retail category management: State-of-the-art review of quantitative research and software applications in assortment and shelf space management," Omega, Elsevier, vol. 40(2), pages 199-209, April.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Beltran-Royo, C. & Escudero, L.F. & Zhang, H., 2016. "Multiperiod Multiproduct Advertising Budgeting: Stochastic Optimization Modeling," Omega, Elsevier, vol. 59(PA), pages 26-39.
    2. Deza, Antoine & Huang, Kai & Metel, Michael R., 2015. "Chance constrained optimization for targeted Internet advertising," Omega, Elsevier, vol. 53(C), pages 90-96.
    3. Shah, Nita H & Soni, Hardik N & Patel, Kamlesh A, 2013. "Optimizing inventory and marketing policy for non-instantaneous deteriorating items with generalized type deterioration and holding cost rates," Omega, Elsevier, vol. 41(2), pages 421-430.
    4. H. Mirzaei, Fouad & Ødegaard, Fredrik & Yan, Xinghao, 2015. "User reward programs in online social media," Omega, Elsevier, vol. 57(PB), pages 123-144.
    5. Tunuguntla, Vaishnavi & Basu, Preetam & Rakshit, Krishanu & Ghosh, Debabrata, 2019. "Sponsored search advertising and dynamic pricing for perishable products under inventory-linked customer willingness to pay," European Journal of Operational Research, Elsevier, vol. 276(1), pages 119-132.
    6. M. Palanivel & R. Uthayakumar, 2015. "Finite horizon EOQ model for non-instantaneous deteriorating items with price and advertisement dependent demand and partial backlogging under inflation," International Journal of Systems Science, Taylor & Francis Journals, vol. 46(10), pages 1762-1773, July.
    7. Ballings, Michel & Van den Poel, Dirk & Bogaert, Matthias, 2016. "Social media optimization: Identifying an optimal strategy for increasing network size on Facebook," Omega, Elsevier, vol. 59(PA), pages 15-25.
    8. Zhang, Jianqiang & He, Xiuli, 2019. "Targeted advertising by asymmetric firms," Omega, Elsevier, vol. 89(C), pages 136-150.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Bell, John E. & Griffis, Stanley E. & Cunningham III, William A. & Eberlan, Jon A., 2011. "Location optimization of strategic alert sites for homeland defense," Omega, Elsevier, vol. 39(2), pages 151-158, April.
    2. Hanafi, Said & Freville, Arnaud, 1998. "An efficient tabu search approach for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 106(2-3), pages 659-675, April.
    3. Yuji Nakagawa & Ross J. W. James & César Rego & Chanaka Edirisinghe, 2014. "Entropy-Based Optimization of Nonlinear Separable Discrete Decision Models," Management Science, INFORMS, vol. 60(3), pages 695-707, March.
    4. Jakob Puchinger & Günther R. Raidl & Ulrich Pferschy, 2010. "The Multidimensional Knapsack Problem: Structure and Algorithms," INFORMS Journal on Computing, INFORMS, vol. 22(2), pages 250-265, May.
    5. Georgiadis, Michael C. & Tsiakis, Panagiotis & Longinidis, Pantelis & Sofioglou, Maria K., 2011. "Optimal design of supply chain networks under uncertain transient demand variations," Omega, Elsevier, vol. 39(3), pages 254-272, June.
    6. Freville, Arnaud, 2004. "The multidimensional 0-1 knapsack problem: An overview," European Journal of Operational Research, Elsevier, vol. 155(1), pages 1-21, May.
    7. Wilbaut, Christophe & Salhi, Saïd & Hanafi, Saïd, 2009. "An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem," European Journal of Operational Research, Elsevier, vol. 199(2), pages 339-348, December.
    8. Yanhong Feng & Hongmei Wang & Zhaoquan Cai & Mingliang Li & Xi Li, 2023. "Hybrid Learning Moth Search Algorithm for Solving Multidimensional Knapsack Problems," Mathematics, MDPI, vol. 11(8), pages 1-28, April.
    9. Shinjini Pandey & Goutam Dutta & Harit Joshi, 2017. "Survey on Revenue Management in Media and Broadcasting," Interfaces, INFORMS, vol. 47(3), pages 195-213, June.
    10. Kumar, Subodha & Sethi, Suresh P., 2009. "Dynamic pricing and advertising for web content providers," European Journal of Operational Research, Elsevier, vol. 197(3), pages 924-944, September.
    11. Charles H. Reilly, 2009. "Synthetic Optimization Problem Generation: Show Us the Correlations!," INFORMS Journal on Computing, INFORMS, vol. 21(3), pages 458-467, August.
    12. John Turner, 2012. "The Planning of Guaranteed Targeted Display Advertising," Operations Research, INFORMS, vol. 60(1), pages 18-33, February.
    13. Contreras, Ivan & Fernández, Elena & Reinelt, Gerhard, 2012. "Minimizing the maximum travel time in a combined model of facility location and network design," Omega, Elsevier, vol. 40(6), pages 847-860.
    14. Selçuk, B. & Özlük, Ö., 2013. "Optimal keyword bidding in search-based advertising with target exposure levels," European Journal of Operational Research, Elsevier, vol. 226(1), pages 163-172.
    15. Oliver Bastert & Benjamin Hummel & Sven de Vries, 2010. "A Generalized Wedelin Heuristic for Integer Programming," INFORMS Journal on Computing, INFORMS, vol. 22(1), pages 93-107, February.
    16. Prerna Manik & Anshu Gupta & P. C. Jha & Kannan Govindan, 2016. "A Goal Programming Model for Selection and Scheduling of Advertisements on Online News Media," Asia-Pacific Journal of Operational Research (APJOR), World Scientific Publishing Co. Pte. Ltd., vol. 33(02), pages 1-41, April.
    17. Bieniek, Milena, 2015. "A note on the facility location problem with stochastic demands," Omega, Elsevier, vol. 55(C), pages 53-60.
    18. Karaoglan, Ismail & Altiparmak, Fulya & Kara, Imdat & Dengiz, Berna, 2012. "The location-routing problem with simultaneous pickup and delivery: Formulations and a heuristic approach," Omega, Elsevier, vol. 40(4), pages 465-477.
    19. Haase, Knut & Müller, Sven, 2013. "Management of school locations allowing for free school choice," Omega, Elsevier, vol. 41(5), pages 847-855.
    20. Setzer, Thomas & Blanc, Sebastian M., 2020. "Empirical orthogonal constraint generation for Multidimensional 0/1 Knapsack Problems," European Journal of Operational Research, Elsevier, vol. 282(1), pages 58-70.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:jomega:v:40:y:2012:i:5:p:562-570. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/375/description#description .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.