{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T06:46:44Z","timestamp":1773384404261,"version":"3.50.1"},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T00:00:00Z","timestamp":1711238400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T00:00:00Z","timestamp":1711238400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2024,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The aim of this paper is to optimize the allocation of multiple advertisements on a Web banner, where the price of an advertisement depends on the location at the banner. This problem can be defined as a two-dimensional single orthogonal knapsack problem with a location-based pixel-price model. A formulation is proposed in which the problem is specified as a 0\u20131 integer programming problem. As this problem is NP-complete, we mainly focus on a heuristic approach to solve the problem. We propose two new heuristic algorithms: the reactive GRASP algorithm and the partitioning left-justified algorithm. Next to that, we present an exact algorithm that is able to solve small problem instances in a reasonable time. These newly presented algorithms are compared with respect to efficiency and effectiveness to existing algorithms that solve the problem without a location-based pixel-price model. To test the quality of the algorithms, we have executed two experiments. The results of these experiments show that overall the reactive GRASP algorithm is the most effective algorithm, whereas the greedy stripping algorithm is the most efficient.<\/jats:p>","DOI":"10.1007\/s10479-024-05920-x","type":"journal-article","created":{"date-parts":[[2024,3,24]],"date-time":"2024-03-24T03:01:13Z","timestamp":1711249273000},"page":"135-166","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model"],"prefix":"10.1007","volume":"337","author":[{"given":"Edmar","family":"Langendoen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8031-758X","authenticated-orcid":false,"given":"Flavius","family":"Frasincar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Riezebos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladyslav","family":"Matsiiako","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Boekestijn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,24]]},"reference":[{"issue":"4","key":"5920_CR1","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1057\/palgrave.jors.2601829","volume":"56","author":"R Alvarez-Valdes","year":"2005","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., & Tamarit, J. M. (2005). A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. Journal of the Operational Research Society, 56(4), 414\u2013425.","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"5920_CR2","doi-asserted-by":"publisher","first-page":"1167","DOI":"10.1016\/j.ejor.2005.11.068","volume":"183","author":"R Alvarez-Valdes","year":"2007","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., & Tamarit, J. M. (2007). A Tabu search algorithm for a two-dimensional non-guillotine cutting problem. European Journal of Operational Research, 183(3), 1167\u20131182.","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"5920_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1287\/opre.33.1.49","volume":"33","author":"JE Beasley","year":"1985","unstructured":"Beasley, J. E. (1985). An exact two-dimensional non-guillotine cutting tree search procedure. Operations Research, 33(1), 49\u201364.","journal-title":"Operations Research"},{"key":"5920_CR4","unstructured":"Benavides, A., Machado, M.S., Costa, A.M., Ritt, M., Buriol, L., Garcia, V., & Franca, P. (2009). A Comparison of Tabu Search and GRASP for the switch allocation problem. 41st Brazilian Operational Research Symposium (SBPO 2009)."},{"issue":"6","key":"5920_CR5","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1111\/j.1475-3995.2009.00701.x","volume":"16","author":"A Bortfeldt","year":"2009","unstructured":"Bortfeldt, A., & Winter, T. (2009). A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces. International Transactions in Operational Research, 16(6), 685\u2013713.","journal-title":"International Transactions in Operational Research"},{"issue":"10","key":"5920_CR6","doi-asserted-by":"publisher","first-page":"1412","DOI":"10.1016\/j.cor.2011.01.006","volume":"38","author":"V Boskamp","year":"2011","unstructured":"Boskamp, V., Knoops, A., Frasincar, F., & Gabor, A. (2011). Maximizing revenue with allocation of multiple advertisements on a web banner. Computers & Operations Research, 38(10), 1412\u20131424.","journal-title":"Computers & Operations Research"},{"issue":"1","key":"5920_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1016\/S0167-6377(03)00057-9","volume":"32","author":"A Caprara","year":"2004","unstructured":"Caprara, A., & Monaci, M. (2004). On the two-dimensional knapsack problem. Operations Research Letters, 32(1), 5\u201314.","journal-title":"Operations Research Letters"},{"issue":"1","key":"5920_CR8","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s10479-013-1427-z","volume":"211","author":"S Dayanik","year":"2013","unstructured":"Dayanik, S., & Parlar, M. (2013). Dynamic bidding strategies in search-based advertising. Annals of Operations Research, 211(1), 103\u2013136.","journal-title":"Annals of Operations Research"},{"issue":"2","key":"5920_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","volume":"44","author":"H Dyckhoff","year":"1990","unstructured":"Dyckhoff, H. (1990). A typology of cutting and packing problems. European Journal of Operational Research, 44(2), 145\u2013159.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"5920_CR10","doi-asserted-by":"publisher","first-page":"1026","DOI":"10.1016\/j.cor.2007.12.004","volume":"36","author":"J Egeblad","year":"2009","unstructured":"Egeblad, J., & Pisinger, D. (2009). Heuristic approaches for the two- and three-dimensional knapsack packing problem. Computers & Operations Research, 36(4), 1026\u20131049.","journal-title":"Computers & Operations Research"},{"issue":"2","key":"5920_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo, T. A., & Resende, M. G. C. (1995). Greedy randomized adaptive search procedures. Journal of Global Optimization, 6(2), 109\u2013133.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"5920_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s11151-013-9399-3","volume":"44","author":"A Goldfarb","year":"2014","unstructured":"Goldfarb, A. (2014). What is different about online advertising? Review of Industrial Organization, 44(2), 115\u2013129.","journal-title":"Review of Industrial Organization"},{"key":"5920_CR13","unstructured":"Google: Google Ads. Retrieved 9 Mar 2023 from https:\/\/support.google.com\/google-ads\/answer\/142918."},{"issue":"1","key":"5920_CR14","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0377-2217(93)E0278-6","volume":"83","author":"E Hadjiconstantinou","year":"1995","unstructured":"Hadjiconstantinou, E., & Christofides, N. (1995). An exact algorithm for general, orthogonal, two-dimensional knapsack problems. European Journal of Operational Research, 83(1), 39\u201356.","journal-title":"European Journal of Operational Research"},{"key":"5920_CR15","unstructured":"Insider Intelligence: Worldwide Digital Ad Spending 2021. Retrieved 9 Mar 2023 from https:\/\/www.insiderintelligence.com\/content\/worldwide-digital-ad-spending-2021."},{"key":"5920_CR16","doi-asserted-by":"crossref","unstructured":"Karp, R.M. (1972). Reducibility among Combinatorial Problems. In: Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103 . Springer.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"1","key":"5920_CR17","first-page":"306","volume":"9","author":"A Kaul","year":"2018","unstructured":"Kaul, A., Aggarwal, S., Gupta, A., Dayama, N., Krishnamoorthy, M., & Jha, P. (2018). Optimal advertising on a two-dimensional web banner. International Journal of System Assurance Engineering and Management, 9(1), 306\u2013311.","journal-title":"International Journal of System Assurance Engineering and Management"},{"key":"5920_CR18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106226","volume":"140","author":"G Kim","year":"2020","unstructured":"Kim, G., & Moon, I. (2020). Online banner advertisement scheduling for advertising effectiveness. Computers & Industrial Engineering, 140, 106226.","journal-title":"Computers & Industrial Engineering"},{"key":"5920_CR19","doi-asserted-by":"crossref","unstructured":"Knoops, A., Boskamp, V., Wojciechowski, A., & Frasincar, F. (2009). Single Pattern Generating Heuristics for Pixel Advertisements. In 10th International Conference on Web Information Systems Engineering (WISE 2009), pp. 415\u2013428 . Springer.","DOI":"10.1007\/978-3-642-04409-0_41"},{"issue":"3","key":"5920_CR20","doi-asserted-by":"publisher","first-page":"1067","DOI":"10.1016\/j.ejor.2005.07.005","volume":"173","author":"S Kumar","year":"2006","unstructured":"Kumar, S., Jacob, V. S., & Sriskandarajah, C. (2006). Scheduling advertisements on a web page to maximize revenue. European Journal of Operational Research, 173(3), 1067\u20131089.","journal-title":"European Journal of Operational Research"},{"issue":"2\u20133","key":"5920_CR21","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1007\/s10107-002-0319-9","volume":"94","author":"A Lodi","year":"2003","unstructured":"Lodi, A., & Monaci, M. (2003). Integer linear programming models for 2-staged two-dimensional knapsack problems. Mathematical Programming, 94(2\u20133), 257\u2013278.","journal-title":"Mathematical Programming"},{"issue":"4","key":"5920_CR22","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1080\/00913367.2019.1652123","volume":"48","author":"EC Malthouse","year":"2019","unstructured":"Malthouse, E. C., Hessary, Y. K., Vakeel, K. A., Burke, R., & Fuduri\u0107, M. (2019). An algorithm for allocating sponsored recommendations and content: Unifying programmatic advertising and recommender systems. Journal of Advertising, 48(4), 366\u2013379.","journal-title":"Journal of Advertising"},{"issue":"02","key":"5920_CR23","doi-asserted-by":"publisher","first-page":"1650012","DOI":"10.1142\/S0217595916500123","volume":"33","author":"P Manik","year":"2016","unstructured":"Manik, P., Gupta, A., Jha, P., & Govindan, K. (2016). A goal programming model for selection and scheduling of advertisements on online news media. Asia-Pacific Journal of Operational Research, 33(02), 1650012.","journal-title":"Asia-Pacific Journal of Operational Research"},{"issue":"1","key":"5920_CR24","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1287\/ijoc.1020.0003","volume":"16","author":"S Menon","year":"2004","unstructured":"Menon, S., & Amiri, A. (2004). Scheduling banner advertisements on the web. INFORMS Journal on Computing, 16(1), 95\u2013105.","journal-title":"INFORMS Journal on Computing"},{"key":"5920_CR25","unstructured":"Microsoft: Microsoft Advertising. Retrieved 9 Mar 2023 from https:\/\/ads.microsoft.com."},{"key":"5920_CR26","unstructured":"Nielsen, J. (2010) Horizontal Attention Leans Left. http:\/\/www.nngroup.com\/articles\/horizontal-attention-leans-left\/. NN Group."},{"key":"5920_CR27","unstructured":"Nielsen, J. (2010) Scrolling and Attention. http:\/\/www.nngroup.com\/articles\/scrolling-and-attention\/. NN Group."},{"issue":"8","key":"5920_CR28","doi-asserted-by":"publisher","first-page":"2409","DOI":"10.1080\/00207541003709544","volume":"49","author":"M Rajkumar","year":"2011","unstructured":"Rajkumar, M., Asokan, P., Anilkumar, N., & Page, T. (2011). A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints. International Journal of Production Research, 49(8), 2409\u20132423.","journal-title":"International Journal of Production Research"},{"issue":"22","key":"5920_CR29","doi-asserted-by":"publisher","first-page":"6821","DOI":"10.1080\/00207540903308969","volume":"48","author":"M Rajkumar","year":"2010","unstructured":"Rajkumar, M., Asokan, P., & Vamsikrishna, V. (2010). A GRASP algorithm for flexible job-shop scheduling with maintenance constraints. International Journal of Production Research, 48(22), 6821\u20136836.","journal-title":"International Journal of Production Research"},{"key":"5920_CR30","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez, I., Rubio, F., & Rabanal, P. (2016). Automatic Media Planning: Optimal Advertisement Placement Problems. In: 2016 IEEE congress on evolutionary computation (CEC 2016), pp. 5170\u20135177 . IEEE.","DOI":"10.1109\/CEC.2016.7748345"},{"issue":"5","key":"5920_CR31","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1057\/rpm.2009.10","volume":"8","author":"G Roels","year":"2009","unstructured":"Roels, G., & Fridgeirsdottir, K. (2009). Dynamic revenue management for online display advertising. Journal of Revenue and Pricing Management, 8(5), 452\u2013466.","journal-title":"Journal of Revenue and Pricing Management"},{"issue":"1\u20132","key":"5920_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s12243-009-0142-x","volume":"65","author":"J Shaikh","year":"2010","unstructured":"Shaikh, J., Fiedler, M., & Collange, D. (2010). Quality of experience from user and network perspectives. Annals of Telecommunications, 65(1\u20132), 47\u201357.","journal-title":"Annals of Telecommunications"},{"key":"5920_CR33","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1023\/A:1018952112615","volume":"86","author":"JM Val\u00e9rio de Carvalho","year":"1999","unstructured":"Val\u00e9rio de Carvalho, J. M. (1999). Exact solution of bin-packing problems using column generation and branch-and-bound. Annals of Operations Research, 86, 629\u2013659.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"5920_CR34","doi-asserted-by":"publisher","first-page":"1109","DOI":"10.1016\/j.ejor.2005.12.047","volume":"183","author":"G W\u00e4scher","year":"2007","unstructured":"W\u00e4scher, G., Hau\u00dfner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183(3), 1109\u20131130.","journal-title":"European Journal of Operational Research"},{"key":"5920_CR35","doi-asserted-by":"crossref","unstructured":"Wojciechowski, A., Kapral, D. (2009). Allocation of multiple advertisement on limited space: heuristic approach. In: Future Multimedia Networking, pp. 230\u2013235 . Springer.","DOI":"10.1007\/978-3-642-02472-6_24"},{"issue":"1","key":"5920_CR36","first-page":"362","volume":"35","author":"H Yang","year":"2021","unstructured":"Yang, H., Wang, T., Tang, X., Yu, H., Liu, F., & Song, H. (2021). Dynamically optimizing display advertising profits under diverse budget settings. IEEE Transactions on Knowledge and Data Engineering, 35(1), 362\u2013376.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-05920-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10479-024-05920-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-024-05920-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,30]],"date-time":"2024-05-30T17:10:51Z","timestamp":1717089051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10479-024-05920-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,24]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["5920"],"URL":"https:\/\/doi.org\/10.1007\/s10479-024-05920-x","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,24]]},"assertion":[{"value":"15 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no conflicts of interest and this research was performed without involvement of human participants and\/or animals.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}