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

Unidades USP

ReP

Filtros

Autores