New exact algorithms for planar maximum covering location by ellipses problems (2021)
Tedeschi, Danilo Françoso 
; Andretta, Marina
Source: European Journal of Operational Research. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, ELIPSE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TEDESCHI, Danilo Françoso e ANDRETTA, Marina. New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, v. 291, n. 1, p. 114-127, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.09.029. Acesso em: 02 out. 2024.APA
Tedeschi, D. F., & Andretta, M. (2021). New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, 291( 1), 114-127. doi:10.1016/j.ejor.2020.09.029NLM
Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2024 out. 02 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029Vancouver
Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2024 out. 02 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
