A new look at generating multi-join continuous query plans: A qualified plan generation problem

2010 ◽  
Vol 69 (5) ◽  
pp. 424-443 ◽  
Author(s):  
Yali Zhu ◽  
Venkatesh Raghavan ◽  
Elke A. Rundensteiner
Author(s):  
Özlem Cosgun ◽  
İlkay Gultas

Major advertisers and/or advertisement agencies purchase hundreds of slots during a given broadcast period. Deterministic optimization approaches have been well developed for the problem of meeting client requests. The challenging task for the academic research currently is to address optimization problem under uncertainty. This paper is concerned with the sales plan generation problem when the audience levels of advertisement slots are random variables with known probability distributions. There are several constraints the TV networks must meet including client budget, product category and demographic information, plan weighting by week, program mix requirements, and the lengths of advertisement slots desired by the client. We formulate the problem as a chance constrained goal program and we demonstrate that it provides a robust solution with a user specified level of reliability.


2010 ◽  
Vol 44 (1) ◽  
pp. 2
Author(s):  
Catherine Cooper Nellist ◽  
Mary Jo Dales
Keyword(s):  

1973 ◽  
Vol 18 (7) ◽  
pp. 332-333
Author(s):  
KURT W. BACK
Keyword(s):  

2000 ◽  
Vol 45 (6) ◽  
pp. 628-630
Author(s):  
June P. Tangney ◽  
Ronda L. Hearing
Keyword(s):  

1960 ◽  
Vol 5 (1) ◽  
pp. 16-17
Author(s):  
IRA ISCOE
Keyword(s):  

1966 ◽  
Vol 11 (11) ◽  
pp. 528-529
Author(s):  
Aryeh Routtenberg
Keyword(s):  

1975 ◽  
Vol 20 (10) ◽  
pp. 789-790
Author(s):  
DAVID J. SCHNEIDER

Sign in / Sign up

Export Citation Format

Share Document