{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T19:57:21Z","timestamp":1725479841783},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642366932"},{"type":"electronic","value":"9783642366949"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-36694-9_2","type":"book-chapter","created":{"date-parts":[[2013,3,11]],"date-time":"2013-03-11T06:08:39Z","timestamp":1362982119000},"page":"13-24","source":"Crossref","is-referenced-by-count":3,"title":["All-or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns"],"prefix":"10.1007","author":[{"given":"Ron","family":"Adany","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moran","family":"Feldman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elad","family":"Haramaty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rohit","family":"Khandekar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roy","family":"Schwartz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tami","family":"Tamir","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Adany, R., Feldman, M., Haramaty, E., Khandekar, R., Schieber, B., Schwartz, R., Shachnai, H., Tamir, T.: All-or-nothing generalized assignment with application to scheduling advertising campaigns (2012) Full version, \n                  \n                    http:\/\/www.cs.technion.ac.il\/~hadas\/PUB\/AGAP_full.pdf","DOI":"10.1007\/978-3-642-36694-9_2"},{"issue":"6","key":"2_CR2","doi-asserted-by":"publisher","first-page":"1740","DOI":"10.1137\/080733991","volume":"40","author":"G. Calinescu","year":"2011","unstructured":"Calinescu, G., Chekuri, C., P\u00e1l, M., Vondr\u00e1k, J.: Maximizing a submodular set function subject to a matroid constraint. SIAM J. on Computing\u00a040(6), 1740\u20131766 (2011)","journal-title":"SIAM J. on Computing"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/S0097539700382820","volume":"35","author":"C. Chekuri","year":"2006","unstructured":"Chekuri, C., Khanna, S.: A PTAS for the multiple knapsack problem. SIAM J. on Computing\u00a035(3), 713\u2013728 (2006)","journal-title":"SIAM J. on Computing"},{"key":"2_CR4","unstructured":"Dureau, V.: Addressable advertising on digital television. In: Proceedings of the 2nd European Conference on Interactive Television: Enhancing the Experience, Brighton, UK (March-April 2004)"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Feige, U., Vondr\u00e1k, J.: Approximation algorithms for allocation problems: Improving the factor of 1-1\/e. In: FOCS, pp. 667\u2013676 (2006)","DOI":"10.1109\/FOCS.2006.14"},{"key":"2_CR6","unstructured":"Google AdWords, \n                  \n                    http:\/\/adwords.google.com"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1207\/s15327736me1901_4","volume":"19","author":"E.M. Kim","year":"2006","unstructured":"Kim, E.M., Wildman, S.S.: A deeper look at the economics of advertiser support for television: the implications of consumption-differentiated viewers and ad addressability. J. of Media Economics\u00a019, 55\u201379 (2006)","journal-title":"J. of Media Economics"},{"key":"2_CR8","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. To appear in Mathematics of Operations Research"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Kulik, A., Shachnai, H., Tamir, T.: Maximizing submodular set functions subject to multiple linear constraints. In: SODA, pp. 545\u2013554 (2009)","DOI":"10.1137\/1.9781611973068.60"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Kundakcioglu, O.E., Alizamir, S.: Generalized assignment problem. In: Floudas, C.A., Pardalos, P.M. (eds.) Encyclopedia of Optimization, pp. 1153\u20131162. Springer (2009)","DOI":"10.1007\/978-0-387-74759-0_200"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"G. Nemhauser","year":"1978","unstructured":"Nemhauser, G., Wolsey, L., Fisher, M.: An analysis of the approximations for maximizing submodular set functions. Math. Programming\u00a014, 265\u2013294 (1978)","journal-title":"Math. Programming"},{"key":"2_CR12","unstructured":"Nielsen Media Research. Advertising fact sheet. blog.nielsen.com (September 2010)"},{"key":"2_CR13","unstructured":"Nielsen Media Research. The cross-platform report, quarter 1, 2012 \u2013 US. blog.nielsen.com (May 2012)"},{"key":"2_CR14","unstructured":"Nielsen Media Research. Nielsen\u2019s quarterly global adview pulse report. blog.nielsen.com (April 2012)"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/j.orl.2005.05.006","volume":"34","author":"Z. Nutov","year":"2006","unstructured":"Nutov, Z., Beniaminy, I., Yuster, R.: A (1-1\/e)-approximation algorithm for the generalized assignment problem. Operations Research Letters\u00a034(3), 283\u2013288 (2006)","journal-title":"Operations Research Letters"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1287\/mnsc.44.12.S271","volume":"44","author":"J. Park","year":"1998","unstructured":"Park, J., Lim, B., Lee, Y.: A Lagrangian dual-based branch-and-bound algorithm for the generalized multi-assignment problem. Management Science\u00a044, 271\u2013282 (1998)","journal-title":"Management Science"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/10196780151105348","volume":"11","author":"K. Pramataris","year":"2001","unstructured":"Pramataris, K., Papakyriakopoulos, D., Lekakos, G., Mulonopoulos, N.: Personalized Interactive TV Advertising: The iMEDIA Business Model. Electronic Markets\u00a011, 1\u20139 (2001)","journal-title":"Electronic Markets"},{"issue":"1","key":"2_CR18","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/BF01585178","volume":"62","author":"D. Shmoys","year":"1993","unstructured":"Shmoys, D., Tardos, \u00c9.: An approximation algorithm for the generalized assignment problem. Mathematical Programming\u00a062(1), 461\u2013474 (1993)","journal-title":"Mathematical Programming"},{"key":"2_CR19","unstructured":"SintecMedia - On Air, \n                  \n                    http:\/\/www.sintecmedia.com\/OnAir.html"},{"key":"2_CR20","unstructured":"The Interactive Advertising Bureau (IAB), \n                  \n                    http:\/\/iab.net"},{"key":"2_CR21","unstructured":"Young, C.: Why TV spot length matters. Admap\u00a0(497), 45\u201348 (2008)"}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-36694-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T13:47:36Z","timestamp":1557582456000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-36694-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642366932","9783642366949"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-36694-9_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}