TY - JOUR

T1 - Knapsack with variable weights satisfying linear constraints

AU - Nip, Kameng

AU - Wang, Zhenbo

AU - Wang, Zizhuo

PY - 2017/11/1

Y1 - 2017/11/1

N2 - We introduce a variant of the knapsack problem, in which the weights of items are also variables but must satisfy a system of linear constraints, and the capacity of knapsack is given and known. We discuss two models: (1) the value of each item is given; (2) the value-to-weight ratio of each item is given. The goal is to determine the weight of each item, and to find a subset of items such that the total weight is no more than the capacity and the total value is maximized. We provide several practical application scenarios that motivate our study, and then investigate the computational complexity and corresponding algorithms. In particular, we show that if the number of constraints is a fixed constant, then both problems can be solved in polynomial time. If the number of constraints is an input, then we show that the first problem is NP-Hard and cannot be approximated within any constant factor unless P = NP , while the second problem is NP-Hard but admits a polynomial time approximation scheme. We further propose approximation algorithms for both problems, and extend the results to multiple knapsack cases with a fixed number of knapsacks and identical capacities.

AB - We introduce a variant of the knapsack problem, in which the weights of items are also variables but must satisfy a system of linear constraints, and the capacity of knapsack is given and known. We discuss two models: (1) the value of each item is given; (2) the value-to-weight ratio of each item is given. The goal is to determine the weight of each item, and to find a subset of items such that the total weight is no more than the capacity and the total value is maximized. We provide several practical application scenarios that motivate our study, and then investigate the computational complexity and corresponding algorithms. In particular, we show that if the number of constraints is a fixed constant, then both problems can be solved in polynomial time. If the number of constraints is an input, then we show that the first problem is NP-Hard and cannot be approximated within any constant factor unless P = NP , while the second problem is NP-Hard but admits a polynomial time approximation scheme. We further propose approximation algorithms for both problems, and extend the results to multiple knapsack cases with a fixed number of knapsacks and identical capacities.

KW - Approximation algorithm

KW - Computational complexity

KW - Knapsack

KW - Linear programming

UR - http://www.scopus.com/inward/record.url?scp=85025093146&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85025093146&partnerID=8YFLogxK

U2 - 10.1007/s10898-017-0540-y

DO - 10.1007/s10898-017-0540-y

M3 - Article

AN - SCOPUS:85025093146

VL - 69

SP - 713

EP - 725

JO - Journal of Global Optimization

JF - Journal of Global Optimization

SN - 0925-5001

IS - 3

ER -