Cascading-Tree Algorithm for the 0-1 Knapsack Problem (In Memory of Heiner Müller-Merbach, a Former President of IFORS).
Mahdi MoeiniDaniel SchermerOliver WendtPublished in: CoRR (2024)
Keyphrases
- knapsack problem
- np hard
- optimal solution
- dynamic programming
- tree structure
- combinatorial optimization problems
- search space
- greedy heuristic
- memory usage
- optimization problems
- test problems
- convex hull
- objective function
- bicriteria
- metaheuristic
- optimization algorithm
- worst case
- learning algorithm
- memory requirements
- index structure
- simulated annealing
- exact algorithms
- cost function
- np hard problems
- implicit enumeration