{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,4]],"date-time":"2025-10-04T08:04:20Z","timestamp":1759565060686,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319175089"},{"type":"electronic","value":"9783319175096"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-17509-6_17","type":"book-chapter","created":{"date-parts":[[2015,4,16]],"date-time":"2015-04-16T08:45:53Z","timestamp":1429173953000},"page":"251-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Quadratic Knapsack Model for Optimizing the Media Mix of a Promotional Campaign"],"prefix":"10.1007","author":[{"given":"Ulrich","family":"Pferschy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joachim","family":"Schauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhild","family":"Maier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,17]]},"reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.ijindorg.2003.10.002","volume":"22","author":"R F\u00e4re","year":"2004","unstructured":"F\u00e4re, R., Grosskopf, S., Seldon, B., Tremblay, V.: Advertising efficiency and the choice of media mix: a case of beer. Int. J. Ind. Organ. 22, 503\u2013522 (2004)","journal-title":"Int. J. Ind. Organ."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"416","DOI":"10.2501\/S0021849910091567","volume":"50","author":"A Reynar","year":"2010","unstructured":"Reynar, A., Phillips, J., Heumann, S.: New technologies drive CPG media mix optimization. J. Advertising Res. 50, 416\u2013427 (2010)","journal-title":"J. Advertising Res."},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1287\/mnsc.21.2.160","volume":"21","author":"V Balachandran","year":"1974","unstructured":"Balachandran, V., Gensch, D.: Solving the \u201cmarketing mix\u201d problem using geometric programming. Manage. Sci. 21, 160\u2013171 (1974)","journal-title":"Manage. Sci."},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/s11590-010-0220-z","volume":"5","author":"A Sorato","year":"2011","unstructured":"Sorato, A., Viscolani, B.: Using several advertising media in a homogeneous market. Optim. Lett. 5, 557\u2013573 (2011)","journal-title":"Optim. Lett."},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1016\/j.ejor.2010.10.019","volume":"210","author":"F Nobibon","year":"2011","unstructured":"Nobibon, F., Leus, R., Spieksma, F.: Optimization models for targeted offers in direct marketing: exact and heuristic algorithms. Eur. J. Oper. Res. 210, 670\u2013683 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.ijresmar.2012.03.001","volume":"29","author":"A S\u00f6nke","year":"2012","unstructured":"S\u00f6nke, A.: Optimizable and implementable aggregate response modeling for marketing decision support. Int. J. Res. Mark. 29, 111\u2013122 (2012)","journal-title":"Int. J. Res. Mark."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"26","DOI":"10.2307\/1251999","volume":"63","author":"D Vakratsas","year":"1999","unstructured":"Vakratsas, D., Ambler, T.: How advertising works: what do we really know? J. Mark. 63, 26\u201343 (1999)","journal-title":"J. Mark."},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.2753\/JOA0091-3367390303","volume":"39","author":"A Pergelova","year":"2010","unstructured":"Pergelova, A., Prior, D., Rialp, J.: Assessing advertising efficiency: does the internet play a role? J. Advertising 39, 39\u201354 (2010)","journal-title":"J. Advertising"},{"key":"17_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem - a survey. Discrete Appl. Math. 155, 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"key":"17_CR11","doi-asserted-by":"publisher","DOI":"10.1002\/9780470977811","volume-title":"Cluster Analysis","author":"B Everitt","year":"2011","unstructured":"Everitt, B., Landau, S., Leese, M., Stahl, D.: Cluster Analysis, 5th edn. Wiley, New York (2011)","edition":"5"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1016\/j.eswa.2005.07.014","volume":"30","author":"H Guldemir","year":"2006","unstructured":"Guldemir, H., Sengur, A.: Comparison of clustering algorithms for analog modulation classification. Expert Syst. Appl. 30, 642\u2013649 (2006)","journal-title":"Expert Syst. Appl."},{"key":"17_CR13","volume-title":"Introduction to Data Mining","author":"PN Tan","year":"2006","unstructured":"Tan, P.N., Steinbach, M., Kumar, V.: Introduction to Data Mining. Addison-Wesley, Boston (2006)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Rank aggregation for similar items. In: Proceedings of the 7th SIAM International Conference on Data Mining, pp. 587\u2013592. SIAM (2007)","DOI":"10.1137\/1.9781611972771.66"},{"key":"17_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, R., Vassilvitskii, S.: Generalized distances between rankings. In: Proceedings of the 19th International World Wide Web Conference, pp. 571\u2013580. ACM (2010)","DOI":"10.1145\/1772690.1772749"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.11.2.125","volume":"11","author":"A Caprara","year":"1999","unstructured":"Caprara, A., Pisinger, D., Toth, P.: Exact solution of the quadratic knapsack problem. INFORMS J. Comput. 11, 125\u2013137 (1999)","journal-title":"INFORMS J. Comput."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1016\/S0377-2217(03)00244-3","volume":"157","author":"A Billionnet","year":"2004","unstructured":"Billionnet, A., Soutif, \u00c9.: An exact method based on lagrangian decomposition for the 0\u20131 quadratic knapsack problem. Eur. J. Oper. Res. 157, 565\u2013575 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1287\/ijoc.1050.0172","volume":"19","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Rasmussen, A., Sandvik, R.: Solution of large quadratic knapsack problems through aggressive reduction. INFORMS J. Comput. 19, 280\u2013290 (2007)","journal-title":"INFORMS J. Comput."},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-3-319-08001-7_6","volume-title":"Approximation and Online Algorithms","author":"U Pferschy","year":"2014","unstructured":"Pferschy, U., Schauer, J.: Approximating the quadratic knapsack problem on special graph classes. In: Kaklamanis, C., Pruhs, K. (eds.) WAOA 2013. LNCS, vol. 8447, pp. 61\u201372. Springer, Heidelberg (2014)"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Julstrom, B.: Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem. In: GECCO 2005: Proceedings of the 2005 Conference on Genetic and Evolutionary Computation, pp. 607\u2013614. ACM (2005)","DOI":"10.1145\/1068009.1068111"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"1176","DOI":"10.1016\/j.cor.2012.11.023","volume":"40","author":"Z Yang","year":"2013","unstructured":"Yang, Z., Wang, G., Chu, F.: An effective GRASP and tabu search for the 0\u20131 quadratic knapsack problem. Comput. Oper. Res. 40, 1176\u20131185 (2013)","journal-title":"Comput. Oper. Res."}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-17509-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T14:12:05Z","timestamp":1675260725000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-17509-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319175089","9783319175096"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-17509-6_17","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"17 April 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}