메뉴 건너뛰기




Volumn 60, Issue 1, 2012, Pages 18-33

The planning of guaranteed targeted display advertising

Author keywords

Advertising; Aggregation; Guaranteed targeted display advertising; Planning

Indexed keywords

DELIVERY PERFORMANCE; DIGITAL TV; EFFICIENT ALGORITHM; FEASIBLE SOLUTION; FORECAST ERRORS; HIGH QUALITY; MEDIA VEHICLES; PLANNING MODELS; PLANNING PROBLEM; SPACE PARTITION; SUFFICIENT CONDITIONS; TARGETED ADVERTISING; TRANSPORTATION PROBLEM; VIDEO GAME; WEB-PAGE;

EID: 84859570161     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1110.0996     Document Type: Article
Times cited : (55)

References (43)
  • 2
    • 0242606641 scopus 로고    scopus 로고
    • Scheduling space-sharing for Internet advertising
    • Adler, M., P. B. Gibbons, Y. Matias. 2002. Scheduling space-sharing for Internet advertising. J. Scheduling 5(2) 103-119.
    • (2002) J. Scheduling , vol.5 , Issue.2 , pp. 103-119
    • Adler, M.1    Gibbons, P.B.2    Matias, Y.3
  • 6
    • 0021855437 scopus 로고
    • Aggregation bounds in stochastic linear programming
    • Birge, J. R. 1985. Aggregation bounds in stochastic linear programming. Math. Programming 31(1) 25-41.
    • (1985) Math. Programming , vol.31 , Issue.1 , pp. 25-41
    • Birge, J.R.1
  • 7
    • 33947521099 scopus 로고    scopus 로고
    • Nonstationary Poisson modeling of web browsing session arrivals
    • DOI 10.1016/j.ipl.2006.12.015, PII S0020019006003693
    • Chlebus, E., J. Brazier. 2007. Nonstationary Poisson modeling of Web browsing session arrivals. Inform. Processing Lett. 102(5) 187-190. (Pubitemid 46466779)
    • (2007) Information Processing Letters , vol.102 , Issue.5 , pp. 187-190
    • Chlebus, E.1    Brazier, J.2
  • 8
    • 79954572600 scopus 로고    scopus 로고
    • Advertising models
    • B. Wierenga, ed Springer Science+Business Media, LLC, New York
    • Danaher, P. 2010. Advertising models. B. Wierenga, ed. Handbook of Marketing Decision Models. Springer Science+Business Media, LLC, New York.
    • (2010) Handbook of Marketing Decision Models
    • Danaher, P.1
  • 9
    • 3543073492 scopus 로고    scopus 로고
    • Performance bounds of algorithms for scheduling advertisements on a Web page
    • Dawande, M., S. Kumar, C. Sriskandarajah. 2003. Performance bounds of algorithms for scheduling advertisements on a Web page. J. Scheduling 6(4) 373-394.
    • (2003) J. Scheduling , vol.6 , Issue.4 , pp. 373-394
    • Dawande, M.1    Kumar, S.2    Sriskandarajah, C.3
  • 10
    • 4344655421 scopus 로고    scopus 로고
    • Broadcast scheduling for mobile advertising
    • De Reyck, B., Z. Degraeve. 2003. Broadcast scheduling for mobile advertising. Oper. Res. 51(4) 509-517.
    • (2003) Oper. Res , vol.51 , Issue.4 , pp. 509-517
    • De Reyck, B.1    Degraeve, Z.2
  • 11
    • 35448949581 scopus 로고    scopus 로고
    • Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords
    • Edelman, B., M. Ostrovsky, M. Schwarz. 2007. Internet advertising and the generalized second-price auction: Selling billions of dollars worth of keywords. Amer. Econom. Rev. 97(1) 242-259.
    • (2007) Amer. Econom. Rev , vol.97 , Issue.1 , pp. 242-259
    • Edelman, B.1    Ostrovsky, M.2    Schwarz, M.3
  • 15
    • 79952353977 scopus 로고    scopus 로고
    • Interactive Advertising Bureau Accessed April 2011
    • Interactive Advertising Bureau. 2009. 2008 IAB Internet advertising revenue report. Accessed April 2011, http://www.iab.net/media/file/IAB-PwC-2008- full-year.pdf.
    • (2009) 2008 IAB Internet Advertising Revenue Report
  • 16
    • 33745017929 scopus 로고    scopus 로고
    • Scheduling advertisements on a web page to maximize revenue
    • DOI 10.1016/j.ejor.2005.07.005, PII S037722170500487X
    • Kumar, S., V. S. Jacob, C. Sriskandarajah. 2006. Scheduling advertisements on a Web page to maximize revenue. Eur. J. Oper. Res. 173(3) 1067-1089. (Pubitemid 43870319)
    • (2006) European Journal of Operational Research , vol.173 , Issue.3 , pp. 1067-1089
    • Kumar, S.1    Jacob, V.S.2    Sriskandarajah, C.3
  • 18
    • 0030782883 scopus 로고    scopus 로고
    • A posteriori error bounds in linear programming aggregation
    • Leisten, R. 1997. A posteriori error bounds in linear programming aggregation. Comput. Oper. Res. 24(1) 1-16.
    • (1997) Comput. Oper. Res , vol.24 , Issue.1 , pp. 1-16
    • Leisten, R.1
  • 20
    • 33747882696 scopus 로고    scopus 로고
    • Using error bounds to compare aggregated generalized transportation models
    • DOI 10.1007/s10479-006-0051-6, New Trends in Network Design
    • Litvinchev, I. S., S. Rangel. 2006. Using error bounds to compare aggregated generalized transportation models. Ann. Oper. Res. 146(1) 119-134. (Pubitemid 44290706)
    • (2006) Annals of Operations Research , vol.146 , Issue.1 , pp. 119-134
    • Litvinchev, I.S.1    Rangel, S.2
  • 21
    • 0035480074 scopus 로고    scopus 로고
    • Traffic model and performance evaluation of Web servers
    • DOI 10.1016/S0166-5316(01)00046-3, PII S0166531601000463
    • Liu, Z., N. Niclausse, C. Jalpa-Villanueva. 2001. Traffic model and performance evaluation of Web servers. Performance Eval. 46(2-3) 77-100. (Pubitemid 32768291)
    • (2001) Performance Evaluation , vol.46 , Issue.2-3 , pp. 77-100
    • Liu, Z.1    Niclausse, N.2    Jalpa-Villanueva, C.3
  • 22
    • 84859614543 scopus 로고    scopus 로고
    • Globe and Mail (June 28). Accessed December 2011
    • Mandel, C. 2007. Eye-catching glance at the future. Globe and Mail (June 28). Accessed December 2011, http://www.theglobeandmail.com/archives/eye- catching-glance-at-the-fuure/article767718/.
    • (2007) Eye-catching Glance at the Future
    • Mandel, C.1
  • 23
    • 35348964197 scopus 로고    scopus 로고
    • Adwords and generalized online matching
    • Article 22
    • Mehta, A., A. Saberi, U. Vazirani, V. Vazirani. 2007. Adwords and generalized online matching. J. ACM 54(5) Article 22.
    • (2007) J. ACM , vol.54 , Issue.5
    • Mehta, A.1    Saberi, A.2    Vazirani, U.3    Vazirani, V.4
  • 24
    • 3843136138 scopus 로고    scopus 로고
    • Scheduling banner advertisements on the web
    • DOI 10.1287/ijoc.1020.0003
    • Menon, S., A. Amiri. 2004. Scheduling banner advertisements on the Web. INFORMS J. Comput. 16(1) 95-105. (Pubitemid 39043212)
    • (2004) INFORMS Journal on Computing , vol.16 , Issue.1 , pp. 95-105
    • Menon, S.1    Amiri, A.2
  • 25
    • 27444435566 scopus 로고    scopus 로고
    • Improvements to the linear programming based scheduling of web advertisements
    • DOI 10.1023/B:ELEC.0000045974.88926.88
    • Nakamura, A., N. Abe. 2005. Improvements to the linear programming based scheduling of Web advertisements: World Wide Web electronic commerce, security and privacy. Electron. Commerce Res. 5(1) 75-98. (Pubitemid 41529724)
    • (2005) Electronic Commerce Research , vol.5 , Issue.1 , pp. 75-98
    • Nakamura, A.1    Abe, N.2
  • 26
    • 70349556570 scopus 로고    scopus 로고
    • Dynamic revenue management for online display advertising
    • Roels, G., K. Fridgeirsdottir. 2009. Dynamic revenue management for online display advertising. J. Revenue Pricing Management 8(5) 452-466.
    • (2009) J. Revenue Pricing Management , vol.8 , Issue.5 , pp. 452-466
    • Roels, G.1    Fridgeirsdottir, K.2
  • 27
    • 0000606094 scopus 로고
    • Aggregation and disaggregation techniques and methodology in optimization
    • Rogers, D. F., R. D. Plante, R. T. Wong, J. R. Evans. 1991. Aggregation and disaggregation techniques and methodology in optimization. Oper. Res. 39(4) 553-582.
    • (1991) Oper. Res , vol.39 , Issue.4 , pp. 553-582
    • Rogers, D.F.1    Plante, R.D.2    Wong, R.T.3    Evans, J.R.4
  • 31
    • 0033691223 scopus 로고    scopus 로고
    • An entropy approach to unintrusive targeted advertising on the Web
    • Tomlin, J. A. 2000. An entropy approach to unintrusive targeted advertising on the Web. Comput. Networks 33(1-6) 767-774.
    • (2000) Comput. Networks , vol.33 , Issue.1-6 , pp. 767-774
    • Tomlin, J.A.1
  • 33
    • 79952918126 scopus 로고    scopus 로고
    • Scheduling of dynamic ingame advertising
    • Turner, J., A. Scheller-Wolf, S. Tayur. 2011. Scheduling of dynamic ingame advertising. Oper. Res. 59(1) 1-16.
    • (2011) Oper. Res , vol.59 , Issue.1 , pp. 1-16
    • Turner, J.1    Scheller-Wolf, A.2    Tayur, S.3
  • 34
    • 0009566521 scopus 로고
    • Iterative aggregation: A new approach to the solution of large-scale problems
    • Vakhutinsky, I. Y., L. M. Dudkin, A. A. Ryvkin. 1979. Iterative aggregation: A new approach to the solution of large-scale problems. Econometrica 47(4) 821-841.
    • (1979) Econometrica , vol.47 , Issue.4 , pp. 821-841
    • Vakhutinsky, I.Y.1    Dudkin, L.M.2    Ryvkin, A.A.3
  • 36
    • 0007724010 scopus 로고
    • Primal-dual aggregation and disaggregation for stochastic linear programs
    • Wright, S. E. 1994. Primal-dual aggregation and disaggregation for stochastic linear programs. Math. Oper. Res. 19(4) 893-908.
    • (1994) Math. Oper. Res , vol.19 , Issue.4 , pp. 893-908
    • Wright, S.E.1
  • 39
    • 0009565919 scopus 로고
    • Bounds for aggregating nodes in network problems
    • Zipkin, P. H. 1980a. Bounds for aggregating nodes in network problems. Math. Programming 19(1) 155-177.
    • (1980) Math. Programming , vol.19 , Issue.1 , pp. 155-177
    • Zipkin, P.H.1
  • 40
    • 0019032977 scopus 로고
    • Bounds for row-aggregation in linear programming
    • Zipkin, P. H. 1980b. Bounds for row-aggregation in linear programming. Oper. Res. 28(4) 903-916.
    • (1980) Oper. Res , vol.28 , Issue.4 , pp. 903-916
    • Zipkin, P.H.1
  • 41
    • 0018998304 scopus 로고
    • Bounds on the effect of aggregating variables in linear programs
    • Zipkin, P. H. 1980c. Bounds on the effect of aggregating variables in linear programs. Oper. Res. 28(2) 403-418.
    • (1980) Oper. Res , vol.28 , Issue.2 , pp. 403-418
    • Zipkin, P.H.1
  • 42
    • 0020140573 scopus 로고
    • Aggregation and disaggregation in convex network problems
    • Zipkin, P. H. 1982. Aggregation and disaggregation in convex network problems. Networks 12(2) 101-117.
    • (1982) Networks , vol.12 , Issue.2 , pp. 101-117
    • Zipkin, P.H.1
  • 43
    • 0020765406 scopus 로고
    • Improved disaggregation method for transportation problems
    • Zipkin, P. H., K. Raimer. 1983. An improved disaggregation method for transportation problems. Math. Programming 26(2) 238-242. (Pubitemid 13587143)
    • (1983) Mathematical Programming , vol.26 , Issue.2 , pp. 238-242
    • Zipkin, P.1    Raimer, K.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.