Source: Networks. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
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. Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints. Networks, v. 53, n. 2, p. 141-159, 2009Tradução . . Disponível em: https://doi.org/10.1002/net.20274. Acesso em: 15 nov. 2024.APA
Costa, A. M., Cordeau, J. -F., & Laporte, G. (2009). Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints. Networks, 53( 2), 141-159. doi:10.1002/net.20274NLM
Costa AM, Cordeau J-F, Laporte G. Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints [Internet]. Networks. 2009 ; 53( 2): 141-159.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1002/net.20274Vancouver
Costa AM, Cordeau J-F, Laporte G. Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints [Internet]. Networks. 2009 ; 53( 2): 141-159.[citado 2024 nov. 15 ] Available from: https://doi.org/10.1002/net.20274
