A graph-based crossover and soft-repair operators for the steiner tree problem (2021)
Godoi, Giliard Almeida de; Tinós, Renato 
; Sanches, Danilo Sipoli
Fonte: Lecture Notes in Computer Science. Nome do evento: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Assuntos: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GODOI, Giliard Almeida de e TINÓS, Renato e SANCHES, Danilo Sipoli. A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-91702-9_8. Acesso em: 01 out. 2024. , 2021APA
Godoi, G. A. de, Tinós, R., & Sanches, D. S. (2021). A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-91702-9_8NLM
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2024 out. 01 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8Vancouver
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2024 out. 01 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
