Algoritmo Pseudopolinomial Para o Problema DA Mochila O-1 de Valor Independente (Pseudo-Polynomial Algorithm for the Value Independent O-1 Knapsack Problem)

摘要

Enumerative pseudopolynomial algorithm for solving the value independent O-1 knapsack problem is presented. This algorithm is an adaptation of Yanasse and Soma's algorithm for solving the O-1 linear diophantine equation. This adaptation maintains the same computational complexity of the original algorithm but has a slight increase in memory requirements.