Funder
China Postdoctoral Science Foundation
National Natural Science Foundation of China-Guangdong Joint Fund
National Natural Science Foundation of China
Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference41 articles.
1. A dynamic near-optimal algorithm for online linear programming;Agrawal;Oper. Res.,2014
2. The online stochastic generalized assignment problem;Alaei,2013
3. Improved online algorithms for knapsack and GAP in the random order model;Albers;Algorithmica,2021
4. The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach;Arias-Melia;Comput. Oper. Res.,2022
5. Babaioff, M., Hartline, J.D., Kleinberg, R.D., 2009. Selling ad campaigns: online algorithms with cancellations. In: Proceedings of the 10th ACM Conference on Electronic Commerce. pp. 61–70.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献