A heuristic method for the close enough traveling salesman problem (2023)
Birgin, Ernesto Julian Goldberg 
; Ertel, Paula Cristina Rohr
Source: Abstracts. Conference titles: Conference of the International Federation of Operational Research Societies - IFORS. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e ERTEL, Paula Cristina Rohr. A heuristic method for the close enough traveling salesman problem. 2023, Anais.. Fribourg: Association of European Operational Research Societies, 2023. Disponível em: https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540. Acesso em: 27 set. 2024.APA
Birgin, E. J. G., & Ertel, P. C. R. (2023). A heuristic method for the close enough traveling salesman problem. In Abstracts. Fribourg: Association of European Operational Research Societies. Recuperado de https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540NLM
Birgin EJG, Ertel PCR. A heuristic method for the close enough traveling salesman problem [Internet]. Abstracts. 2023 ;[citado 2024 set. 27 ] Available from: https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540Vancouver
Birgin EJG, Ertel PCR. A heuristic method for the close enough traveling salesman problem [Internet]. Abstracts. 2023 ;[citado 2024 set. 27 ] Available from: https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540
