Building a better heuristic for the traveling salesman problem (2017)
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ESTUDOS RANDOMIZADOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANCHES, Danilo e WHITLEY, Darrell e TINÓS, Renato. Building a better heuristic for the traveling salesman problem. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071305. Acesso em: 16 ago. 2024.APA
Sanches, D., Whitley, D., & Tinós, R. (2017). Building a better heuristic for the traveling salesman problem. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071305NLM
Sanches D, Whitley D, Tinós R. Building a better heuristic for the traveling salesman problem [Internet]. Proceedings. 2017 ;[citado 2024 ago. 16 ] Available from: https://doi.org/10.1145/3071178.3071305Vancouver
Sanches D, Whitley D, Tinós R. Building a better heuristic for the traveling salesman problem [Internet]. Proceedings. 2017 ;[citado 2024 ago. 16 ] Available from: https://doi.org/10.1145/3071178.3071305