ReP USP - Resultado da busca

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
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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] Available from: https://doi.org/10.1016/j.cor.2016.08.018
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: 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
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: 09 nov. 2025.
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 2025 nov. 09 ] 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 2025 nov. 09 ] 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: 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
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: 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
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

Indexado em

Afiliação dos autores externos normalizada