An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem

In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of the one dimensional knapsack problem. If n is the total number of different items and b is the knapsack's capacity, the computational complexity of the proposed scheme is bounded by O(Knb) with memo...

Full description

Bibliographic Details
Main Author: Yanasse,Horacio Hideki (author)
Other Authors: Soma,Nei Yoshihiro (author), Maculan,Nelson (author)
Format: article
Language:eng
Published: 2000
Subjects:
Knapsack problem
K-best solutions
Online Access:http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100011
Country:Brazil
Oai:oai:scielo:S0101-74382000000100011

Internet

http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100011

Similar Items