The knapsack problem is solved using a Branch and Bound design and the programming language Java.
Store the files which include the specifications of the problem to be solved in the 'data' directory. The file containing the specification of the problem to solve must be passed as a first argument and, optionally, a second file name can be passed to export the solution of the algorithm.