TY - JOUR
T1 - Knapsack problems with position-dependent item weights or profits
AU - Gawiejnowicz, Stanisław
AU - Halman, Nir
AU - Kellerer, Hans
N1 - Publisher Copyright:
© 2023, The Author(s).
PY - 2023/7
Y1 - 2023/7
N2 - We consider three new knapsack problems with variable weights or profits of items, where the weight or profit of an item depends on the position of the item in the sequence of items packed in the knapsack. We show how to solve the problems exactly using dynamic programming algorithms with pseudo-polynomial running times and propose fully polynomial-time approximation schemes for their approximate solution.
AB - We consider three new knapsack problems with variable weights or profits of items, where the weight or profit of an item depends on the position of the item in the sequence of items packed in the knapsack. We show how to solve the problems exactly using dynamic programming algorithms with pseudo-polynomial running times and propose fully polynomial-time approximation schemes for their approximate solution.
KW - Approximation schemes
KW - Dynamic programming
KW - Knapsack problem
UR - http://www.scopus.com/inward/record.url?scp=85151427001&partnerID=8YFLogxK
U2 - 10.1007/s10479-023-05265-x
DO - 10.1007/s10479-023-05265-x
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:85151427001
SN - 0254-5330
VL - 326
SP - 137
EP - 156
JO - Annals of Operations Research
JF - Annals of Operations Research
IS - 1
ER -