{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T09:21:40Z","timestamp":1771060900340,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3477314.3507320","type":"proceedings-article","created":{"date-parts":[[2022,5,7]],"date-time":"2022-05-07T00:37:36Z","timestamp":1651883856000},"page":"1056-1065","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["A new reference-based algorithm based on non-euclidean geometry for multi-stakeholder media planning"],"prefix":"10.1145","author":[{"given":"Fodil","family":"Benali","sequence":"first","affiliation":[{"name":"Adwanted Group, Paris, France"}]},{"given":"Damien","family":"Bod\u00e9n\u00e8s","sequence":"additional","affiliation":[{"name":"Adwanted Group, Paris, France"}]},{"given":"Cyril","family":"de Runz","sequence":"additional","affiliation":[{"name":"University of Tours, Blois, France"}]},{"given":"Nicolas","family":"Labroche","sequence":"additional","affiliation":[{"name":"University of Tours, Blois, France"}]}],"member":"320","published-online":{"date-parts":[[2022,5,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"An Enhanced R-NSGA-II For Multiple Brands Advertising Campaign Allocation Problem. In ICTAI","author":"Benali Fodil","year":"2021","unstructured":"Fodil Benali, Damien Bod\u00e9n\u00e8s, Cyril De Runz, and Nicolas Labroche. 2021. An Enhanced R-NSGA-II For Multiple Brands Advertising Campaign Allocation Problem. In ICTAI 2021. IEEE, Virtual, Greece. https:\/\/hal.archives-ouvertes.fr\/hal-03390621"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.09.027"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2990567"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/inte.32.1.47.19"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2602481"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2015.08.001"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851613.2853130"},{"key":"e_1_3_2_1_8_1","first-page":"157","article-title":"V12. 1: User's Manual for CPLEX","volume":"46","author":"Cplex IBM ILOG","year":"2009","unstructured":"IBM ILOG Cplex. 2009. V12. 1: User's Manual for CPLEX. International Business Machines Corporation 46, 53 (2009), 157.","journal-title":"International Business Machines Corporation"},{"key":"e_1_3_2_1_9_1","volume-title":"Ram Bhushan Agrawal, et al","author":"Deb Kalyanmoy","year":"1995","unstructured":"Kalyanmoy Deb, Ram Bhushan Agrawal, et al. 1995. Simulated binary crossover for continuous search space. Complex systems 9, 2 (1995), 115--148."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144113"},{"key":"e_1_3_2_1_11_1","volume-title":"An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints","author":"Deb Kalyanmoy","year":"2014","unstructured":"Kalyanmoy Deb and Himanshu Jain. 2014. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: solving problems with box constraints. IEEE transactions on evolutionary computation 18, 4 (2014), 577--601."},{"key":"e_1_3_2_1_12_1","volume-title":"A fast and elitist multiobjective genetic algorithm: NSGA-II","author":"Deb Kalyanmoy","year":"2002","unstructured":"Kalyanmoy Deb, Amrit Pratap, Sameer Agarwal, and TAMT Meyarivan. 2002. A fast and elitist multiobjective genetic algorithm: NSGA-II. IEEE transactions on evolutionary computation 6, 2 (2002), 182--197."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144112"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/CEC.2002.1007032"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"John E Dennis Jr and Robert B Schnabel. 1996. Numerical methods for unconstrained optimization and nonlinear equations. SIAM.","DOI":"10.1137\/1.9781611971200"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMCC.2007.900651"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2018.2865590"},{"key":"e_1_3_2_1_18_1","volume-title":"ECAI","author":"Ishibuchi Hisao","year":"2020","unstructured":"Hisao Ishibuchi, Takashi Matsumoto, Naoki Masuyama, and Yusuke Nojima. 2020. Many-objective problems are not always difficult for Pareto dominance-based evolutionary algorithms. In ECAI 2020. IOS Press, 291--298."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1389095.1389225"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281534"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2013.2281534"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/3297280.3297395"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0096-3003(02)00853-6"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3032240"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3321707.3321839"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/SSCI.2018.8628819"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2019.2909636"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2007.892759"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1504\/IJOR.2006.009303"},{"key":"e_1_3_2_1_30_1","volume-title":"Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary computation 8, 2","author":"Zitzler Eckart","year":"2000","unstructured":"Eckart Zitzler, Kalyanmoy Deb, and Lothar Thiele. 2000. Comparison of multiobjective evolutionary algorithms: Empirical results. Evolutionary computation 8, 2 (2000), 173--195."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2003.810758"}],"event":{"name":"SAC '22: The 37th ACM\/SIGAPP Symposium on Applied Computing","location":"Virtual Event","acronym":"SAC '22","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"]},"container-title":["Proceedings of the 37th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477314.3507320","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3477314.3507320","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:30Z","timestamp":1750188630000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3477314.3507320"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":31,"alternative-id":["10.1145\/3477314.3507320","10.1145\/3477314"],"URL":"https:\/\/doi.org\/10.1145\/3477314.3507320","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-05-06","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}