Navegação Trabalhos de Conclusão de Curso de Graduação por Assunto "Cutting stock problem"

Resultados 1-1 de 1

    • An efficient dynamic programming algorithm for the Unbounded Knapsack Problem 

      Moura, Leonardo Fernando dos Santos (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 ...