Releases: shah314/knapsack
Releases · shah314/knapsack
Branch and Bound for the 0/1 Knapsack Problem using Lagrangian Relaxation
A Java implementation of the branch and bound algorithm for the 0/1 knapsack problem. The code uses Lagrangian relaxation to prune the search tree. It uses best first search. The Lagrangian multipliers are computed using coordinate ascent in an iterative algorithm
Branch and Bound for the 0/1 Knapsack Problem using Lagrangian Relaxation
A Java implementation of the branch and bound algorithm for the 0/1 knapsack problem. The code uses Lagrangian relaxation to prune the search tree. It uses best first search. The Lagrangian multipliers are computed using coordinate ascent in an iterative algorithm