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

Detalhes bibliográficos
Autor(a) principal: Yanasse,Horacio Hideki
Data de Publicação: 2000
Outros Autores: Soma,Nei Yoshihiro, Maculan,Nelson
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100011
Resumo: 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 memory requirements bounded by O(nb). The algorithm was implemented in a workstation and computational tests for varying values of the parameters were performed.
id SOBRAPO-1_5d2bc3da2ecde9d0ba0be47f84caa79d
oai_identifier_str oai:scielo:S0101-74382000000100011
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling An algorithm for determining the K-best solutions of the one-dimensional Knapsack problemKnapsack problemK-best solutionsIn 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 memory requirements bounded by O(nb). The algorithm was implemented in a workstation and computational tests for varying values of the parameters were performed.Sociedade Brasileira de Pesquisa Operacional2000-06-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100011Pesquisa Operacional v.20 n.1 2000reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382000000100011info:eu-repo/semantics/openAccessYanasse,Horacio HidekiSoma,Nei YoshihiroMaculan,Nelsoneng2003-05-27T00:00:00Zoai:scielo:S0101-74382000000100011Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2003-05-27T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
title An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
spellingShingle An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
Yanasse,Horacio Hideki
Knapsack problem
K-best solutions
title_short An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
title_full An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
title_fullStr An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
title_full_unstemmed An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
title_sort An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
author Yanasse,Horacio Hideki
author_facet Yanasse,Horacio Hideki
Soma,Nei Yoshihiro
Maculan,Nelson
author_role author
author2 Soma,Nei Yoshihiro
Maculan,Nelson
author2_role author
author
dc.contributor.author.fl_str_mv Yanasse,Horacio Hideki
Soma,Nei Yoshihiro
Maculan,Nelson
dc.subject.por.fl_str_mv Knapsack problem
K-best solutions
topic Knapsack problem
K-best solutions
description 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 memory requirements bounded by O(nb). The algorithm was implemented in a workstation and computational tests for varying values of the parameters were performed.
publishDate 2000
dc.date.none.fl_str_mv 2000-06-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100011
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000100011
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382000000100011
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.20 n.1 2000
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318016171606016

Registros relacionados