Skip to content

Branch and Bound for the 0/1 Knapsack Problem using Lagrangian Relaxation
Compare
Choose a tag to compare
@shah314 shah314 released this 10 Dec 06:31
· 7 commits to master since this release
1.1
573d55e
This commit was created on GitHub.com and signed with GitHub’s verified signature. The key has expired.
GPG key ID: 4AEE18F83AFDEB23
Expired
Learn about vigilant mode.

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

Assets 2
Loading