arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1508.03181math.OCcs.DMmath.CO
收藏

一个多项式可解的汇集问题

A polynomially solvable case of the pooling problem

Natashia Boland, Thomas Kalinowski, Fabian Rigterink

摘要:

通过对Haugland的一个问题的讨论,证明了具有一个池和有界输入数的池化问题可以在多项式时间内通过求解多项式个数的多项式规模的线性规划来求解.我们还概述了已知的复杂性结果和剩余的开放问题,以进一步表征(强)NP难和多项式可解的情况下的池化问题之间的边界。

英文摘要:

Answering a question of Haugland, we show that the pooling problem with one pool and a bounded number of inputs can be solved in polynomial time by solving a polynomial number of linear programs of polynomial size. We also give an overview of known complexity results and remaining open problems to further characterize the border between (strongly) NP-hard and polynomially solvable cases of the pooling problem.

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

↑