Source: International Transactions in Operational Research. Unidade: EP
Assunto: ENGENHARIA DE TRANSPORTES
ABNT
CUNHA, Cláudio Barbieri da e SWAIT JR, Joffre Dan. New dominance criteria for the generalized permanent labelling algorithm for the shortest path problem with time windows on dense graphs. International Transactions in Operational Research, v. 7, n. ja 2000, p. 139-157, 2000Tradução . . Disponível em: https://doi.org/10.1111/j.1475-3995.2000.tb00191.x. Acesso em: 05 nov. 2024.APA
Cunha, C. B. da, & Swait Jr, J. D. (2000). New dominance criteria for the generalized permanent labelling algorithm for the shortest path problem with time windows on dense graphs. International Transactions in Operational Research, 7( ja 2000), 139-157. doi:10.1111/j.1475-3995.2000.tb00191.xNLM
Cunha CB da, Swait Jr JD. New dominance criteria for the generalized permanent labelling algorithm for the shortest path problem with time windows on dense graphs [Internet]. International Transactions in Operational Research. 2000 ; 7( ja 2000): 139-157.[citado 2024 nov. 05 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00191.xVancouver
Cunha CB da, Swait Jr JD. New dominance criteria for the generalized permanent labelling algorithm for the shortest path problem with time windows on dense graphs [Internet]. International Transactions in Operational Research. 2000 ; 7( ja 2000): 139-157.[citado 2024 nov. 05 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00191.x