竞争分析
在线算法
资源配置
对偶(语法数字)
渐近最优算法
计算机科学
运筹学
最优分配
数学优化
数学
算法
数学分析
上下界
艺术
计算机网络
文学类
作者
Vineet Goyal,Garud Iyengar,Rajan Udwani
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2025-01-21
卷期号:73 (4): 1897-1915
被引量:4
标识
DOI:10.1287/opre.2021.0695
摘要
Online Allocation of Reusable Resources: New Algorithms and Analytical Tools In the paper “Asymptotically Optimal Competitive Ratio for Online Allocation of Reusable Resources,” the authors develop novel algorithms and analysis techniques for online allocation of reusable resources. Their approach leads to an algorithm with the highest possible competitive ratio, a result that was previously out of reach with the algorithms and techniques that are used in classic settings in which resources are nonreusable. More generally, their LP-free analysis approach is useful for analyzing the performance of online algorithms for various other settings in which the standard primal-dual approach fails.
科研通智能强力驱动
Strongly Powered by AbleSci AI