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.
Bibliographical notePublisher Copyright:
© 2023, The Author(s).
- Approximation schemes
- Dynamic programming
- Knapsack problem