Heuristic and exact reduction procedures to solve the discounted 0-1 knapsack problem.
Christophe WilbautRaca TodosijevicSaïd HanafiArnaud FrévillePublished in: Eur. J. Oper. Res. (2023)
Keyphrases
- knapsack problem
- randomly generated test instances
- dynamic programming
- exact algorithms
- optimal solution
- heuristic solution
- exact solution
- multidimensional knapsack problem
- linear programming relaxation
- exact methods
- combinatorial optimization problems
- test problems
- search heuristics
- continuous relaxation
- greedy heuristic
- optimization problems
- np hard
- maximum profit
- production planning
- bicriteria
- greedy algorithm
- lower bound
- multistage
- markov decision processes
- cutting plane
- decision variables
- linear programming
- machine learning
- infinite horizon
- approximation algorithms
- solution quality
- cost function
- branch and bound
- particle swarm optimization
- state space