Mukhopadhyay, Anirban; Whitley, Darrell; Tinós, Renato 
Source: Proceedings GECCO '21. Conference titles: The Genetic and Evolutionary Computation Conference (GECCO '21). Unidade: FFCLRP
Subjects: TABELAS DE CONTINGÊNCIA, ALGORITMOS, TEORIA DA COMPUTAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MUKHOPADHYAY, Anirban e WHITLEY, Darrell e TINÓS, Renato. An efficient implementation of iterative partial transcription for the traveling salesman problem. Proceedings GECCO '21. New York: ACM. Disponível em: https://doi.org/10.1145/3449639.3459368. Acesso em: 04 nov. 2024. , 2021APA
Mukhopadhyay, A., Whitley, D., & Tinós, R. (2021). An efficient implementation of iterative partial transcription for the traveling salesman problem. Proceedings GECCO '21. New York: ACM. doi:10.1145/3449639.3459368NLM
Mukhopadhyay A, Whitley D, Tinós R. An efficient implementation of iterative partial transcription for the traveling salesman problem [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1145/3449639.3459368Vancouver
Mukhopadhyay A, Whitley D, Tinós R. An efficient implementation of iterative partial transcription for the traveling salesman problem [Internet]. Proceedings GECCO '21. 2021 ;[citado 2024 nov. 04 ] Available from: https://doi.org/10.1145/3449639.3459368
