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

有和无基数约束的多维背包问题最优值的邻近性

On the Proximity of the Optimal Values of the Multi-Dimensional Knapsack Problem with and without the Cardinality Constraint

A. Yu. Chirkov, D. V. Gribanov, N. Yu. Zolotykh

摘要:

我们研究了m维背包问题的最优值与该问题的最优值之间的接近性,并附加了只允许包含一种类型的物品的限制.我们导出了这种近似精度的精确和渐近公式,即在有基数约束和无基数约束的情况下,问题的目标函数的最优值之比的无穷大。特别地,我们证明了这种近似精度趋于0.59136./如果n趋于无穷大且m固定。此外,我们给出了一类最坏的多维背包问题的界是达到的。以前,类似的结果只在m=1的情况下才知道。

英文摘要:

We study the proximity of the optimal value of the m-dimensional knapsack problem to the optimal value of that problem with the additional restriction that only one type of items is allowed to include in the solution. We derive exact and asymptotic formulas for the precision of such approximation, i.e. for the infinum of the ratio of the optimal value for the objective functions of the problem with the cardinality constraint and without it. In particular, we prove that the precision tends to 0.59136.../m if n tends to infinity and m is fixed. Also, we give the class of the worst multi-dimensional knapsack problems for which the bound is attained. Previously, similar results were known only for the case m=1.

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

↑