Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic (2018)
Source: Lecture Notes in Computer Science. Conference titles: International Conference on Parallel Problem Solving from Nature (PPSN). Unidade: FFCLRP
Subjects: OTIMIZAÇÃO COMBINATÓRIA, MATEMÁTICA DA COMPUTAÇÃO, CIÊNCIA DA COMPUTAÇÃO
ABNT
TINÓS, Renato e HELSGAUN, Keld e WHITLEY, Darrell. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. Disponível em: https://doi.org/10.1007/978-3-319-99253-2_8. Acesso em: 31 ago. 2024. , 2018APA
Tinós, R., Helsgaun, K., & Whitley, D. (2018). Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic. Lecture Notes in Computer Science. Cham: Springer International Publishing. doi:10.1007/978-3-319-99253-2_8NLM
Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2024 ago. 31 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8Vancouver
Tinós R, Helsgaun K, Whitley D. Efficient recombination in the Lin-Kernighan-Helsgaun traveling salesman heuristic [Internet]. Lecture Notes in Computer Science. 2018 ; 11101 95-107.[citado 2024 ago. 31 ] Available from: https://doi.org/10.1007/978-3-319-99253-2_8