嵌套资源分配问题的分解算法
A Decomposition Algorithm for Nested Resource Allocation Problems
摘要:
对于一类具有凸成本和资源消耗部分和约束的资源分配问题,提出了一种精确多项式算法。不需要严格凸性或可微性的假设。该方法解决了一个层次的资源分配子问题,其解决方案是用来转换为单独的变量在更高的水平上的限制资源的总和。所得的整数问题的时间复杂度为$O(n \log m \log (B/n))$,获得连续情况的$ε$近似解的复杂度为$O(n \log m \log (B/ε))$,$n$是变量的数量,$m$是上升约束的数量(例如$m < n$),$ε$是所需的精度,而$B$是总资源。该算法在$m = n$时达到了最佳复杂度,在$\log m = o(\log n)$时又有所改进。对理论和实践中提出的各种连续问题,用四种最新的算法进行了广泛的实验分析。所提出的方法实现了更高的性能比以前的算法,解决所有的问题,多达一百万个变量在不到一分钟的现代计算机上。
英文摘要:
We propose an exact polynomial algorithm for a resource allocation problem with convex costs and constraints on partial sums of resource consumptions, in the presence of either continuous or integer variables. No assumption of strict convexity or differentiability is needed. The method solves a hierarchy of resource allocation subproblems, whose solutions are used to convert constraints on sums of resources into bounds for separate variables at higher levels. The resulting time complexity for the integer problem is $O(n \log m \log (B/n))$, and the complexity of obtaining an $ε$-approximate solution for the continuous case is $O(n \log m \log (B/ε))$, $n$ being the number of variables, $m$ the number of ascending constraints (such that $m < n$), $ε$ a desired precision, and $B$ the total resource. This algorithm attains the best-known complexity when $m = n$, and improves it when $\log m = o(\log n)$. Extensive experimental analyses are conducted with four recent algorithms on various continuous problems issued from theory and practice. The proposed method achieves a higher performance than previous algorithms, addressing all problems with up to one million variables in less than one minute on a modern computer.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。