{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:02:13Z","timestamp":1750309333754,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":35,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671811","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:54:55Z","timestamp":1724561695000},"page":"1040-1049","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Local Search Algorithm for Large GD Advertising Inventory Allocation with Multilinear Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0730-1388","authenticated-orcid":false,"given":"Xiang","family":"He","sequence":"first","affiliation":[{"name":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences & School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2411-6138","authenticated-orcid":false,"given":"Wuyang","family":"Mao","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6535-8052","authenticated-orcid":false,"given":"Zhenghang","family":"Xu","sequence":"additional","affiliation":[{"name":"Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education, Jilin University, Changchun, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-1073-5477","authenticated-orcid":false,"given":"Yuanzhe","family":"Gu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-0116-611X","authenticated-orcid":false,"given":"Yundu","family":"Huang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2270-7077","authenticated-orcid":false,"given":"Zhonglin","family":"Zu","sequence":"additional","affiliation":[{"name":"Alibaba Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5353-7803","authenticated-orcid":false,"given":"Liang","family":"Wang","sequence":"additional","affiliation":[{"name":"Alibaba Group, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-8436-3532","authenticated-orcid":false,"given":"Mengyu","family":"Zhao","sequence":"additional","affiliation":[{"name":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences & School of Computer Science and Technology, University of Chinese Academy of Sciences, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6919-0533","authenticated-orcid":false,"given":"Mengchuan","family":"Zou","sequence":"additional","affiliation":[{"name":"Key Laboratory of System Software (Chinese Academy of Sciences) and State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-008-0001-1"},{"key":"e_1_3_2_2_2_1","first-page":"1405","volume-title":"Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms","author":"Agrawal Shipra","year":"2014","unstructured":"Shipra Agrawal and Nikhil R Devanur. Fast algorithms for online stochastic convex programming. In Proceedings of the twenty-sixth annual ACM-SIAM symposium on Discrete algorithms, pages 1405--1424. SIAM, 2014."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2014.1289"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_3"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339720"},{"key":"e_1_3_2_2_6_1","first-page":"1195","volume-title":"Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Bharadwaj Vijay","year":"2012","unstructured":"Vijay Bharadwaj, Peiji Chen, Wenjing Ma, Chandrashekhar Nagarajan, John Tomlin, Sergei Vassilvitskii, Erik Vee, and Jian Yang. Shale: an efficient algorithm for allocation of guaranteed display advertising. In Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 1195--1203, 2012."},{"key":"e_1_3_2_2_7_1","first-page":"44","volume-title":"Proc. of SAT Competition 2016","author":"Biere Armin","year":"2016","unstructured":"Armin Biere. Splatz, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2016. Proc. of SAT Competition 2016, pages 44--45, 2016."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-015-9184-z"},{"key":"e_1_3_2_2_9_1","first-page":"747","volume-title":"Twenty-Fourth International Joint Conference on Artificial Intelligence","author":"Cai Shaowei","year":"2015","unstructured":"Shaowei Cai. Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. In Twenty-Fourth International Joint Conference on Artificial Intelligence, pages 747--753, 2015."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2229012.2229038"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583501"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993581"},{"key":"e_1_3_2_2_13_1","volume-title":"Multilinear programming: Duality theories. Journal of optimization theory and applications, 72:459--486","author":"Drenick RF","year":"1992","unstructured":"RF Drenick. Multilinear programming: Duality theories. Journal of optimization theory and applications, 72:459--486, 1992."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00029"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15775-2_16"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2009.72"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1011767.1011787"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/130836.130837"},{"key":"e_1_3_2_2_19_1","volume-title":"Gurobi optimizer reference manual (gurobi optimization, llc)","author":"Gurobi Optimization LLC","year":"2022","unstructured":"LLC Gurobi Optimization. Gurobi optimizer reference manual (gurobi optimization, llc). 2022."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25510-6_15"},{"key":"e_1_3_2_2_21_1","volume-title":"Note: A local-search heuristic for large set-covering problems. Naval Research Logistics (NRL), 42(7):1129--1140","author":"Jacobs Larry W","year":"1995","unstructured":"Larry W Jacobs and Michael J Brusco. Note: A local-search heuristic for large set-covering problems. Naval Research Logistics (NRL), 42(7):1129--1140, 1995."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.3390\/math11204361"},{"key":"e_1_3_2_2_23_1","volume-title":"Local search for smt on linear and multilinear real arithmetic. arXiv preprint arXiv:2303.06676","author":"Li Bohan","year":"2023","unstructured":"Bohan Li and Shaowei Cai. Local search for smt on linear and multilinear real arithmetic. arXiv preprint arXiv:2303.06676, 2023."},{"key":"e_1_3_2_2_24_1","volume-title":"Large-scale identification of genetic design strategies using local search. molecular systems biology, 5(1):296","author":"Lun Desmond S","year":"2009","unstructured":"Desmond S Lun, Graham Rockwell, Nicholas J Guido, Michael Baym, Jonathan A Kelner, Bonnie Berger, James E Galagan, and George M Church. Large-scale identification of genetic design strategies using local search. molecular systems biology, 5(1):296, 2009."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1120.0551"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599332"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2095116.2095250"},{"key":"e_1_3_2_2_28_1","volume-title":"Visualizations of mittelmann benchmarks","author":"Mittelmann Hans","year":"2023","unstructured":"Hans Mittelmann. Visualizations of mittelmann benchmarks, 2023. URL: https: \/\/mattmilten.github.io\/mittelmann-plots\/."},{"key":"e_1_3_2_2_29_1","volume-title":"31st Annual European Symposium on Algorithms (ESA 2023","author":"Schieber Baruch","year":"2023","unstructured":"Baruch Schieber and Soroush Vahidi. Approximating connected maximum cuts via local search. In 31st Annual European Symposium on Algorithms (ESA 2023). Schloss-Dagstuhl-Leibniz Zentrum f\u00fcr Informatik, 2023."},{"key":"e_1_3_2_2_30_1","volume-title":"Local search strategies for satisfiability testing. Cliques, coloring, and satisfiability, 26:521--532","author":"Selman Bart","year":"1993","unstructured":"Bart Selman, Henry A Kautz, Bram Cohen, et al. Local search strategies for satisfiability testing. Cliques, coloring, and satisfiability, 26:521--532, 1993."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87700-4_81"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11047-011-9250-4"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10601-010-9093-0"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.3.302"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403348"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Barcelona Spain","acronym":"KDD '24"},"container-title":["Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671811","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671811","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:04:14Z","timestamp":1750291454000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671811"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":35,"alternative-id":["10.1145\/3637528.3671811","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671811","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}