A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising

This paper focuses on a multiobjective optimization problem in TV advertising from an advertising agency's perspective, which involves deciding on which commercial breaks to air the ads of various brands to jointly maximize reach or gross rating point (GRP) for the different brands subject to b...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International transactions in operational research Jg. 27; H. 3; S. 1664 - 1698
Hauptverfasser: Evangelista, Vivian M., Regis, Rommel G.
Format: Journal Article
Sprache:Englisch
Veröffentlicht: Oxford Blackwell Publishing Ltd 01.05.2020
Schlagworte:
ISSN:0969-6016, 1475-3995
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract This paper focuses on a multiobjective optimization problem in TV advertising from an advertising agency's perspective, which involves deciding on which commercial breaks to air the ads of various brands to jointly maximize reach or gross rating point (GRP) for the different brands subject to budget constraints, brand competition constraints, and other scheduling constraints. We present a multiobjective integer programming formulation of this problem and develop and implement algorithms for generating provably Pareto‐optimal solutions. We also develop reduction and visualization procedures to aid a decision maker in choosing suitable subsets of the Pareto‐optimal solutions obtained. Numerical experiments on five TV advertising problems involving 20–40 objective functions and thousands of decision variables and constraints demonstrate the effectiveness of the proposed formulation and solution methods in generating Pareto‐optimal objective vectors that reflect brand priorities and that are well distributed along the Pareto front.
AbstractList This paper focuses on a multiobjective optimization problem in TV advertising from an advertising agency's perspective, which involves deciding on which commercial breaks to air the ads of various brands to jointly maximize reach or gross rating point (GRP) for the different brands subject to budget constraints, brand competition constraints, and other scheduling constraints. We present a multiobjective integer programming formulation of this problem and develop and implement algorithms for generating provably Pareto‐optimal solutions. We also develop reduction and visualization procedures to aid a decision maker in choosing suitable subsets of the Pareto‐optimal solutions obtained. Numerical experiments on five TV advertising problems involving 20–40 objective functions and thousands of decision variables and constraints demonstrate the effectiveness of the proposed formulation and solution methods in generating Pareto‐optimal objective vectors that reflect brand priorities and that are well distributed along the Pareto front.
Author Regis, Rommel G.
Evangelista, Vivian M.
Author_xml – sequence: 1
  givenname: Vivian M.
  surname: Evangelista
  fullname: Evangelista, Vivian M.
  email: vevangel@sju.edu
  organization: Saint Joseph's University
– sequence: 2
  givenname: Rommel G.
  surname: Regis
  fullname: Regis, Rommel G.
  email: rregis@sju.edu
  organization: Saint Joseph's University
BookMark eNp9kE1LAzEQhoNUsK1e_AUBb8LWyX5mj6VoLRQqpXoN2XzYlG22ZtNq_fWmricRB4aBmeedSd4B6tnGKoSuCYxIiDvjGzcicUrJGeqTtMiipCyzHupDmZdRDiS_QIO23QAAyUjRR2yMt_vam6baKOHNQWG-27mGizXWjcNb_mG25tPYV-zXCjt1GoT-dPmEG42l0Vo5ZT2uHLeyxcbi1Qvm8qCcN22QXaJzzetWXf3UIXp-uF9NHqP5YjqbjOeRSICQKCNAC51QqCTVJY0pBZ1JzoEKmldSaiBJqtJM5Ao4FDKv4jxJpaiyQiZFyCG66faGx7_tVevZptk7G06yOIlpnOVhZaCgo4Rr2tYpzYTxPPzeesdNzQiwk43sZCP7tjFIbn9Jds5suTv-DZMOfje1Ov5Dstlqsew0X6DqhY4
CitedBy_id crossref_primary_10_32604_cmc_2024_058656
Cites_doi 10.1080/00207543.2014.951095
10.1016/S0096-3003(02)00853-6
10.1016/j.amc.2005.01.038
10.1287/mnsc.19.8.936
10.1016/0377-2217(84)90056-0
10.1177/002224376500200113
10.1002/nav.3800290202
10.1016/0377-2217(82)90182-5
10.1111/j.1540-5915.1979.tb00004.x
10.1016/j.ejor.2007.09.039
10.1016/j.ejor.2008.10.023
10.1016/S0377-2217(03)00255-8
10.1016/0377-2217(83)90157-1
10.1109/TEVC.2013.2240687
10.1287/opre.1030.0083
10.1016/j.amc.2013.03.002
10.1109/4235.996017
10.1111/itor.12137
10.1017/CBO9780511921735
10.1007/s10898-012-9955-7
10.1109/TSMCC.2007.900651
10.1287/mnsc.29.12.1444
10.1287/mnsc.2015.2185
10.1007/BF01588256
10.1016/j.acme.2015.05.001
10.1016/j.ejor.2006.02.033
10.1007/BF01584241
10.1016/0305-0548(74)90064-1
10.1007/s11042-013-1691-6
10.1007/s00530-012-0284-y
10.1007/BF01584332
10.1007/BFb0056872
ContentType Journal Article
Copyright 2017 The Authors. International Transactions in Operational Research © 2017 International Federation of Operational Research Societies
2020 The Authors.
Copyright_xml – notice: 2017 The Authors. International Transactions in Operational Research © 2017 International Federation of Operational Research Societies
– notice: 2020 The Authors.
DBID AAYXX
CITATION
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
DOI 10.1111/itor.12481
DatabaseName CrossRef
Computer and Information Systems Abstracts
Mechanical & Transportation Engineering Abstracts
Technology Research Database
Engineering Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Mechanical & Transportation Engineering Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
DatabaseTitleList CrossRef

Technology Research Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
Business
EISSN 1475-3995
EndPage 1698
ExternalDocumentID 10_1111_itor_12481
ITOR12481
Genre article
GroupedDBID --K
.3N
.GA
.Y3
05W
0R~
10A
1B1
1OC
1XV
29J
31~
33P
4.4
50Y
50Z
51W
51Y
52M
52O
52Q
52S
52T
52U
52W
5GY
5HH
5LA
5VS
66C
702
7PT
8-0
8-1
8-3
8-4
8-5
8UM
8VB
930
A04
AABNI
AAEDT
AAESR
AAHHS
AAHQN
AALRI
AAMNL
AANHP
AAONW
AAOUF
AAQFI
AAQXK
AASGY
AAXRX
AAXUO
AAYCA
AAZKR
ABCQN
ABCUV
ABEML
ABJNI
ABPVW
ABSOO
ABWVN
ACAHQ
ACBKW
ACBWZ
ACCFJ
ACCZN
ACGFS
ACHQT
ACIWK
ACPOU
ACRPL
ACSCC
ACXQS
ACYXJ
ADBBV
ADEMA
ADEOM
ADIZJ
ADKYN
ADMGS
ADMUD
ADNMO
ADXAS
ADZMN
ADZOD
AEEZP
AEIGN
AEIMD
AEMOZ
AENEX
AEQDE
AEUQT
AEUYR
AFBPY
AFEBI
AFFPM
AFGKR
AFKFF
AFPWT
AFWVQ
AFYRF
AFZJQ
AHBTC
AHQJS
AIFKG
AIURR
AIWBW
AJBDE
AKVCP
ALAGY
ALMA_UNASSIGNED_HOLDINGS
ALUQN
ALVPJ
AMBMR
AMYDB
ASPBG
ASTYK
AVWKF
AZBYB
AZFZN
AZVAB
BAFTC
BDRZF
BFHJK
BMXJE
BNVMJ
BQESF
BROTX
BRXPI
BY8
CAG
COF
CS3
D-C
D-D
DCZOG
DPXWK
DR2
DRFUL
DRSSH
DU5
EBA
EBO
EBR
EBS
EBU
EJD
EMK
F00
F01
F5P
FDB
FEDTE
FGOYB
FIRID
G-S
G.N
G50
GODZA
HGLYW
HVGLF
HZI
HZ~
I-F
IHE
IX1
J0M
K1G
K48
LATKE
LC2
LC4
LEEKS
LG8
LH4
LITHE
LOXES
LP6
LP7
LUTES
LW6
LYRES
M41
MEWTI
MK4
MRFUL
MRSSH
MSFUL
MSSSH
MXFUL
MXSSH
N04
N06
N9A
NF~
NQ-
O66
O9-
OIG
P2P
P2W
P2Y
P4C
PQQKQ
Q.N
Q11
QB0
QWB
R.K
R2-
RIG
ROL
RPZ
RX1
SEW
SUPJJ
TH9
UB1
UHS
W8V
W99
WBKPD
WEBCB
WIH
WII
WOHZO
WQZ
WRC
WSUWO
WXSBR
XG1
ZL0
ZZTAW
~IA
~WP
9DU
AAMMB
AAYXX
ACVFH
ADCNI
AEFGJ
AEUPX
AEYWJ
AFPUW
AGHNM
AGQPQ
AGXDD
AIDQK
AIDYY
AMVHM
CITATION
O8X
7SC
7TB
8FD
FR3
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c3011-51087f380bd8f982880f5daa08c86bddf0134e45c6e0a07d6b2634dcb57d377d3
IEDL.DBID DRFUL
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000522633500016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0969-6016
IngestDate Fri Jul 25 22:32:02 EDT 2025
Sat Nov 29 06:31:34 EST 2025
Tue Nov 18 22:01:33 EST 2025
Wed Jan 22 16:40:31 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 3
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3011-51087f380bd8f982880f5daa08c86bddf0134e45c6e0a07d6b2634dcb57d377d3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2328256880
PQPubID 45259
PageCount 35
ParticipantIDs proquest_journals_2328256880
crossref_citationtrail_10_1111_itor_12481
crossref_primary_10_1111_itor_12481
wiley_primary_10_1111_itor_12481_ITOR12481
PublicationCentury 2000
PublicationDate May 2020
2020-05-00
20200501
PublicationDateYYYYMMDD 2020-05-01
PublicationDate_xml – month: 05
  year: 2020
  text: May 2020
PublicationDecade 2020
PublicationPlace Oxford
PublicationPlace_xml – name: Oxford
PublicationTitle International transactions in operational research
PublicationYear 2020
Publisher Blackwell Publishing Ltd
Publisher_xml – name: Blackwell Publishing Ltd
References 1979; 17
2015; 15
2005; 171
2004; 148
2011; 2
2012
2011
2015; 53
2002; 6
2015; 74
1973; 19
1998
2009; 199
1974; 1
1995
1979; 10
1981; 21
2016; 12
2007; 37
1983; 12
1999
2013; 19
1965; 2
2004; 52
1982; 29
2004; 158
2001
2013; 219
1990
1984; 15
2009; 192
2013; 57
2015; 22
1982; 9
2016; 62
2016
2007; 180
1977; 13
2014; 18
1983; 29
e_1_2_8_28_1
e_1_2_8_29_1
e_1_2_8_24_1
e_1_2_8_26_1
e_1_2_8_27_1
Saaty L. (e_1_2_8_30_1) 1990
Currie J. (e_1_2_8_12_1) 2012
Miettinen K. (e_1_2_8_25_1) 1999
Solomon M. (e_1_2_8_33_1) 2012
e_1_2_8_3_1
e_1_2_8_5_1
e_1_2_8_4_1
e_1_2_8_7_1
e_1_2_8_6_1
e_1_2_8_9_1
e_1_2_8_8_1
e_1_2_8_20_1
e_1_2_8_43_1
e_1_2_8_21_1
e_1_2_8_42_1
e_1_2_8_22_1
e_1_2_8_23_1
Schott J.R. (e_1_2_8_31_1) 1995
e_1_2_8_41_1
e_1_2_8_40_1
Adany R. (e_1_2_8_2_1) 2016; 12
e_1_2_8_17_1
e_1_2_8_18_1
e_1_2_8_39_1
e_1_2_8_19_1
e_1_2_8_13_1
e_1_2_8_36_1
e_1_2_8_14_1
e_1_2_8_35_1
e_1_2_8_15_1
e_1_2_8_38_1
e_1_2_8_16_1
e_1_2_8_37_1
e_1_2_8_32_1
e_1_2_8_10_1
e_1_2_8_11_1
e_1_2_8_34_1
References_xml – volume: 13
  start-page: 121
  issue: 1
  year: 1977
  end-page: 139
  article-title: Linear multiple objective programs with zero–one variables
  publication-title: Mathematical Programming
– volume: 12
  start-page: 38:1
  issue: 3
  year: 2016
  end-page: 38:25
  article-title: All‐or‐nothing generalized assignment with application to scheduling advertising campaigns
  publication-title: ACM Transaction on Algorithms
– volume: 10
  start-page: 26
  issue: 1
  year: 1979
  end-page: 38
  article-title: Multicriteria optimization: a general characterization of efficient solutions
  publication-title: Decision Sciences
– volume: 158
  start-page: 46
  issue: 1
  year: 2004
  end-page: 55
  article-title: A method for finding the set of non‐dominated vectors for multiple objective integer linear programs
  publication-title: European Journal of Operational Research
– volume: 2
  start-page: 83
  issue: 1
  year: 1965
  end-page: 88
  article-title: Media selection by linear programming
  publication-title: Journal of Marketing Research
– volume: 21
  start-page: 204
  issue: 1
  year: 1981
  end-page: 223
  article-title: Multicriteria integer programming: a (hybrid) dynamic programming recursive approach
  publication-title: Mathematical Programming
– volume: 6
  start-page: 182
  issue: 2
  year: 2002
  end-page: 197
  article-title: A fast and elitist multi‐objective genetic algorithm: NSGA‐II
  publication-title: IEEE Transactions on Evolutionary Computation
– volume: 17
  start-page: 362
  issue: 1
  year: 1979
  end-page: 390
  article-title: Theory and algorithms for linear multiple objective programs with zero–one variables
  publication-title: Mathematical Programming
– volume: 219
  start-page: 9652
  issue: 18
  year: 2013
  end-page: 9669
  article-title: An improved version of the augmented ε‐constraint method (augmecon2) for finding the exact Pareto set in multi‐objective integer programming problems
  publication-title: Applied Mathematics and Computation
– volume: 57
  start-page: 347
  issue: 2
  year: 2013
  end-page: 365
  article-title: Finding all nondominated points of multi‐objective integer programs
  publication-title: Journal of Global Optimization
– year: 2016
– year: 1990
– volume: 52
  start-page: 337
  issue: 3
  year: 2004
  end-page: 345
  article-title: Scheduling commercials on broadcast television
  publication-title: Operations Research
– volume: 12
  start-page: 362
  issue: 4
  year: 1983
  end-page: 374
  article-title: Solving zero‐one multiple objective programs through implicit enumeration
  publication-title: European Journal of Operational Research
– volume: 15
  start-page: 126
  issue: 1
  year: 1984
  end-page: 130
  article-title: A branch and bound method for multi‐objective boolean problems
  publication-title: European Journal of Operational Research
– year: 2012
– volume: 22
  start-page: 563
  issue: 3
  year: 2015
  end-page: 584
  article-title: Non‐dominated “trade‐off” solutions in television scheduling optimization
  publication-title: International Transactions in Operational Research
– volume: 2
  year: 2011
– volume: 192
  start-page: 382
  issue: 2
  year: 2009
  end-page: 395
  article-title: A chance constraints goal programming model for the advertising planning problem
  publication-title: European Journal of Operational Research
– year: 2011
  publication-title: The Design of Approximation Algorithms
– volume: 9
  start-page: 378
  issue: 4
  year: 1982
  end-page: 385
  article-title: An algorithm for the multiple objective integer linear programming problem
  publication-title: European Journal of Operational Research
– volume: 62
  start-page: 1145
  issue: 4
  year: 2016
  end-page: 1164
  article-title: Ad revenue optimization in live broadcasting
  publication-title: Management Science
– volume: 29
  start-page: 1444
  issue: 12
  year: 1983
  end-page: 1453
  article-title: An algorithm for multiobjective zero‐one linear programming
  publication-title: Management Science
– volume: 180
  start-page: 99
  issue: 1
  year: 2007
  end-page: 115
  article-title: A review of interactive methods for multiobjective integer and mixed‐integer programming
  publication-title: European Journal of Operational Research
– volume: 171
  start-page: 53
  issue: 1
  year: 2005
  end-page: 71
  article-title: Multi‐criteria branch and bound: a vector maximization algorithm for mixed 0‐1 multiple objective linear programming
  publication-title: Applied Mathematics and Computation
– year: 1999
  publication-title: Nonlinear Multiobjective Optimization
– start-page: 292
  year: 1998
  end-page: 304
– volume: 18
  start-page: 131
  issue: 1
  year: 2014
  end-page: 144
  article-title: Performance metric ensemble for multiobjective evolutionary algorithms
  publication-title: IEEE Transactions on Evolutionary Computation
– volume: 37
  start-page: 1190
  issue: 6
  year: 2007
  end-page: 1201
  article-title: Optimal advertising campaign generation for multiple brands using MOGA
  publication-title: IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews)
– year: 1995
– volume: 15
  start-page: 1024
  issue: 4
  year: 2015
  end-page: 1036
  article-title: A cognitive approach for the multi‐objective optimization of RC structural problems
  publication-title: Archives of Civil and Mechanical Engineering
– volume: 53
  start-page: 1198
  issue: 4
  year: 2015
  end-page: 1215
  article-title: Scheduling commercial advertisements for television
  publication-title: International Journal of Production Research
– volume: 74
  start-page: 8801
  issue: 20
  year: 2015
  end-page: 8819
  article-title: Personalized advertisement system using social relationship based user modeling
  publication-title: Multimedia Tools and Applications
– volume: 1
  start-page: 479
  issue: 3
  year: 1974
  end-page: 496
  article-title: A concept of compromise solutions and the method of the displaced ideal
  publication-title: Computers & Operations Research
– volume: 29
  start-page: 181
  issue: 2
  year: 1982
  end-page: 201
  article-title: A combined approach to solve binary multicriteria problems
  publication-title: Naval Research Logistics Quarterly
– volume: 148
  start-page: 373
  issue: 2
  year: 2004
  end-page: 379
  article-title: A mathematical programming study of advertising allocation problem
  publication-title: Applied Mathematics and Computation
– volume: 19
  start-page: 936
  issue: 8
  year: 1973
  end-page: 946
  article-title: A class of solutions for group decision problems
  publication-title: Management Science
– volume: 19
  start-page: 79
  issue: 2
  year: 2013
  end-page: 93
  article-title: Allocation algorithms for personal TV advertisements
  publication-title: Multimedia Systems
– start-page: 1025
  year: 2001
  end-page: 1031
– volume: 199
  start-page: 25
  issue: 1
  year: 2009
  end-page: 35
  article-title: Multi‐objective integer programming: a general approach for generating all non‐dominated solutions
  publication-title: European Journal of Operational Research
– ident: e_1_2_8_16_1
  doi: 10.1080/00207543.2014.951095
– ident: e_1_2_8_26_1
  doi: 10.1016/S0096-3003(02)00853-6
– year: 1999
  ident: e_1_2_8_25_1
  publication-title: Nonlinear Multiobjective Optimization
– ident: e_1_2_8_23_1
  doi: 10.1016/j.amc.2005.01.038
– ident: e_1_2_8_41_1
  doi: 10.1287/mnsc.19.8.936
– volume: 12
  start-page: 38:1
  issue: 3
  year: 2016
  ident: e_1_2_8_2_1
  article-title: All‐or‐nothing generalized assignment with application to scheduling advertising campaigns
  publication-title: ACM Transaction on Algorithms
– ident: e_1_2_8_37_1
  doi: 10.1016/0377-2217(84)90056-0
– ident: e_1_2_8_11_1
  doi: 10.1177/002224376500200113
– ident: e_1_2_8_22_1
– volume-title: Marketing: Real People, Real Choices
  year: 2012
  ident: e_1_2_8_33_1
– ident: e_1_2_8_8_1
  doi: 10.1002/nav.3800290202
– ident: e_1_2_8_19_1
  doi: 10.1016/0377-2217(82)90182-5
– ident: e_1_2_8_32_1
  doi: 10.1111/j.1540-5915.1979.tb00004.x
– ident: e_1_2_8_5_1
  doi: 10.1016/j.ejor.2007.09.039
– ident: e_1_2_8_27_1
  doi: 10.1016/j.ejor.2008.10.023
– ident: e_1_2_8_35_1
  doi: 10.1016/S0377-2217(03)00255-8
– ident: e_1_2_8_14_1
  doi: 10.1016/0377-2217(83)90157-1
– ident: e_1_2_8_39_1
  doi: 10.1109/TEVC.2013.2240687
– ident: e_1_2_8_9_1
  doi: 10.1287/opre.1030.0083
– ident: e_1_2_8_24_1
  doi: 10.1016/j.amc.2013.03.002
– volume-title: The Analytic Hierarchy Process
  year: 1990
  ident: e_1_2_8_30_1
– ident: e_1_2_8_13_1
  doi: 10.1109/4235.996017
– ident: e_1_2_8_21_1
  doi: 10.1111/itor.12137
– ident: e_1_2_8_38_1
  doi: 10.1017/CBO9780511921735
– ident: e_1_2_8_10_1
– ident: e_1_2_8_20_1
  doi: 10.1007/s10898-012-9955-7
– ident: e_1_2_8_15_1
  doi: 10.1109/TSMCC.2007.900651
– ident: e_1_2_8_18_1
  doi: 10.1287/mnsc.29.12.1444
– ident: e_1_2_8_28_1
  doi: 10.1287/mnsc.2015.2185
– ident: e_1_2_8_7_1
  doi: 10.1007/BF01588256
– ident: e_1_2_8_40_1
  doi: 10.1016/j.acme.2015.05.001
– ident: e_1_2_8_4_1
  doi: 10.1016/j.ejor.2006.02.033
– ident: e_1_2_8_36_1
  doi: 10.1007/BF01584241
– ident: e_1_2_8_29_1
– ident: e_1_2_8_42_1
  doi: 10.1016/0305-0548(74)90064-1
– ident: e_1_2_8_17_1
  doi: 10.1007/s11042-013-1691-6
– volume-title: Fault tolerant design using single and multicriteria genetic algorithm optimization
  year: 1995
  ident: e_1_2_8_31_1
– ident: e_1_2_8_3_1
  doi: 10.1007/s00530-012-0284-y
– ident: e_1_2_8_6_1
  doi: 10.1007/BF01584332
– volume-title: Foundations of Computer‐Aided Process Operations
  year: 2012
  ident: e_1_2_8_12_1
– ident: e_1_2_8_34_1
– ident: e_1_2_8_43_1
  doi: 10.1007/BFb0056872
SSID ssj0001517
Score 2.151379
Snippet This paper focuses on a multiobjective optimization problem in TV advertising from an advertising agency's perspective, which involves deciding on which...
SourceID proquest
crossref
wiley
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 1664
SubjectTerms Advertising
Algorithms
Decision making
gross rating point
Integer programming
multiobjective optimization
Multiple objective analysis
Operations research
Optimal advertising
Optimization
Pareto optimum
Pareto‐optimal
reach
Television advertising
Title A multiobjective approach for maximizing the reach or GRP of different brands in TV advertising
URI https://onlinelibrary.wiley.com/doi/abs/10.1111%2Fitor.12481
https://www.proquest.com/docview/2328256880
Volume 27
WOSCitedRecordID wos000522633500016&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVWIB
  databaseName: Wiley Online Library Full Collection 2020
  customDbUrl:
  eissn: 1475-3995
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0001517
  issn: 0969-6016
  databaseCode: DRFUL
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://onlinelibrary.wiley.com
  providerName: Wiley-Blackwell
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED-GE9EHp1NxOiWgLwqVbm3TBHwZ6lSQOcYmeyv5aGHiOtmmiH-9l6zdJoggPhRKey1pkt_d78p9AJwyzvCW5o4MQ-74lLmOUCx2eCJ9w2BrCCnbbCJstVi_z9sFuMxzYWb1IeY_3AwyrL42ABdysgRy3PDjC7ROJu-6aLKq0PUqXneavYe5JkZrZtOlOeWOKTuSlSc1kTyLp78bpAXLXOaq1tg0S_8b5hZsZiSTNGa7YhsKcVqGtTzGvQylvJcDyaBdho2lwoQ7EDWIjTQcyeeZQiR57XGCJJcMxcdgOPhEUYL8kYxNRCbB67edNhklJG-6MiU48FRPyCAl3Scist7P-Ngu9Jo33as7J2vF4CijARxELgsTj7lSs4Sjl8bcJNBCuEwxKrVOkEn6sR8oGrvCDTWVder5Wskg1F6Ixx6spKM03gfCZMyVy_xEC3QNuS99HdQoDbyQx1JxUYGzfD0ildUpN-0yXqLcXzFTGtkprcDJXPZ1Vp3jR6lqvqxRhtBJhEwSnWOKH1KBc7uAv7whuu8-duzZwV-ED2G9btxzGx9ZhZXp-C0-glX1jnM9Ps526xfAUu6T
linkProvider Wiley-Blackwell
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3rS8MwED9kio8PPqbifAb0i0Kls2keH0WdinPKmOK30iQtTLST-UD8671k6ZwggvihUNpLSZP87n4XLncAO0IKfGVkoDiXAWUiDFItskDmiloGW0dIuWITvNUSd3fy2sfm2LMwg_wQww03iwynry3A7Yb0CMpxxff30TzZg9fjlEVcVGD8uN24aQ5VMZozd15aMhnYvCM-P6kN5flq_d0ifdHMUbLqrE1j7p_9nIdZTzPJ4WBdLMBYVlRhsoxyr8JcWc2BeHBXYWYkNeEiJIfExRr21P1AJZIy-zhBmkse0_fuY_cDRQkySNK3MZkEn5-2r0kvJ2XZlReCPS_MM-kWpHNLUl_9GZstwU3jpHN0FvhiDIG2OiBA7AqeRyJURuQS_TQR5rFJ01BowZQxOXJJmtFYsyxMQ26YOmARNVrF3EQcr2WoFL0iWwEiVCZ1KGhuUnQOJVXUxHXG4ojLTGmZ1mC3nJBE-0zltmDGQ1J6LHZIEzekNdgeyj4N8nP8KLVezmviMfqcIJdE95jhj9Rgz83gL19IzjtXbXe3-hfhLZg661w2k-Z562INpg-ss-6iJdeh8tJ_zTZgQr_huPc3_dL9BAlf8oM
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3dS8MwED9kiuiD06k4PwP6olDptjRNHsU5FWWOMcW30nwUJq6T-YH413vJ0jlBBPGhUNpLSZP87n4XLncAB1xwfKVFIONYBJTxMEgVN4HIJLUMtoaQcsUm4nab39-Ljo_NsWdhxvkhJhtuFhlOX1uAmyedTaEcV_zoGM2TPXg9SyMR0RLMNrut2-uJKkZz5s5LCyYCm3fE5ye1oTxfrb9bpC-aOU1WnbVplf_Zz2VY8jSTnIzXxQrMmLwC80WUewXKRTUH4sFdgcWp1ISrkJwQF2s4lA9jlUiK7OMEaS4ZpO_9Qf8DRQkySDKyMZkEn593O2SYkaLsygvBnuf6mfRz0rsjqa_-jM3W4LZ11ju9CHwxhkBZHRAgdnmcNXgoNc8E-mk8zCKdpiFXnEmtM-SS1NBIMROmYayZrLMG1UpGsW7EeK1DKR_mZgMIl0aokNNMp-gcCiqpjmqMRY1YGKlEWoXDYkIS5TOV24IZj0nhsdghTdyQVmF_Ivs0zs_xo9R2Ma-Jx-hzglwS3WOGP1KFIzeDv3whuezddN3d5l-E92C-02wl15ftqy1YqFtf3QVLbkPpZfRqdmBOveGwj3b9yv0EqKHx_g
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+multiobjective+approach+for+maximizing+the+reach+or+GRP+of+different+brands+in+TV+advertising&rft.jtitle=International+transactions+in+operational+research&rft.au=Evangelista%2C+Vivian+M.&rft.au=Regis%2C+Rommel+G.&rft.date=2020-05-01&rft.issn=0969-6016&rft.eissn=1475-3995&rft.volume=27&rft.issue=3&rft.spage=1664&rft.epage=1698&rft_id=info:doi/10.1111%2Fitor.12481&rft.externalDBID=10.1111%252Fitor.12481&rft.externalDocID=ITOR12481
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0969-6016&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0969-6016&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0969-6016&client=summon