On the complexity of discrete bicriterion optimization using dynamic programming (1991)
Source: Abstracts. Conference titles: Workshop on Large-Scale Optimization. Unidade: IME
Assunto: PROGRAMAÇÃO DINÂMICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HUMES JÚNIOR, Carlos e WASSERSTEIN, S L e ZANJACOMO, P R. On the complexity of discrete bicriterion optimization using dynamic programming. 1991, Anais.. Coimbra: University of Coimbra, 1991. . Acesso em: 01 set. 2024.APA
Humes Júnior, C., Wasserstein, S. L., & Zanjacomo, P. R. (1991). On the complexity of discrete bicriterion optimization using dynamic programming. In Abstracts. Coimbra: University of Coimbra.NLM
Humes Júnior C, Wasserstein SL, Zanjacomo PR. On the complexity of discrete bicriterion optimization using dynamic programming. Abstracts. 1991 ;[citado 2024 set. 01 ]Vancouver
Humes Júnior C, Wasserstein SL, Zanjacomo PR. On the complexity of discrete bicriterion optimization using dynamic programming. Abstracts. 1991 ;[citado 2024 set. 01 ]
