Determining the K-best solutions of knapsack problems (2014)
Source: Computers and Operations Research. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
ABNT
LEÃO, Aline Aparecida de Souza e CHERRI, Luiz H e ARENALES, Marcos Nereu. Determining the K-best solutions of knapsack problems. Computers and Operations Research, v. 49, p. 71-82, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2014.03.008. Acesso em: 11 out. 2024.APA
Leão, A. A. de S., Cherri, L. H., & Arenales, M. N. (2014). Determining the K-best solutions of knapsack problems. Computers and Operations Research, 49, 71-82. doi:10.1016/j.cor.2014.03.008NLM
Leão AA de S, Cherri LH, Arenales MN. Determining the K-best solutions of knapsack problems [Internet]. Computers and Operations Research. 2014 ; 49 71-82.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008Vancouver
Leão AA de S, Cherri LH, Arenales MN. Determining the K-best solutions of knapsack problems [Internet]. Computers and Operations Research. 2014 ; 49 71-82.[citado 2024 out. 11 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008