A Depth-First Dynamic Programming Algorithm for the Tree Knapsack Problem.
Geon ChoDong X. ShawPublished in: INFORMS J. Comput. (1997)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- optimal solution
- tree search
- dynamic programming
- optimization problems
- tree structure
- linear programming relaxation
- exact algorithms
- np hard
- test problems
- branch and bound
- greedy algorithm
- multidimensional knapsack problem
- search strategy
- maximum profit
- bicriteria
- search algorithm
- neural network
- randomly generated test instances
- partial order
- heuristic solution
- np hard problems
- index structure
- continuous relaxation
- search tree
- decision variables
- approximation algorithms
- implicit enumeration
- search space
- computational complexity