Maximizing revenue with allocation of multiple advertisements on a Web banner
type: Item
instance of: scholarly article
title: Maximizing revenue with allocation of multiple advertisements on a Web banner
zbMATH Open document ID: 1208.90100
author: Victor Boskamp
author: Alex Knoops
author: Flavius Frasincar
author: Adriana F. Gabor
published in: Computers \& Operations Research
publication date: 2011-03-25T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 68T20
zbMATH DE Number: 5870593
zbMATH Keywords: web advertisement
zbMATH Keywords: pixel advertisement
zbMATH Keywords: allocation patterns
zbMATH Keywords: heuristics
zbMATH Keywords: two-dimensional Knapsack problem
MaRDI profile type: Publication
full work available at URL: j.cor.2011.01.006
OpenAlex ID: W2025475498
cites work: An improved typology of cutting and packing problems
cites work: An exact algorithm for general, orthogonal, two-dimensional knapsack problems
cites work: Scheduling space-sharing for internet advertising
cites work: Performance bounds of algorithms for scheduling advertisements on a web page
cites work: Approximating the advertisement placement problem
cites work: Scheduling web advertisements: a note on the minspace problem
cites work: Scheduling banner advertisements on the web
cites work: Scheduling advertisements on a web page to maximize revenue
cites work: On the two-dimensional knapsack problem
cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems
cites work: A new exact method for the two-dimensional orthogonal packing problem
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem
cites work: An approximation algorithm for solving unconstrained two-dimensional knapsack problems
cites work: Heuristic algorithms for the multiple-choice multidimensional knapsack problem
cites work: A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Two-dimensional packing problems: a survey
cites work: A population heuristic for constrained two-dimensional non-guillotine cutting
cites work: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
cites work: A tabu search algorithm for a two-dimensional non-guillotine cutting problem
cites work: Depth-first iterative-deepening: An optimal admissible tree search
DOI: 10.1016/J.COR.2011.01.006
description: scientific article; zbMATH DE number 5870593