A carregar...
Publicação
Greedy Solvable Knapsacks
Autores
Orientador(es)
Resumo(s)
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.
Descrição
Palavras-chave
0-1 Knapsacks Matroids
Contexto Educativo
Citação
Amado, Lígia and Bárcia, Paulo, Greedy Solvable Knapsacks (August, 1991). FEUNL Working Paper Series No. 174