Fonte: Pattern Recognition. Unidade: FFCLRP
Assunto: OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RIS, Marcelo e BARRERA, Júnior e MARTINS JUNIOR, David C. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recognition, v. 43, n. 3, p. 557-568, 2010Tradução . . Disponível em: https://doi.org/10.1016/j.patcog.2009.08.018. Acesso em: 12 nov. 2025.APA
Ris, M., Barrera, J., & Martins Junior, D. C. (2010). U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem. Pattern Recognition, 43( 3), 557-568. doi:10.1016/j.patcog.2009.08.018NLM
Ris M, Barrera J, Martins Junior DC. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem [Internet]. Pattern Recognition. 2010 ; 43( 3): 557-568.[citado 2025 nov. 12 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018Vancouver
Ris M, Barrera J, Martins Junior DC. U-curve: a branch-and-bound optimization algorithm for U-shaped cost functions on Boolean lattices applied to the feature selection problem [Internet]. Pattern Recognition. 2010 ; 43( 3): 557-568.[citado 2025 nov. 12 ] Available from: https://doi.org/10.1016/j.patcog.2009.08.018
