ReP USP - Resultado da busca

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
Source: Computers and Operations Research. Unidade: ICMC
Subjects: 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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] 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
Source: Computers and Operations Research. Unidade: ICMC
Subjects: 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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] 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
Source: Computers and Operations Research. Unidade: ICMC
Subjects: 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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2014.03.008
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
Source: 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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] 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
Source: 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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] 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
Source: 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

USP Schools

ReP

Filtros

Authors

Subjects