This is C project for a class Investigación de Operaciones at Instituto Technológico de Costa Rica. Purpouse of this project is solving the knapsack problem and optimal binary search tree problem.
Coding backpack algorithms. Example of input data:
BackpackMin = 5, BackpackMax = 10 AmountMin = 2, AmountMax = 4 Costmin = 5, CostMax = 9 ValueMin = 1, ValueMax = 12 MinObjects = 0, MaxObjects = 3 ExamplesNumber = 1