{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,21]],"date-time":"2025-09-21T17:06:40Z","timestamp":1758474400537,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030864743"},{"type":"electronic","value":"9783030864750"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-86475-0_27","type":"book-chapter","created":{"date-parts":[[2021,8,31]],"date-time":"2021-08-31T07:03:29Z","timestamp":1630393409000},"page":"270-282","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Objective Recommendations and\u00a0Promotions at TOTAL"],"prefix":"10.1007","author":[{"given":"Idir","family":"Benouaret","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Bouadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,9,1]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Benouaret, I., Amer-Yahia, S.: A comparative evaluation of top-n recommendation algorithms: case study with total customers. In: 2020 IEEE International Conference on Big Data (Big Data), pp. 4499\u20134508. IEEE (2020)","key":"27_CR1","DOI":"10.1109\/BigData50022.2020.9378404"},{"doi-asserted-by":"crossref","unstructured":"Benouaret, I., Amer-Yahia, S., Kamdem-Kengne, C., Chagraoui, J.: A bi-objective approach for product recommendations. In: 2019 IEEE International Conference on Big Data (Big Data), pp. 2159\u20132168. IEEE (2019)","key":"27_CR2","DOI":"10.1109\/BigData47090.2019.9006503"},{"doi-asserted-by":"crossref","unstructured":"Benouaret, I., Amer-Yahia, S., Roy, S.B., Kamdem-Kengne, C., Chagraoui, J.: Enabling decision support through ranking and summarization of association rules for total customers. In: Transactions on Large-Scale Data-and Knowledge-Centered Systems XLIV, pp. 160\u2013193. Springer, Berlin (2020)","key":"27_CR3","DOI":"10.1007\/978-3-662-62271-1_6"},{"doi-asserted-by":"crossref","unstructured":"Bhattacharya, S., et al..: Ma \\$\\$ ive-an intelligent mobile grocery assistant. In: 2012 Eighth International Conference on Intelligent Environments, pp. 165\u2013172. IEEE (2012)","key":"27_CR4","DOI":"10.1109\/IE.2012.21"},{"doi-asserted-by":"crossref","unstructured":"Blattberg, R.C., Briesch, R., Fox, E.J.: How promotions work. Market. Sci. 14(3\\_supplement), G122\u2013G132 (1995)","key":"27_CR5","DOI":"10.1287\/mksc.14.3.G122"},{"issue":"3","key":"27_CR6","first-page":"1","volume":"38","author":"C Chekuri","year":"2006","unstructured":"Chekuri, C., Khanna, S.: A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Comput. 38(3), 1 (2006)","journal-title":"SIAM J. Comput."},{"issue":"12","key":"27_CR7","doi-asserted-by":"publisher","first-page":"1603","DOI":"10.1287\/mnsc.48.12.1603.445","volume":"48","author":"T Erlebach","year":"2002","unstructured":"Erlebach, T., Kellerer, H., Pferschy, U.: Approximating multiobjective knapsack problems. Manag. Sci. 48(12), 1603\u20131612 (2002)","journal-title":"Manag. Sci."},{"doi-asserted-by":"publisher","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Introduction to NP-completeness of knapsack problems. In: Knapsack Problems. Springer, Berlin, pp. 483\u2013493. Springer (2004). https:\/\/doi.org\/10.1007\/978-3-540-24777-7_16","key":"27_CR8","DOI":"10.1007\/978-3-540-24777-7_16"},{"doi-asserted-by":"publisher","unstructured":"Pisinger, D., Toth, P.: Knapsack problems. In: Du, D.Z., Pardalos, P.M. (eds.) Handbook of Combinatorial Optimization. Springer, Boston (1998) . https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_5","key":"27_CR9","DOI":"10.1007\/978-1-4613-0303-9_5"},{"doi-asserted-by":"crossref","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Other knapsack problems. In: Knapsack Problems, pp. 389\u2013424. Springer, Heidelberg (2004)","key":"27_CR10","DOI":"10.1007\/978-3-540-24777-7_13"},{"unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems with 33 Tables. Springer, Berlin (2010)","key":"27_CR11"},{"doi-asserted-by":"crossref","unstructured":"Lal, R., Matutes, C.: Retail pricing and advertising strategies. J. Busi. 67, 345\u2013370 (1994)","key":"27_CR12","DOI":"10.1086\/296637"},{"issue":"7","key":"27_CR13","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1145\/278476.278491","volume":"41","author":"GL Lohse","year":"1998","unstructured":"Lohse, G.L., Spiller, P.: Electronic shopping. Commun. ACM 41(7), 81\u201387 (1998)","journal-title":"Commun. ACM"},{"doi-asserted-by":"crossref","unstructured":"Makhijani, R., Chakrabarti, S., Struble, D., Liu, Y.: Lore: a large-scale offer recommendation engine with eligibility and capacity constraints. In: Proceedings of the 13th ACM Conference on Recommender Systems. pp. 160\u2013168 (2019)","key":"27_CR14","DOI":"10.1145\/3298689.3347027"},{"issue":"3","key":"27_CR15","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Manag. Sci. 45(3), 414\u2013424 (1999)","journal-title":"Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"Mauri, C.: Card loyalty. a new emerging issue in grocery retailing. J. Retail. Consum. Serv. 10(1), 13\u201325 (2003)","key":"27_CR16","DOI":"10.1016\/S0969-6989(02)00036-X"},{"doi-asserted-by":"crossref","unstructured":"Meng, Z., McCreadie, R., Macdonald, C., Ounis, I.: Exploring data splitting strategies for the evaluation of recommendation models. In: Fourteenth ACM Conference on Recommender Systems, pp. 681\u2013686 (2020)","key":"27_CR17","DOI":"10.1145\/3383313.3418479"},{"doi-asserted-by":"publisher","unstructured":"Migdalas, A., Pardalos, P.M., V\u00e4rbrand, P.: Multilevel optimization: algorithms and applications, vol. 20. Springer Science & Business Media (2013). https:\/\/doi.org\/10.1007\/978-1-4613-0307-7","key":"27_CR18","DOI":"10.1007\/978-1-4613-0307-7"},{"issue":"1","key":"27_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2584249","volume":"4","author":"P Nurmi","year":"2014","unstructured":"Nurmi, P., Salovaara, A., Forsblom, A., Bohnert, F., Flor\u00e9en, P.: Promotionrank: ranking and recommending grocery product promotions using personal shopping lists. ACM Trans. Inter. Intell. Syst. (TiiS) 4(1), 1\u201323 (2014)","journal-title":"ACM Trans. Inter. Intell. Syst. (TiiS)"},{"doi-asserted-by":"crossref","unstructured":"Omidvar-Tehrani, B., Amer-Yahia, S., Dutot, P.F., Trystram, D.: Multi-objective group discovery on the social web. In: Joint European Conference on Machine Learning and Knowledge Discovery in Databases. pp. 296\u2013312. Springer (2016)","key":"27_CR20","DOI":"10.1007\/978-3-319-46128-1_19"},{"unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: Proceedings 41st Annual Symposium on Foundations of Computer Science, pp. 86\u201392. IEEE (2000)","key":"27_CR21"},{"issue":"11","key":"27_CR22","doi-asserted-by":"publisher","first-page":"10059","DOI":"10.1016\/j.eswa.2012.02.038","volume":"39","author":"DH Park","year":"2012","unstructured":"Park, D.H., Kim, H.K., Choi, I.Y., Kim, J.K.: A literature review and classification of recommender systems research. Exp. Syst. Appl. 39(11), 10059\u201310072 (2012)","journal-title":"Exp. Syst. Appl."},{"doi-asserted-by":"crossref","unstructured":"Sarwar, B., Karypis, G., Konstan, J., Riedl, J.: Item-based collaborative filtering recommendation algorithms. In: Proceedings of the 10th international conference on World Wide Web, pp. 285\u2013295 (2001)","key":"27_CR23","DOI":"10.1145\/371920.372071"},{"issue":"4","key":"27_CR24","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1057\/jors.1979.78","volume":"30","author":"W Shih","year":"1979","unstructured":"Shih, W.: A branch and bound method for the multiconstraint zero-one knapsack problem. J. Oper. Res. Soc. 30(4), 369\u2013378 (1979)","journal-title":"J. Oper. Res. Soc."},{"doi-asserted-by":"crossref","unstructured":"Su, X., Khoshgoftaar, T.M.: A survey of collaborative filtering techniques. Adv. Artif. intell. 2009, 421425 (2009)","key":"27_CR25","DOI":"10.1155\/2009\/421425"},{"doi-asserted-by":"crossref","unstructured":"Trummer, I., Koch, C.: Approximation schemes for many-objective query optimization. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data, pp. 1299\u20131310 (2014)","key":"27_CR26","DOI":"10.1145\/2588555.2610527"},{"issue":"1","key":"27_CR27","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1007\/s00224-007-9096-4","volume":"45","author":"G Tsaggouris","year":"2009","unstructured":"Tsaggouris, G., Zaroliagis, C.: Multiobjective optimization: Iiproved FPTAS for shortest paths and non-linear objectives with applications. Theor Comput. Syst. 45(1), 162\u2013186 (2009)","journal-title":"Theor Comput. Syst."},{"key":"27_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-30214-8_2","volume-title":"Discovery Science","author":"T Uno","year":"2004","unstructured":"Uno, T., Asai, T., Uchida, Y., Arimura, H.: An efficient algorithm for enumerating closed patterns in transaction databases. In: Suzuki, E., Arikawa, S. (eds.) DS 2004. LNCS (LNAI), vol. 3245, pp. 16\u201331. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30214-8_2"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-86475-0_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:09:10Z","timestamp":1710328150000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-86475-0_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030864743","9783030864750"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-86475-0_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"1 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dexa2021","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"149","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"25% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"DEXA 2021 Workshops: 50 papers submitted, 23 papers accepted","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}