ReP USP - Resultado da busca

Artigo de periodico
Linear programming applied to the flower sector: a gladiolus bulb production case study (2000)
Caixeta Filho, José Vicente ; Swaay-Neto, J M V; Lopes, R L
Fonte: International Transactions in Operational Research. Unidade: ESALQ
Assuntos: PROGRAMAÇÃO LINEAR, PLANTAS ORNAMENTAIS, FLORICULTURA, PRODUÇÃO INDUSTRIAL, GLADÍOLO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAIXETA FILHO, José Vicente e SWAAY-NETO, J M V e LOPES, R L. Linear programming applied to the flower sector: a gladiolus bulb production case study. International Transactions in Operational Research, v. 7, p. 525-537, 2000Tradução . . Disponível em: https://doi.org/10.1111/j.1475-3995.2000.tb00215.x. Acesso em: 11 nov. 2025.
APA
Caixeta Filho, J. V., Swaay-Neto, J. M. V., & Lopes, R. L. (2000). Linear programming applied to the flower sector: a gladiolus bulb production case study. International Transactions in Operational Research, 7, 525-537. doi:10.1111/j.1475-3995.2000.tb00215.x
NLM
Caixeta Filho JV, Swaay-Neto JMV, Lopes RL. Linear programming applied to the flower sector: a gladiolus bulb production case study [Internet]. International Transactions in Operational Research. 2000 ; 7 525-537.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00215.x
Vancouver
Caixeta Filho JV, Swaay-Neto JMV, Lopes RL. Linear programming applied to the flower sector: a gladiolus bulb production case study [Internet]. International Transactions in Operational Research. 2000 ; 7 525-537.[citado 2025 nov. 11 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00215.x
Artigo de periodico
Linear programming applied to the flower sector: a gladiolus bulb production case study (2000)
Caixeta Filho, José Vicente ; Van-Swaay Neto, J. M.; Lopes, R. L.
Fonte: International Transactions in Operational Research. Unidade: ESALQ
Assuntos: BULBOS, FLORICULTURA, GLADÍOLO, PROGRAMAÇÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAIXETA FILHO, José Vicente e VAN-SWAAY NETO, J. M. e LOPES, R. L. Linear programming applied to the flower sector: a gladiolus bulb production case study. International Transactions in Operational Research, v. 7, p. 525-537, 2000Tradução . . Disponível em: http://onlinelibrary.wiley.com/doi/10.1111/j.1475-3995.2000.tb00215.x/epdf. Acesso em: 11 nov. 2025.
APA
Caixeta Filho, J. V., Van-Swaay Neto, J. M., & Lopes, R. L. (2000). Linear programming applied to the flower sector: a gladiolus bulb production case study. International Transactions in Operational Research, 7, 525-537. Recuperado de http://onlinelibrary.wiley.com/doi/10.1111/j.1475-3995.2000.tb00215.x/epdf
NLM
Caixeta Filho JV, Van-Swaay Neto JM, Lopes RL. Linear programming applied to the flower sector: a gladiolus bulb production case study [Internet]. International Transactions in Operational Research. 2000 ; 7 525-537.[citado 2025 nov. 11 ] Available from: http://onlinelibrary.wiley.com/doi/10.1111/j.1475-3995.2000.tb00215.x/epdf
Vancouver
Caixeta Filho JV, Van-Swaay Neto JM, Lopes RL. Linear programming applied to the flower sector: a gladiolus bulb production case study [Internet]. International Transactions in Operational Research. 2000 ; 7 525-537.[citado 2025 nov. 11 ] Available from: http://onlinelibrary.wiley.com/doi/10.1111/j.1475-3995.2000.tb00215.x/epdf
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
Fonte: 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: 11 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. 11 ] 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. 11 ] Available from: https://doi.org/10.1111/j.1475-3995.2000.tb00191.x

Unidades USP

ReP

Filtros

Autores

Assuntos