Navegação Trabalhos Acadêmicos e Técnicos por Assunto "Cutting stock problem"
Resultados 1-1 de 1
-
An efficient dynamic programming algorithm for the Unbounded Knapsack Problem
(2013) [Trabalho de conclusão de graduação]This report describes an algorithm for the Unbounded Knapsack Problem based on the algorithm EDUK (Efficient Dynamic Programming for the Unbounded Knapsack Problem). EDUK takes advantage of the problem properties of dominance ...