Integer knapsack problems with profit functions of the same value range.
Evgeny GurevskyDmitry KopelevichSergey KovalevMikhail Y. KovalyovPublished in: 4OR (2023)
Keyphrases
- knapsack problem
- maximum profit
- combinatorial optimization problems
- integer variables
- continuous relaxation
- optimal solution
- test problems
- linear programming relaxation
- np hard
- dynamic programming
- binary variables
- decision making
- optimization problems
- neural network
- np hard problems
- linear functions
- wide range
- exact algorithms
- bicriteria
- greedy algorithm