arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2203.05618cs.DScs.LGmath.COmath.OC
收藏

多路数划分优化的线性时间局部最优算法

A Linearithmic Time Locally Optimal Algorithm for the Multiway Number Partition Optimization

Kaan Gokcesu, Hakan Gokcesu

摘要:

我们研究了多路数划分优化问题,它在决策,学习和优化文献中有无数的应用。即使原来的多路划分问题是NP难的,需要指数时间复杂度算法,我们制定了一个更容易的优化问题,我们的目标是找到一个解决方案,是局部最优的。我们提出了一个线性时间复杂度$O(N\log N)$算法,可以产生这样的局部最优解。我们的方法对输入是鲁棒的,既不需要正输入也不需要整数输入。

英文摘要:

We study the problem of multiway number partition optimization, which has a myriad of applications in the decision, learning and optimization literature. Even though the original multiway partitioning problem is NP-hard and requires exponential time complexity algorithms; we formulate an easier optimization problem, where our goal is to find a solution that is locally optimal. We propose a linearithmic time complexity $O(N\log N)$ algorithm that can produce such a locally optimal solution. Our method is robust against the input and requires neither positive nor integer inputs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑