Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints (2008)
Source: European Journal of Operational Research. Unidade: ICMC
Subjects: HEURÍSTICA, REDES DE COMPUTADORES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Alysson Machado e CORDEAU, Jean-François e LAPORTE, Gilbert. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, v. 190, n. 1, p. 68-78, 2008Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2007.06.012. Acesso em: 24 maio 2024.APA
Costa, A. M., Cordeau, J. -F., & Laporte, G. (2008). Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints. European Journal of Operational Research, 190( 1), 68-78. doi:10.1016/j.ejor.2007.06.012NLM
Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints [Internet]. European Journal of Operational Research. 2008 ; 190( 1): 68-78.[citado 2024 maio 24 ] Available from: https://doi.org/10.1016/j.ejor.2007.06.012Vancouver
Costa AM, Cordeau J-F, Laporte G. Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints [Internet]. European Journal of Operational Research. 2008 ; 190( 1): 68-78.[citado 2024 maio 24 ] Available from: https://doi.org/10.1016/j.ejor.2007.06.012
