Peço que quem se basear em meus códigos me coloque como coautor.
Those are my solutions for the unbounded knapsack problem.
The gerador.c will beget size and priority of the objects.
The objects are kept in elementos.txt.
The BB.c is a solution using only Branch and Bound.
The BBRD.c is a solution using Branch and Bound and Dominace Relation.
The MOPT.c and the first and the second codes are using the priority/size as reference for put the objects in the knapsack.
The MOT.c will use size of the object as reference for put the objects in the knapsack.
The MOP.c will use priority of the object as reference for put the objects in the knapsack.
The programs will return the runtime and the sum of the priority best solution. The runtime is stored in text files and that is used by Calculador.c to calculate the average time.