在有线电视上安排广告

IF 0.7 4区 管理学 Q3 Engineering
S. Souyris, Sridhar Seshadri, Sriram Subramanian
{"title":"在有线电视上安排广告","authors":"S. Souyris, Sridhar Seshadri, Sriram Subramanian","doi":"10.1287/opre.2022.2430","DOIUrl":null,"url":null,"abstract":"Scheduling Advertising on Cable Television Advertisement scheduling is a daily essential operational process in the television business. Efficient distribution of viewers among advertisers allows the television network to satisfy contracts and increase ad sale revenues. Ad scheduling is a challenging multiperiod, mixed-integer programming problem in which the network must create schedules to meet advertisers’ campaign goals and maximize ad revenues. Each campaign must meet a specific target group of viewers and a unique set of constraints. Moreover, the number of viewers is uncertain. To solve this problem, S. Souyris, S. Seshadri, and S. Subramanian develop and implement a practical approach that combines mathematical programming and machine learning to create daily schedules. According to standard business metrics and the small integer programming gap, these schedules are of high quality. Using their methods, leading networks in the United States and India experience a 3% to 5% revenue increase, which translates to about $60 million annually for one prominent user.","PeriodicalId":49809,"journal":{"name":"Military Operations Research","volume":"106 1","pages":""},"PeriodicalIF":0.7000,"publicationDate":"2023-01-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Scheduling Advertising on Cable Television\",\"authors\":\"S. Souyris, Sridhar Seshadri, Sriram Subramanian\",\"doi\":\"10.1287/opre.2022.2430\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling Advertising on Cable Television Advertisement scheduling is a daily essential operational process in the television business. Efficient distribution of viewers among advertisers allows the television network to satisfy contracts and increase ad sale revenues. Ad scheduling is a challenging multiperiod, mixed-integer programming problem in which the network must create schedules to meet advertisers’ campaign goals and maximize ad revenues. Each campaign must meet a specific target group of viewers and a unique set of constraints. Moreover, the number of viewers is uncertain. To solve this problem, S. Souyris, S. Seshadri, and S. Subramanian develop and implement a practical approach that combines mathematical programming and machine learning to create daily schedules. According to standard business metrics and the small integer programming gap, these schedules are of high quality. Using their methods, leading networks in the United States and India experience a 3% to 5% revenue increase, which translates to about $60 million annually for one prominent user.\",\"PeriodicalId\":49809,\"journal\":{\"name\":\"Military Operations Research\",\"volume\":\"106 1\",\"pages\":\"\"},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-18\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Military Operations Research\",\"FirstCategoryId\":\"91\",\"ListUrlMain\":\"https://doi.org/10.1287/opre.2022.2430\",\"RegionNum\":4,\"RegionCategory\":\"管理学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Military Operations Research","FirstCategoryId":"91","ListUrlMain":"https://doi.org/10.1287/opre.2022.2430","RegionNum":4,"RegionCategory":"管理学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

有线电视广告调度广告调度是电视业务中必不可少的日常操作过程。观众在广告商之间的有效分配使电视网络能够满足合同并增加广告销售收入。广告调度是一个具有挑战性的多周期,混合整数规划问题,其中网络必须创建时间表,以满足广告商的活动目标和最大化广告收入。每个活动都必须满足特定的目标受众群体和一组独特的约束条件。此外,观众的数量是不确定的。为了解决这个问题,S. Souyris, S. Seshadri和S. Subramanian开发并实施了一种实用的方法,将数学编程和机器学习相结合,以创建日常时间表。根据标准的业务指标和较小的整数规划差距,这些计划是高质量的。使用他们的方法,美国和印度的主要网络的收入增加了3%至5%,这意味着一个知名用户每年可以获得约6,000万美元的收入。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Scheduling Advertising on Cable Television
Scheduling Advertising on Cable Television Advertisement scheduling is a daily essential operational process in the television business. Efficient distribution of viewers among advertisers allows the television network to satisfy contracts and increase ad sale revenues. Ad scheduling is a challenging multiperiod, mixed-integer programming problem in which the network must create schedules to meet advertisers’ campaign goals and maximize ad revenues. Each campaign must meet a specific target group of viewers and a unique set of constraints. Moreover, the number of viewers is uncertain. To solve this problem, S. Souyris, S. Seshadri, and S. Subramanian develop and implement a practical approach that combines mathematical programming and machine learning to create daily schedules. According to standard business metrics and the small integer programming gap, these schedules are of high quality. Using their methods, leading networks in the United States and India experience a 3% to 5% revenue increase, which translates to about $60 million annually for one prominent user.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Military Operations Research
Military Operations Research 管理科学-运筹学与管理科学
CiteScore
1.00
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Military Operations Research is a peer-reviewed journal of high academic quality. The Journal publishes articles that describe operations research (OR) methodologies and theories used in key military and national security applications. Of particular interest are papers that present: Case studies showing innovative OR applications Apply OR to major policy issues Introduce interesting new problems areas Highlight education issues Document the history of military and national security OR.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信