Published December 27, 2020 | Version 1.2
Software Open

Branch and Bound for the 0/1 Knapsack Problem using Lagrangian Relaxation

Authors/Creators

  • 1. JHU

Description

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. It solves large instances in a very short amount of time.

Files

shah314/knapsack-1.2.zip

Files (33.8 kB)

Name Size Download all
md5:3d10c345d0768ad07a9ce49072f909f9
33.8 kB Preview Download

Additional details

Related works

Is supplement to
https://github.com/shah314/knapsack/tree/1.2 (URL)