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 profit an item depends on position in sequence items packed knapsack. show how to solve exactly using dynamic programming algorithms pseudo-polynomial running times and propose fully polynomial-time approximation schemes for their approximate solution.