A Tree Search Approach to the M-Partition and Knapsack Problems.
Antonio AlbanoRenzo OrsiniPublished in: Comput. J. (1980)
Keyphrases
- tree search
- knapsack problem
- branch and bound
- optimal solution
- linear programming relaxation
- search algorithm
- search tree
- constraint propagation
- game tree search
- mathematical programming
- dynamic programming
- optimization problems
- test problems
- np hard
- exact algorithms
- tree search algorithm
- state space
- cutting plane
- greedy algorithm
- search space
- game tree
- column generation
- iterative deepening
- machine learning
- path finding
- search strategies
- combinatorial optimization
- learning algorithm
- integer programming
- vehicle routing problem
- branch and bound algorithm
- traveling salesman problem
- integer program
- nearest neighbor
- upper bound
- lower bound
- neural network