Source: European Journal of Operational Research. Unidade: EP
Subjects: TRANSPORTES, ALGORITMOS E ESTRUTURAS DE DADOS, HEURÍSTICA
ABNT
SILVA, Marcos Roberto e CUNHA, Cláudio Barbieri da. A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. European Journal of Operational Research, v. No 2017, n. 3, p. 954-965, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2017.03.066. Acesso em: 16 out. 2024.APA
Silva, M. R., & Cunha, C. B. da. (2017). A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem. European Journal of Operational Research, No 2017( 3), 954-965. doi:10.1016/j.ejor.2017.03.066NLM
Silva MR, Cunha CB da. A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem [Internet]. European Journal of Operational Research. 2017 ; No 2017( 3): 954-965.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.ejor.2017.03.066Vancouver
Silva MR, Cunha CB da. A tabu search heuristic for the uncapacitated single allocation p-hub maximal covering problem [Internet]. European Journal of Operational Research. 2017 ; No 2017( 3): 954-965.[citado 2024 out. 16 ] Available from: https://doi.org/10.1016/j.ejor.2017.03.066