连续时间联合补给问题：$ε$ -基于成对对齐的最优策略
The Continuous-Time Joint Replenishment Problem: $ε$-Optimal Policies via Pairwise Alignment
摘要：
本文的主要贡献在于开发一种新的算法方法，用于解决连续时间联合补给问题，称为$Ψ$ -成对对齐。后一种机制，通过它，我们同步多个经济订货量模型，使我们能够设计一个纯粹的组合算法，有效地逼近任何程度的准确性内的最优政策。因此，我们的工作构成了第一个定量的改进权力的$2$政策，这一直是国家的最先进的，在这种情况下，自80年代中期。此外，根据最近的棘手的结果，提出了一个有效的多项式时间近似计划（EPTAS）的联合补充问题，我们解决了长期悬而未决的问题，关于这个经典的设置的计算复杂性。
英文摘要：
The main contribution of this paper resides in developing a new algorithmic approach for addressing the continuous-time joint replenishment problem, termed $Ψ$-pairwise alignment. The latter mechanism, through which we synchronize multiple Economic Order Quantity models, allows us to devise a purely-combinatorial algorithm for efficiently approximating optimal policies within any degree of accuracy. As a result, our work constitutes the first quantitative improvement over power-of-$2$ policies, which have been state-of-the-art in this context since the mid-80's. Moreover, in light of recent intractability results, by proposing an efficient polynomial-time approximation scheme (EPTAS) for the joint replenishment problem, we resolve the long-standing open question regarding the computational complexity of this classical setting.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
