ReP USP - Resultado da busca

Artigo de periodico
An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (2021)
Ferreira, Kamyla Maria ; Queiroz, Thiago Alves de ; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: EFEITO ESTUFA, MODELOS MATEMÁTICOS, EMBALAGENS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Kamyla Maria e QUEIROZ, Thiago Alves de e TOLEDO, Franklina Maria Bragion de. An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Computers and Operations Research, v. 136, p. 1-27, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2021.105452. Acesso em: 09 nov. 2025.
APA
Ferreira, K. M., Queiroz, T. A. de, & Toledo, F. M. B. de. (2021). An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery. Computers and Operations Research, 136, 1-27. doi:10.1016/j.cor.2021.105452
NLM
Ferreira KM, Queiroz TA de, Toledo FMB de. An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery [Internet]. Computers and Operations Research. 2021 ; 136 1-27.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2021.105452
Vancouver
Ferreira KM, Queiroz TA de, Toledo FMB de. An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery [Internet]. Computers and Operations Research. 2021 ; 136 1-27.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2021.105452
Artigo de periodico
Exact approaches for the cutting path determination problem (2019)
Silva, Everton Fernandes da ; Oliveira, Larissa Tebaldi de ; Oliveira, José Fernando ; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: CORTE, PRODUÇÃO INDUSTRIAL, ALGORITMOS ÚTEIS E ESPECÍFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Everton Fernandes da et al. Exact approaches for the cutting path determination problem. Computers and Operations Research, v. 112, p. 1-14, 2019Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2019.104772. Acesso em: 09 nov. 2025.
APA
Silva, E. F. da, Oliveira, L. T. de, Oliveira, J. F., & Toledo, F. M. B. de. (2019). Exact approaches for the cutting path determination problem. Computers and Operations Research, 112, 1-14. doi:10.1016/j.cor.2019.104772
NLM
Silva EF da, Oliveira LT de, Oliveira JF, Toledo FMB de. Exact approaches for the cutting path determination problem [Internet]. Computers and Operations Research. 2019 ; 112 1-14.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2019.104772
Vancouver
Silva EF da, Oliveira LT de, Oliveira JF, Toledo FMB de. Exact approaches for the cutting path determination problem [Internet]. Computers and Operations Research. 2019 ; 112 1-14.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2019.104772
Artigo de periodico
A clique covering MIP model for the irregular strip packing problem (2017)
Rodrigues, Marcos Okamura; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RODRIGUES, Marcos Okamura e TOLEDO, Franklina Maria Bragion de. A clique covering MIP model for the irregular strip packing problem. Computers and Operations Research, v. No 2017, p. 221-234, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2016.11.006. Acesso em: 09 nov. 2025.
APA
Rodrigues, M. O., & Toledo, F. M. B. de. (2017). A clique covering MIP model for the irregular strip packing problem. Computers and Operations Research, No 2017, 221-234. doi:10.1016/j.cor.2016.11.006
NLM
Rodrigues MO, Toledo FMB de. A clique covering MIP model for the irregular strip packing problem [Internet]. Computers and Operations Research. 2017 ; No 2017 221-234.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
Vancouver
Rodrigues MO, Toledo FMB de. A clique covering MIP model for the irregular strip packing problem [Internet]. Computers and Operations Research. 2017 ; No 2017 221-234.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
Artigo de periodico
A knapsack problem as a tool to solve the production planning problem in small foundries (2012)
Camargo, Victor Claudio Bento de; Mattiolli, Leandro; Toledo, Franklina Maria Bragion de
Fonte: Computers and Operations Research. Unidade: ICMC
Assunto: OTIMIZAÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CAMARGO, Victor Claudio Bento de e MATTIOLLI, Leandro e TOLEDO, Franklina Maria Bragion de. A knapsack problem as a tool to solve the production planning problem in small foundries. Computers and Operations Research, v. 39, n. Ja 2012, p. 86-92, 2012Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2010.10.023. Acesso em: 09 nov. 2025.
APA
Camargo, V. C. B. de, Mattiolli, L., & Toledo, F. M. B. de. (2012). A knapsack problem as a tool to solve the production planning problem in small foundries. Computers and Operations Research, 39( Ja 2012), 86-92. doi:10.1016/j.cor.2010.10.023
NLM
Camargo VCB de, Mattiolli L, Toledo FMB de. A knapsack problem as a tool to solve the production planning problem in small foundries [Internet]. Computers and Operations Research. 2012 ; 39( Ja 2012): 86-92.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2010.10.023
Vancouver
Camargo VCB de, Mattiolli L, Toledo FMB de. A knapsack problem as a tool to solve the production planning problem in small foundries [Internet]. Computers and Operations Research. 2012 ; 39( Ja 2012): 86-92.[citado 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2010.10.023

Unidades USP

ReP

Filtros

Autores

Assuntos

Agência de fomento

Indexado em