DeepAI AI Chat
Log In Sign Up

Approximation Schemes for Multiperiod Binary Knapsack Problems

by   Zuguang Gao, et al.

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, …, c_T) where c_t denotes the cumulative size for periods 1,…,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,…,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, …, 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 𝒪̃(min{n+T^3.25/ϵ^2.25,n+T^2/ϵ^3,nT/ϵ^2,n^2/ϵ}) that achieves (1+ϵ) approximation; for MPBKP-S, the (1+ϵ) approximation can be achieved in 𝒪(nlog n/ϵ·min{T/ϵ,n}); for MPBKP-SS, a greedy algorithm is a 2-approximation when items have the same size.


page 1

page 2

page 3

page 4


Group Fairness for Knapsack Problems

We study the knapsack problem with group fairness constraints. The input...

A PTAS for a Class of Stochastic Dynamic Programs

We develop a framework for obtaining polynomial time approximation schem...

Boolean function analysis meets stochastic optimization: An approximation scheme for stochastic knapsack

The stochastic knapsack problem is the stochastic variant of the classic...

Online Knapsack Problems with a Resource Buffer

In this paper, we introduce online knapsack problems with a resource buf...

Online Adaptive Bin Packing with Overflow

Motivated by bursty bandwidth allocation and by the allocation of virtua...

Nearly Optimal Pricing Algorithms for Production Constrained and Laminar Bayesian Selection

We study online pricing algorithms for the Bayesian selection problem wi...

An FPTAS for Stochastic Unbounded Min-Knapsack Problem

In this paper, we study the stochastic unbounded min-knapsack problem (M...