This software was written by Matthew Wakeling at the University of Exeter, and was presented at the 2017 ASHG meeting in Orlando, Florida. Wakeling, MN, De Franco E, Hattersley AT, Ellard S. Making ...
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 ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results