Hands-On Data Structures and Algorithms with JavaScript

Using branch and bound algorithm to create a custom shopping list

The branch and bound algorithm are applied to a set of problems, which involves combinational optimization. What that means is that we can have a problem at hand that does not necessarily have one correct solution, but with the information that we have, we will need to generate the best possible solution out of the finite yet very large number of available solutions.

We will be using the branch and bound algorithm to optimize and solve a particular class of dynamic programming problems known as the 0/1 knapsack problem. In this case, consider that we have a shopping list in which we have a list of items, their cost in dollars, and their importance (value) to you on a scale ...