arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.07299cs.DScs.DM
收藏

求解时不变增量背包问题的一个PTAS算法

A PTAS for the Time-Invariant Incremental Knapsack problem

Yuri Faenza, Igor Malinovic

摘要:

时不变增量背包问题(IIK)是最大背包问题在离散多周期环境下的推广。在每一次,容量增加和项目可以添加,但不能从背包中删除。目标是在所有时间内最大化利润总和。IIK为各种应用程序建模,包括特定的金融市场和政府决策过程。IIK是强NP-困难的,并且对于某些特殊情况已经有了近似算法。在本文中,我们解决了复杂的IIK设计的PTAS的基础上舍入disjuncive公式,并提供了几个扩展的技术。

英文摘要:

The Time-Invariant Incremental Knapsack problem (IIK) is a generalization of Maximum Knapsack to a discrete multi-period setting. At each time, capacity increases and items can be added, but not removed from the knapsack. The goal is to maximize the sum of profits over all times. IIK models various applications including specific financial markets and governmental decision processes. IIK is strongly NP-hard and there has been work on giving approximation algorithms for some special cases. In this paper, we settle the complexity of IIK by designing a PTAS based on rounding a disjuncive formulation, and provide several extensions of the technique.

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

↑