Navegação por Assunto "Cutting stock problem"

Resultados 1-2 de 2

    • 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 ...

    • The unbounded knapsack problem : a critical review 

      Becker, Henrique (2017) [Dissertação]
      A review of the algorithms and datasets in the literature of the Unbounded Knapsack Problem (UKP) is presented in this master's thesis. The algorithms and datasets used are brie y described in this work to provide the ...