The TV advertisements scheduling problem

A TV channel has a single advertisement break of duration h and a convex continuous function f : [ 0 , h ] → R + representing the TV rating points within the advertisement break. Given n TV advertisements of different durations p j that sum up to h , and willingness to pay coefficients w j , the obj...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Optimization letters Jg. 13; H. 1; S. 81 - 94
Hauptverfasser:	Díaz-Núñez, Fabián, Halman, Nir, Vásquez, Óscar C.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Berlin/Heidelberg Springer Berlin Heidelberg 08.02.2019
Schlagworte:	Computational Intelligence Mathematics Mathematics and Statistics Numerical and Computational Physics Operations Research/Decision Theory Optimization Original Paper Simulation Fully polynomial time approximation scheme approximation sets and functions TV rating points Scheduling Dynamic programming
ISSN:	1862-4472, 1862-4480
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!