ReP USP - Resultado da busca

Artigo de periodico
Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window (2023)
Rolim, Gustavo Alencar; Nagano, Marcelo Seido ; Prata, Bruno de Athayde
Fonte: Computers and Operations Research. Unidade: EESC
Assuntos: BENCHMARKS, HEURÍSTICA, SEMICONDUTORES, ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ROLIM, Gustavo Alencar e NAGANO, Marcelo Seido e PRATA, Bruno de Athayde. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, v. 153, p. 1-18, 2023Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2023.106159. Acesso em: 06 jun. 2024.
APA
Rolim, G. A., Nagano, M. S., & Prata, B. de A. (2023). Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window. Computers and Operations Research, 153, 1-18. doi:10.1016/j.cor.2023.106159
NLM
Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
Vancouver
Rolim GA, Nagano MS, Prata B de A. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window [Internet]. Computers and Operations Research. 2023 ; 153 1-18.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2023.106159
Artigo de periodico
New efficient heuristics for scheduling open shops with makespan minimization (2022)
Abreu, Levi Ribeiro de; Prata, Bruno de Athayde; Framinan, José Manuel; Nagano, Marcelo Seido
Fonte: Computers and Operations Research. Unidade: EESC
Assunto: ENGENHARIA DE PRODUÇÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ABREU, Levi Ribeiro de et al. New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, v. 142, p. 1-21, 2022Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2022.105744. Acesso em: 06 jun. 2024.
APA
Abreu, L. R. de, Prata, B. de A., Framinan, J. M., & Nagano, M. S. (2022). New efficient heuristics for scheduling open shops with makespan minimization. Computers and Operations Research, 142, 1-21. doi:10.1016/j.cor.2022.105744
NLM
Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
Vancouver
Abreu LR de, Prata B de A, Framinan JM, Nagano MS. New efficient heuristics for scheduling open shops with makespan minimization [Internet]. Computers and Operations Research. 2022 ; 142 1-21.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2022.105744
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: 06 jun. 2024.
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 2024 jun. 06 ] 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 2024 jun. 06 ] 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: 06 jun. 2024.
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 2024 jun. 06 ] 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 2024 jun. 06 ] 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: 06 jun. 2024.
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 2024 jun. 06 ] 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 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2016.11.006
Artigo de periodico
Intelligent-guided adaptive search for the maximum covering location problem (2017)
Máximo, Vinícius R; Nascimento, Mariá C. V; Carvalho, André Carlos Ponce de Leon Ferreira de
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: INTELIGÊNCIA ARTIFICIAL, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MÁXIMO, Vinícius R e NASCIMENTO, Mariá C. V e CARVALHO, André Carlos Ponce de Leon Ferreira de. Intelligent-guided adaptive search for the maximum covering location problem. Computers and Operations Research, v. 78, p. 129-137, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2016.08.018. Acesso em: 06 jun. 2024.
APA
Máximo, V. R., Nascimento, M. C. V., & Carvalho, A. C. P. de L. F. de. (2017). Intelligent-guided adaptive search for the maximum covering location problem. Computers and Operations Research, 78, 129-137. doi:10.1016/j.cor.2016.08.018
NLM
Máximo VR, Nascimento MCV, Carvalho ACP de LF de. Intelligent-guided adaptive search for the maximum covering location problem [Internet]. Computers and Operations Research. 2017 ; 78 129-137.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2016.08.018
Vancouver
Máximo VR, Nascimento MCV, Carvalho ACP de LF de. Intelligent-guided adaptive search for the maximum covering location problem [Internet]. Computers and Operations Research. 2017 ; 78 129-137.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2016.08.018
Artigo de periodico
Mathematical programming-based approaches for multi-facility glass container production planning (2016)
Toledo, Claudio Fabiano Motta; Arantes, Márcio da Silva; Hossomi, Marcelo Yukio Bressan; Almada-Lobo, Bernardo
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: SISTEMAS EMBUTIDOS, COMPUTAÇÃO EVOLUTIVA, ROBÓTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOLEDO, Claudio Fabiano Motta et al. Mathematical programming-based approaches for multi-facility glass container production planning. Computers and Operations Research, v. 74, p. 92-107, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2016.02.019. Acesso em: 06 jun. 2024.
APA
Toledo, C. F. M., Arantes, M. da S., Hossomi, M. Y. B., & Almada-Lobo, B. (2016). Mathematical programming-based approaches for multi-facility glass container production planning. Computers and Operations Research, 74, 92-107. doi:10.1016/j.cor.2016.02.019
NLM
Toledo CFM, Arantes M da S, Hossomi MYB, Almada-Lobo B. Mathematical programming-based approaches for multi-facility glass container production planning [Internet]. Computers and Operations Research. 2016 ; 74 92-107.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2016.02.019
Vancouver
Toledo CFM, Arantes M da S, Hossomi MYB, Almada-Lobo B. Mathematical programming-based approaches for multi-facility glass container production planning [Internet]. Computers and Operations Research. 2016 ; 74 92-107.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2016.02.019
Artigo de periodico
Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines (2015)
Furlan, Marcos; Almada-Lobo, Bernardo; Santos, Maristela Oliveira dos ; Morabito, Reinaldo
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FURLAN, Marcos et al. Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines. Computers and Operations Research, v. 59, p. 33-50, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2014.12.008. Acesso em: 06 jun. 2024.
APA
Furlan, M., Almada-Lobo, B., Santos, M. O. dos, & Morabito, R. (2015). Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines. Computers and Operations Research, 59, 33-50. doi:10.1016/j.cor.2014.12.008
NLM
Furlan M, Almada-Lobo B, Santos MO dos, Morabito R. Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines [Internet]. Computers and Operations Research. 2015 ; 59 33-50.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2014.12.008
Vancouver
Furlan M, Almada-Lobo B, Santos MO dos, Morabito R. Unequal individual genetic algorithm with intelligent diversification for the lot-scheduling problem in integrated mills using multiple-paper machines [Internet]. Computers and Operations Research. 2015 ; 59 33-50.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2014.12.008
Artigo de periodico
Determining the K-best solutions of knapsack problems (2014)
Leão, Aline Aparecida de Souza; Cherri, Luiz H; Arenales, Marcos Nereu
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
LEÃO, Aline Aparecida de Souza e CHERRI, Luiz H e ARENALES, Marcos Nereu. Determining the K-best solutions of knapsack problems. Computers and Operations Research, v. 49, p. 71-82, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2014.03.008. Acesso em: 06 jun. 2024.
APA
Leão, A. A. de S., Cherri, L. H., & Arenales, M. N. (2014). Determining the K-best solutions of knapsack problems. Computers and Operations Research, 49, 71-82. doi:10.1016/j.cor.2014.03.008
NLM
Leão AA de S, Cherri LH, Arenales MN. Determining the K-best solutions of knapsack problems [Internet]. Computers and Operations Research. 2014 ; 49 71-82.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008
Vancouver
Leão AA de S, Cherri LH, Arenales MN. Determining the K-best solutions of knapsack problems [Internet]. Computers and Operations Research. 2014 ; 49 71-82.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008
Artigo de periodico
A genetic algorithm/mathematical programming approach to solve a two-levels of tdrink production problem (2014)
Toledo, Claudio Fabiano Motta ; Oliveira, Lucas de; Pereira, Rodrigo de Freitas; França, Paulo Morelato ; Morabito, Reinaldo
Fonte: Computers and Operations Research. Unidade: ICMC
Assuntos: ALGORITMOS GENÉTICOS, PROGRAMAÇÃO LINEAR, COMPUTAÇÃO APLICADA, PLANEJAMENTO DA PRODUÇÃO, INDÚSTRIA DE BEBIDAS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TOLEDO, Claudio Fabiano Motta et al. A genetic algorithm/mathematical programming approach to solve a two-levels of tdrink production problem. Computers and Operations Research, v. 48, p. 40-52, 2014Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2014.02.012. Acesso em: 06 jun. 2024.
APA
Toledo, C. F. M., Oliveira, L. de, Pereira, R. de F., França, P. M., & Morabito, R. (2014). A genetic algorithm/mathematical programming approach to solve a two-levels of tdrink production problem. Computers and Operations Research, 48, 40-52. doi:10.1016/j.cor.2014.02.012
NLM
Toledo CFM, Oliveira L de, Pereira R de F, França PM, Morabito R. A genetic algorithm/mathematical programming approach to solve a two-levels of tdrink production problem [Internet]. Computers and Operations Research. 2014 ; 48 40-52.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2014.02.012
Vancouver
Toledo CFM, Oliveira L de, Pereira R de F, França PM, Morabito R. A genetic algorithm/mathematical programming approach to solve a two-levels of tdrink production problem [Internet]. Computers and Operations Research. 2014 ; 48 40-52.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2014.02.012
Artigo de periodico
A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging (2013)
Toledo, Claudio Fabiano Motta; Oliveira, Renato Resende Ribeiro de; França, Paulo Morelato
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
TOLEDO, Claudio Fabiano Motta e OLIVEIRA, Renato Resende Ribeiro de e FRANÇA, Paulo Morelato. A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Computers and Operations Research, v. 40, n. 4, p. 910\2013919, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2012.11.002. Acesso em: 06 jun. 2024.
APA
Toledo, C. F. M., Oliveira, R. R. R. de, & França, P. M. (2013). A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging. Computers and Operations Research, 40( 4), 910\2013919. doi:10.1016/j.cor.2012.11.002
NLM
Toledo CFM, Oliveira RRR de, França PM. A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging [Internet]. Computers and Operations Research. 2013 ; 40( 4): 910\2013919.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2012.11.002
Vancouver
Toledo CFM, Oliveira RRR de, França PM. A hybrid multi-population genetic algorithm applied to solve the multi-level capacitated lot sizing problem with backlogging [Internet]. Computers and Operations Research. 2013 ; 40( 4): 910\2013919.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2012.11.002
Artigo de periodico
A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry (2013)
Figueira, Gonçalo; Santos, Maristela Oliveira dos ; Almada-Lobo, Bernardo
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
FIGUEIRA, Gonçalo e SANTOS, Maristela Oliveira dos e ALMADA-LOBO, Bernardo. A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry. Computers and Operations Research, v. 40, n. 7, p. 1804-1818, 2013Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2013.01.015. Acesso em: 06 jun. 2024.
APA
Figueira, G., Santos, M. O. dos, & Almada-Lobo, B. (2013). A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry. Computers and Operations Research, 40( 7), 1804-1818. doi:10.1016/j.cor.2013.01.015
NLM
Figueira G, Santos MO dos, Almada-Lobo B. A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry [Internet]. Computers and Operations Research. 2013 ; 40( 7): 1804-1818.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2013.01.015
Vancouver
Figueira G, Santos MO dos, Almada-Lobo B. A hybrid VNS approach for the short-term production planning and scheduling: a case study in the pulp and paper industry [Internet]. Computers and Operations Research. 2013 ; 40( 7): 1804-1818.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2013.01.015
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: 06 jun. 2024.
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 2024 jun. 06 ] 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 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2010.10.023
Artigo de periodico
Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization (2006)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário ; Nishihara, F. H.; Ronconi, Débora Pretti
Fonte: Computers and Operations Research. Unidades: IME, EP
Assunto: PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg et al. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Computers and Operations Research, v. 33, n. 12, p. 3535-3548, 2006Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2005.03.031. Acesso em: 06 jun. 2024.
APA
Birgin, E. J. G., Martínez, J. M., Nishihara, F. H., & Ronconi, D. P. (2006). Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization. Computers and Operations Research, 33( 12), 3535-3548. doi:10.1016/j.cor.2005.03.031
NLM
Birgin EJG, Martínez JM, Nishihara FH, Ronconi DP. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization [Internet]. Computers and Operations Research. 2006 ; 33( 12): 3535-3548.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2005.03.031
Vancouver
Birgin EJG, Martínez JM, Nishihara FH, Ronconi DP. Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization [Internet]. Computers and Operations Research. 2006 ; 33( 12): 3535-3548.[citado 2024 jun. 06 ] Available from: https://doi.org/10.1016/j.cor.2005.03.031

Unidades USP

ReP

Filtros

Departamento

Autores

Autores USP

Ano de publicação

Assuntos

Agência de fomento

Indexado em

Afiliação dos autores externos normalizada

Afiliação dos autores externos não normalizada