Improving an exact solver for the Traveling Salesman Problem using partition crossover (2017)
Source: Proceedings. Conference titles: Genetic and Evolutionary Computation Conference (GECCO). Unidade: FFCLRP
Subjects: INTELIGÊNCIA ARTIFICIAL, APRENDIZADO COMPUTACIONAL
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. Improving an exact solver for the Traveling Salesman Problem using partition crossover. 2017, Anais.. Berlin: ACM, 2017. Disponível em: https://doi.org/10.1145/3071178.3071304. Acesso em: 18 abr. 2026.APA
Sanches, D., Whitley, D., & Tinós, R. (2017). Improving an exact solver for the Traveling Salesman Problem using partition crossover. In Proceedings. Berlin: ACM. doi:10.1145/3071178.3071304NLM
Sanches D, Whitley D, Tinós R. Improving an exact solver for the Traveling Salesman Problem using partition crossover [Internet]. Proceedings. 2017 ;[citado 2026 abr. 18 ] Available from: https://doi.org/10.1145/3071178.3071304Vancouver
Sanches D, Whitley D, Tinós R. Improving an exact solver for the Traveling Salesman Problem using partition crossover [Internet]. Proceedings. 2017 ;[citado 2026 abr. 18 ] Available from: https://doi.org/10.1145/3071178.3071304
