Cavalcanti, Luísa Brandão 
; Mendes, André Bergsten
Fonte: Computational logistics : proceedings. Nome do evento: International conference, ICCL 2019,. Unidade: EP
Assuntos: REBOCADORES, HEURÍSTICA, ROTEIRIZAÇÃO, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAVALCANTI, Luísa Brandão e MENDES, André Bergsten. A Greedy heuristic for the vehicle routing problem with time windows, synchronization constraints and heterogeneous fleet. 2019, Anais.. Cham, Switzerland: Springer, 2019. Disponível em: https://doi.org/10.1007%2F978-3-030-31140-7_17. Acesso em: 19 jul. 2024.APA
Cavalcanti, L. B., & Mendes, A. B. (2019). A Greedy heuristic for the vehicle routing problem with time windows, synchronization constraints and heterogeneous fleet. In Computational logistics : proceedings. Cham, Switzerland: Springer. doi:10.1007%2F978-3-030-31140-7_17NLM
Cavalcanti LB, Mendes AB. A Greedy heuristic for the vehicle routing problem with time windows, synchronization constraints and heterogeneous fleet [Internet]. Computational logistics : proceedings. 2019 ;[citado 2024 jul. 19 ] Available from: https://doi.org/10.1007%2F978-3-030-31140-7_17Vancouver
Cavalcanti LB, Mendes AB. A Greedy heuristic for the vehicle routing problem with time windows, synchronization constraints and heterogeneous fleet [Internet]. Computational logistics : proceedings. 2019 ;[citado 2024 jul. 19 ] Available from: https://doi.org/10.1007%2F978-3-030-31140-7_17
