An Efficient Local Search Algorithm for Large GD Advertising Inventory Allocation with Multilinear Constraints-Reference-Cited by-同舟云学术

An Efficient Local Search Algorithm for Large GD Advertising Inventory Allocation with Multilinear Constraints

Published:2024-08-24 Issue: Volume: Page:1040-1049
ISSN:
Container-title:Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

He Xiang¹^ORCID,Mao Wuyang²^ORCID,Xu Zhenghang³^ORCID,Gu Yuanzhe⁴^ORCID,Huang Yundu²^ORCID,Zu Zhonglin⁴^ORCID,Wang Liang²^ORCID,Zhao Mengyu¹^ORCID,Zou Mengchuan⁵^ORCID

Affiliation:

1. 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

2. Alibaba Group, Beijing, China

3. Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education, Jilin University, Changchun, China

4. Alibaba Group, Hangzhou, China

5. 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

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3637528.3671811

Reference35 articles.

1. SCIP: solving constraint integer programs

2. 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.

3. A Dynamic Near-Optimal Algorithm for Online Linear Programming

4. Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break

5. Online allocation of display ads with smooth delivery