Greedy Solvable Knapsacks

Bibliographic Details
Main Author: Amado, Lígia
Publication Date: 1991
Other Authors: Bárcia, Paulo
Format: Article
Language: eng
Source: Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
Download full: http://hdl.handle.net/10362/85388
Summary: The family K of the feasible solutions for a 0-1 Knapsack with positive coefficients, K={l⊂N:Σi∈Iai≤b}, is an independence system over N={1,...,n}. In some cases, for instance when all the ai have the same value, this independence system is a matroid over N. We will say then that the knapsack is greedy solvable. In this paper We study the conditions for a knapsack to be greedy solvable. We present necessary and sufficient conditions, verifiable in polynomial time, for K to be a member of a finite family of matroids over N.
id RCAP_3a3e53f2ccc153c41d145dba6cd83c06
oai_identifier_str oai:run.unl.pt:10362/85388
network_acronym_str RCAP
network_name_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository_id_str https://opendoar.ac.uk/repository/7160
spelling Greedy Solvable Knapsacks0-1 KnapsacksMatroidsThe family K of the feasible solutions for a 0-1 Knapsack with positive coefficients, K={l⊂N:Σi∈Iai≤b}, is an independence system over N={1,...,n}. In some cases, for instance when all the ai have the same value, this independence system is a matroid over N. We will say then that the knapsack is greedy solvable. In this paper We study the conditions for a knapsack to be greedy solvable. We present necessary and sufficient conditions, verifiable in polynomial time, for K to be a member of a finite family of matroids over N.Nova SBERUNAmado, LígiaBárcia, Paulo2019-10-25T11:35:13Z1991-081991-08-01T00:00:00Zinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10362/85388engAmado, Lígia and Bárcia, Paulo, Greedy Solvable Knapsacks (August, 1991). FEUNL Working Paper Series No. 174info:eu-repo/semantics/openAccessreponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiainstacron:RCAAP2024-05-22T17:41:54Zoai:run.unl.pt:10362/85388Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireinfo@rcaap.ptopendoar:https://opendoar.ac.uk/repository/71602025-05-28T17:13:19.963817Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologiafalse
dc.title.none.fl_str_mv Greedy Solvable Knapsacks
title Greedy Solvable Knapsacks
spellingShingle Greedy Solvable Knapsacks
Amado, Lígia
0-1 Knapsacks
Matroids
title_short Greedy Solvable Knapsacks
title_full Greedy Solvable Knapsacks
title_fullStr Greedy Solvable Knapsacks
title_full_unstemmed Greedy Solvable Knapsacks
title_sort Greedy Solvable Knapsacks
author Amado, Lígia
author_facet Amado, Lígia
Bárcia, Paulo
author_role author
author2 Bárcia, Paulo
author2_role author
dc.contributor.none.fl_str_mv RUN
dc.contributor.author.fl_str_mv Amado, Lígia
Bárcia, Paulo
dc.subject.por.fl_str_mv 0-1 Knapsacks
Matroids
topic 0-1 Knapsacks
Matroids
description The family K of the feasible solutions for a 0-1 Knapsack with positive coefficients, K={l⊂N:Σi∈Iai≤b}, is an independence system over N={1,...,n}. In some cases, for instance when all the ai have the same value, this independence system is a matroid over N. We will say then that the knapsack is greedy solvable. In this paper We study the conditions for a knapsack to be greedy solvable. We present necessary and sufficient conditions, verifiable in polynomial time, for K to be a member of a finite family of matroids over N.
publishDate 1991
dc.date.none.fl_str_mv 1991-08
1991-08-01T00:00:00Z
2019-10-25T11:35:13Z
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://hdl.handle.net/10362/85388
url http://hdl.handle.net/10362/85388
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv Amado, Lígia and Bárcia, Paulo, Greedy Solvable Knapsacks (August, 1991). FEUNL Working Paper Series No. 174
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv application/pdf
dc.publisher.none.fl_str_mv Nova SBE
publisher.none.fl_str_mv Nova SBE
dc.source.none.fl_str_mv reponame:Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
instname:FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron:RCAAP
instname_str FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
instacron_str RCAAP
institution RCAAP
reponame_str Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
collection Repositórios Científicos de Acesso Aberto de Portugal (RCAAP)
repository.name.fl_str_mv Repositórios Científicos de Acesso Aberto de Portugal (RCAAP) - FCCN, serviços digitais da FCT – Fundação para a Ciência e a Tecnologia
repository.mail.fl_str_mv info@rcaap.pt
_version_ 1833596527054946304

Similar Items