Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
type: Item
instance of: scholarly article
title: Revenue maximization for multiple advertisements placement on a web banner using a pixel-price model
author: Edmar Langendoen
author: Flavius Frasincar
author: Mark Riezebos
author: Vladyslav Matsiiako
author: David Boekestijn
published in: Annals of Operations Research
publication date: 2024-07-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7881812
zbMATH Keywords: revenue management
zbMATH Keywords: pixel advertisement
zbMATH Keywords: heuristics
zbMATH Keywords: two-dimensional knapsack problem
zbMATH Keywords: location-based price model
MaRDI profile type: Publication
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: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
cites work: Maximizing revenue with allocation of multiple advertisements on a Web banner
cites work: On the two-dimensional knapsack problem
cites work: Dynamic bidding strategies in search-based advertising
cites work: A typology of cutting and packing problems
cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem
cites work: Greedy randomized adaptive search procedures
cites work: An exact algorithm for general, orthogonal, two-dimensional knapsack problems
cites work: Reducibility among Combinatorial Problems
cites work: Scheduling advertisements on a web page to maximize revenue
cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems
cites work: A goal programming model for selection and scheduling of advertisements on online news media
cites work: Scheduling banner advertisements on the web
cites work: A GRASP algorithm for flexible job-shop scheduling with maintenance constraints
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: An improved typology of cutting and packing problems
DOI: 10.1007/S10479-024-05920-X
description: scientific article; zbMATH DE number 7881812