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

多周期二元背包问题的逼近格式

Approximation Schemes for Multiperiod Binary Knapsack Problems

Zuguang Gao, John R. Birge, Varun Gupta

摘要:

多周期二进制背包问题(MPBKP)的一个实例由时域长度$T$、背包大小的非减向量$(c_1, \ldots, c_T)$(其中$c_t$表示周期$1,\ldots,t$的累积大小)和$n$项的列表给出。每个项目都是一个三元组$(r, q, d)$,其中$r$表示项目的奖励,$q$表示其大小,$d$表示其时间索引(或截止日期)。我们的目标是选择,对于每个截止日期$t$,哪些项目包括最大化的总回报,受到的约束,所有$t=1,\ldots,T$,最多$t$的截止日期所选择的项目的总大小不超过背包的累积容量的时间$t$。我们还考虑了多周期二进制背包问题与软容量约束(MPBKP-S)的容量限制被允许违反支付罚款是线性的违规。目标是使总利润最大化,即,所选项目的总奖励减去总惩罚。最后,我们考虑具有软随机容量约束的多周期二元背包问题(MPBKP-SS),其中背包大小的非减向量$(c_1, \ldots, c_T)$遵循某种任意联合分布,但我们可以访问利润作为预言,我们选择一个子集的项目以最大化总期望利润,即,总奖励减去总预期惩罚。对于MPBKP,我们展示了一个完整的多项式时间近似方案,运行时$\tilde{\mathcal{O}}\left(\min\left\{n+\frac{T^{3.25}}{ε^{2.25}},n+\frac{T^{2}}{ε^{3}},\frac{nT}{ε^2},\frac{n^2}ε\right\}\right)$,实现$(1+ε)$近似;对于MPBKP-S,$(1+ε)$近似可以在$\mathcal{O}\left(\frac{n\log n}ε\cdot\min\left\{\frac{T}ε,n\right\}\right)$中实现;对于MPBKP-SS,当项目具有相同的大小时,贪婪算法是2-近似。

英文摘要:

An instance of the multiperiod binary knapsack problem (MPBKP) is given by a horizon length $T$, a non-decreasing vector of knapsack sizes $(c_1, \ldots, c_T)$ where $c_t$ denotes the cumulative size for periods $1,\ldots,t$, and a list of $n$ items. Each item is a triple $(r, q, d)$ where $r$ denotes the reward of the item, $q$ its size, and $d$ its time index (or, deadline). The goal is to choose, for each deadline $t$, which items to include to maximize the total reward, subject to the constraints that for all $t=1,\ldots,T$, the total size of selected items with deadlines at most $t$ does not exceed the cumulative capacity of the knapsack up to time $t$. We also consider the multiperiod binary knapsack problem with soft capacity constraints (MPBKP-S) where the capacity constraints are allowed to be violated by paying a penalty that is linear in the violation. The goal is to maximize the total profit, i.e., the total reward of selected items less the total penalty. Finally, we consider the multiperiod binary knapsack problem with soft stochastic capacity constraints (MPBKP-SS), where the non-decreasing vector of knapsack sizes $(c_1, \ldots, c_T)$ follow some arbitrary joint distribution but we are given access to the profit as an oracle, and we choose a subset of items to maximize the total expected profit, i.e., the total reward less the total expected penalty. For MPBKP, we exhibit a fully polynomial-time approximation scheme with runtime $\tilde{\mathcal{O}}\left(\min\left\{n+\frac{T^{3.25}}{ε^{2.25}},n+\frac{T^{2}}{ε^{3}},\frac{nT}{ε^2},\frac{n^2}ε\right\}\right)$ that achieves $(1+ε)$ approximation; for MPBKP-S, the $(1+ε)$ approximation can be achieved in $\mathcal{O}\left(\frac{n\log n}ε\cdot\min\left\{\frac{T}ε,n\right\}\right)$; for MPBKP-SS, a greedy algorithm is a 2-approximation when items have the same size.

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

↑