Knapsack problems with position-dependent item weights or profits

Stanisław Gawiejnowicz; Nir Halman; Hans Kellerer

doi:10.1007/s10479-023-05265-x

Knapsack problems with position-dependent item weights or profits

Stanisław Gawiejnowicz, Nir Halman, Hans Kellerer

Bar-Ilan University - The Alexander Kofkin Faculty of Engineering

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	137-156
Number of pages	20
Journal	Annals of Operations Research
Volume	326
Issue number	1
DOIs	https://doi.org/10.1007/s10479-023-05265-x
State	Published - Jul 2023

Bibliographical note

Publisher Copyright:
© 2023, The Author(s).

Funding

The second author was supported in part by Grant 1074/21 of the Israel Science Foundation and by Grant 2018095 of the United States-Israel Binational Science Foundation.

Funders	Funder number
United States - Israel Binational Science Foundation
United States-Israel Binational Science Foundation
Israel Science Foundation	1074/21, 2018095

Keywords

Approximation schemes
Dynamic programming
Knapsack problem

Access to Document

10.1007/s10479-023-05265-x

Cite this

@article{4d376a5c0f84401fa0d218e9be31932f,

title = "Knapsack problems with position-dependent item weights or profits",

abstract = "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.",

keywords = "Approximation schemes, Dynamic programming, Knapsack problem",

author = "Stanis{\l}aw Gawiejnowicz and Nir Halman and Hans Kellerer",

note = "Publisher Copyright: {\textcopyright} 2023, The Author(s).",

year = "2023",

month = jul,

doi = "10.1007/s10479-023-05265-x",

language = "אנגלית",

volume = "326",

pages = "137--156",

journal = "Annals of Operations Research",

issn = "0254-5330",

publisher = "Springer Netherlands",

number = "1",

}

TY - JOUR

T1 - Knapsack problems with position-dependent item weights or profits

AU - Gawiejnowicz, Stanisław

AU - Halman, Nir

AU - Kellerer, Hans

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 -

Knapsack problems with position-dependent item weights or profits

Abstract

Bibliographical note

Funding

Keywords

Access to Document

Other files and links

Fingerprint

Cite this