Knapsack problems with position-dependent item weights or profits.
Stanislaw GawiejnowiczNir HalmanHans KellererPublished in: Ann. Oper. Res. (2023)
Keyphrases
- knapsack problem
- maximum profit
- combinatorial optimization problems
- optimization problems
- dynamic programming
- optimal solution
- test problems
- production planning
- np hard
- linear programming relaxation
- exact algorithms
- np hard problems
- greedy algorithm
- weighted sum
- linear combination
- continuous relaxation
- binary variables
- greedy algorithms
- bicriteria
- user preferences
- neural network
- cutting plane
- implicit enumeration
- genetic algorithm