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...

Celý popis

Podrobná bibliografia

Vydané v:	Optimization letters Ročník 13; číslo 1; s. 81 - 94
Hlavní autori:	Díaz-Núñez, Fabián, Halman, Nir, Vásquez, Óscar C.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Berlin/Heidelberg Springer Berlin Heidelberg 08.02.2019
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!