ReP USP - Resultado da busca

Filtros : "International Transactions in Operational Research" "EP-PTR" Limpar

Filtros

Artigo de periodico
An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo (2015)
Andrade, Luiz Augusto Canito Gallego de; Cunha, Cláudio Barbieri da
Source: International Transactions in Operational Research. Unidade: EP
Subjects: HEURÍSTICA, SERVIÇO HOSPITALAR DE EMERGÊNCIA, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDRADE, Luiz Augusto Canito Gallego de e CUNHA, Cláudio Barbieri da. An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo. International Transactions in Operational Research, v. 22, n. 3, p. 473–501. Special Issue: Operations Research in Practice, 2015Tradução . . Disponível em: https://doi.org/10.1111/itor.12160. Acesso em: 09 nov. 2025.
APA
Andrade, L. A. C. G. de, & Cunha, C. B. da. (2015). An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo. International Transactions in Operational Research, 22( 3), 473–501. Special Issue: Operations Research in Practice. doi:10.1111/itor.12160
NLM
Andrade LACG de, Cunha CB da. An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo [Internet]. International Transactions in Operational Research. 2015 ; 22( 3): 473–501. Special Issue: Operations Research in Practice.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1111/itor.12160
Vancouver
Andrade LACG de, Cunha CB da. An ABC heuristic for optimizing moveable ambulance station location and vehicle repositioning for the city of São Paulo [Internet]. International Transactions in Operational Research. 2015 ; 22( 3): 473–501. Special Issue: Operations Research in Practice.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1111/itor.12160
Artigo de periodico
New dominance criteria for the generalized permanent labelling algorithm for the shortest path problem with time windows on dense graphs (2000)
Cunha, Cláudio Barbieri da ; Swait Jr, Joffre Dan
Source: International Transactions in Operational Research. Unidade: EP
Assunto: ENGENHARIA DE TRANSPORTES
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
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: 09 nov. 2025.
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.x
NLM
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 2025 nov. 09 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00191.x
Vancouver
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 2025 nov. 09 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00191.x

Digital Library of Intellectual Production of Universidade de São Paulo 2012 - 2025