ReP USP - Resultado da busca

Artigo de periodico
New exact algorithms for planar maximum covering location by ellipses problems (2021)
Tedeschi, Danilo Françoso ; Andretta, Marina
Source: European Journal of Operational Research. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, ELIPSE
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TEDESCHI, Danilo Françoso e ANDRETTA, Marina. New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, v. 291, n. 1, p. 114-127, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2020.09.029. Acesso em: 20 jul. 2024.
APA
Tedeschi, D. F., & Andretta, M. (2021). New exact algorithms for planar maximum covering location by ellipses problems. European Journal of Operational Research, 291( 1), 114-127. doi:10.1016/j.ejor.2020.09.029
NLM
Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
Vancouver
Tedeschi DF, Andretta M. New exact algorithms for planar maximum covering location by ellipses problems [Internet]. European Journal of Operational Research. 2021 ; 291( 1): 114-127.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
Artigo de periodico
Transversals of longest paths (2020)
Cerioli, Márcia R ; Fernandes, Cristina Gomes ; Gómez, Renzo ; Gutiérrez Alva, Juan Gabriel; Lima, Paloma T
Source: Discrete Mathematics. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERIOLI, Márcia R et al. Transversals of longest paths. Discrete Mathematics, v. 343, n. 3, 2020Tradução . . Disponível em: https://doi.org/10.1016/j.disc.2019.111717. Acesso em: 20 jul. 2024.
APA
Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez Alva, J. G., & Lima, P. T. (2020). Transversals of longest paths. Discrete Mathematics, 343( 3). doi:10.1016/j.disc.2019.111717
NLM
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez Alva JG, Lima PT. Transversals of longest paths [Internet]. Discrete Mathematics. 2020 ; 343( 3):[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.disc.2019.111717
Vancouver
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez Alva JG, Lima PT. Transversals of longest paths [Internet]. Discrete Mathematics. 2020 ; 343( 3):[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.disc.2019.111717
Trabalho de evento-anais periodico
Strong intractability results for generalized convex recoloring problems (2020)
Moura, Phablo Fernando Soares ; Wakabayashi, Yoshiko
Source: Discrete Applied Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. Disponível em: https://doi.org/10.1016/j.dam.2019.08.002. Acesso em: 20 jul. 2024. , 2020
APA
Moura, P. F. S., & Wakabayashi, Y. (2020). Strong intractability results for generalized convex recoloring problems. Discrete Applied Mathematics. Amsterdam: Elsevier. doi:10.1016/j.dam.2019.08.002
NLM
Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002
Vancouver
Moura PFS, Wakabayashi Y. Strong intractability results for generalized convex recoloring problems [Internet]. Discrete Applied Mathematics. 2020 ; 281 252-260.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002
Artigo de periodico
A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts (2019)
Nascimento, Oliviana Xavier do ; Queiroz, Thiago Alves de ; Junqueira, Leonardo
Source: Annals of Operations Research. Unidade: EP
Subjects: PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO LINEAR, PROGRAMAÇÃO POR RESTRIÇÕES, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NASCIMENTO, Oliviana Xavier do e QUEIROZ, Thiago Alves de e JUNQUEIRA, Leonardo. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research, v. 20 No 2019, p. 31 on-line, 2019Tradução . . Disponível em: https://doi.org/10.1007/s10479-019-03466-x. Acesso em: 20 jul. 2024.
APA
Nascimento, O. X. do, Queiroz, T. A. de, & Junqueira, L. (2019). A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts. Annals of Operations Research, 20 No 2019, 31 on-line. doi:10.1007/s10479-019-03466-x
NLM
Nascimento OX do, Queiroz TA de, Junqueira L. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts [Internet]. Annals of Operations Research. 2019 ; 20 No 201931 on-line.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1007/s10479-019-03466-x
Vancouver
Nascimento OX do, Queiroz TA de, Junqueira L. A MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts [Internet]. Annals of Operations Research. 2019 ; 20 No 201931 on-line.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1007/s10479-019-03466-x
Artigo de periodico
Parallel local search algorithms for high school timetabling problems (2018)
Saviniec, Landir; Santos, Maristela Oliveira dos ; Costa, Alysson Machado
Source: European Journal of Operational 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
SAVINIEC, Landir e SANTOS, Maristela Oliveira dos e COSTA, Alysson Machado. Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, v. Fe 2018, n. 1, p. 81-98, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2017.07.029. Acesso em: 20 jul. 2024.
APA
Saviniec, L., Santos, M. O. dos, & Costa, A. M. (2018). Parallel local search algorithms for high school timetabling problems. European Journal of Operational Research, Fe 2018( 1), 81-98. doi:10.1016/j.ejor.2017.07.029
NLM
Saviniec L, Santos MO dos, Costa AM. Parallel local search algorithms for high school timetabling problems [Internet]. European Journal of Operational Research. 2018 ; Fe 2018( 1): 81-98.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2017.07.029
Vancouver
Saviniec L, Santos MO dos, Costa AM. Parallel local search algorithms for high school timetabling problems [Internet]. European Journal of Operational Research. 2018 ; Fe 2018( 1): 81-98.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2017.07.029
Artigo de periodico
An integrated approach for production lot sizing and raw material purchasing (2018)
Cunha, Artur Lovato da; Santos, Maristela Oliveira dos ; Morabito, Reinaldo; Ana Barbosa-Póvoa Ana Barbosa-Póvoa
Source: European Journal of Operational 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
CUNHA, Artur Lovato da et al. An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research, v. 269, n. 3, p. 923-938, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2018.02.042. Acesso em: 20 jul. 2024.
APA
Cunha, A. L. da, Santos, M. O. dos, Morabito, R., & Ana Barbosa-Póvoa Ana Barbosa-Póvoa,. (2018). An integrated approach for production lot sizing and raw material purchasing. European Journal of Operational Research, 269( 3), 923-938. doi:10.1016/j.ejor.2018.02.042
NLM
Cunha AL da, Santos MO dos, Morabito R, Ana Barbosa-Póvoa Ana Barbosa-Póvoa. An integrated approach for production lot sizing and raw material purchasing [Internet]. European Journal of Operational Research. 2018 ; 269( 3): 923-938.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2018.02.042
Vancouver
Cunha AL da, Santos MO dos, Morabito R, Ana Barbosa-Póvoa Ana Barbosa-Póvoa. An integrated approach for production lot sizing and raw material purchasing [Internet]. European Journal of Operational Research. 2018 ; 269( 3): 923-938.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2018.02.042
Artigo de periodico
Multilevel approach for combinatorial optimization in bipartite network (2018)
Valejo, Alan; Oliveira, Maria Cristina Ferreira de ; Filho, Geraldo P. R; Lopes, Alneu de Andrade
Source: Knowledge-Based Systems. Unidade: ICMC
Subjects: REDES COMPLEXAS, OTIMIZAÇÃO COMBINATÓRIA, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VALEJO, Alan et al. Multilevel approach for combinatorial optimization in bipartite network. Knowledge-Based Systems, v. 151, p. 45-61, 2018Tradução . . Disponível em: https://doi.org/10.1016/j.knosys.2018.03.021. Acesso em: 20 jul. 2024.
APA
Valejo, A., Oliveira, M. C. F. de, Filho, G. P. R., & Lopes, A. de A. (2018). Multilevel approach for combinatorial optimization in bipartite network. Knowledge-Based Systems, 151, 45-61. doi:10.1016/j.knosys.2018.03.021
NLM
Valejo A, Oliveira MCF de, Filho GPR, Lopes A de A. Multilevel approach for combinatorial optimization in bipartite network [Internet]. Knowledge-Based Systems. 2018 ; 151 45-61.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.knosys.2018.03.021
Vancouver
Valejo A, Oliveira MCF de, Filho GPR, Lopes A de A. Multilevel approach for combinatorial optimization in bipartite network [Internet]. Knowledge-Based Systems. 2018 ; 151 45-61.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.knosys.2018.03.021
Trabalho de evento-anais periodico
Transversals of longest paths (2017)
Cerioli, Márcia R; Fernandes, Cristina Gomes ; Gómez, Renzo; Gutiérrez, Juan; Lima, Paloma T
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, TEORIA DOS GRAFOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CERIOLI, Márcia R et al. Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2017.10.024. Acesso em: 20 jul. 2024. , 2017
APA
Cerioli, M. R., Fernandes, C. G., Gómez, R., Gutiérrez, J., & Lima, P. T. (2017). Transversals of longest paths. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.024
NLM
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Vancouver
Cerioli MR, Fernandes CG, Gómez R, Gutiérrez J, Lima PT. Transversals of longest paths [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 135-140.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.endm.2017.10.024
Trabalho de evento-anais periodico
Strong intractability of generalized convex recoloring problems (2017)
Moura, Phablo Fernando Soares; Wakabayashi, Yoshiko
Source: Electronic Notes in Discrete Mathematics. Conference titles: Latin and American Algorithms, Graphs and Optimization - LAGOS'17. Unidade: IME
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOURA, Phablo Fernando Soares e WAKABAYASHI, Yoshiko. Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2017.10.017. Acesso em: 20 jul. 2024. , 2017
APA
Moura, P. F. S., & Wakabayashi, Y. (2017). Strong intractability of generalized convex recoloring problems. Electronic Notes in Discrete Mathematics. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2017.10.017
NLM
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Vancouver
Moura PFS, Wakabayashi Y. Strong intractability of generalized convex recoloring problems [Internet]. Electronic Notes in Discrete Mathematics. 2017 ; no 2017 93-98.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.endm.2017.10.017
Artigo de periodico
Optimization based on phylogram analysis (2017)
Soares, Antônio; Rabêlo, Ricardo de Andrade Lira; Delbem, Alexandre Cláudio Botazzo
Source: Expert Systems with Applications. Unidade: ICMC
Subjects: COMPUTAÇÃO EVOLUTIVA, SISTEMAS EMBUTIDOS, ROBÓTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOARES, Antônio e RABÊLO, Ricardo de Andrade Lira e DELBEM, Alexandre Cláudio Botazzo. Optimization based on phylogram analysis. Expert Systems with Applications, v. 78, p. 32-50, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.eswa.2017.02.012. Acesso em: 20 jul. 2024.
APA
Soares, A., Rabêlo, R. de A. L., & Delbem, A. C. B. (2017). Optimization based on phylogram analysis. Expert Systems with Applications, 78, 32-50. doi:10.1016/j.eswa.2017.02.012
NLM
Soares A, Rabêlo R de AL, Delbem ACB. Optimization based on phylogram analysis [Internet]. Expert Systems with Applications. 2017 ; 78 32-50.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.eswa.2017.02.012
Vancouver
Soares A, Rabêlo R de AL, Delbem ACB. Optimization based on phylogram analysis [Internet]. Expert Systems with Applications. 2017 ; 78 32-50.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.eswa.2017.02.012
Artigo de periodico
Decomposition methods for the lot-sizing and cutting-stock problems in paper industries (2017)
Leão, Aline A. S; Furlan, Marcos M; Toledo, Franklina Maria Bragion de
Source: Applied Mathematical Modelling. 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 A. S e FURLAN, Marcos M e TOLEDO, Franklina Maria Bragion de. Decomposition methods for the lot-sizing and cutting-stock problems in paper industries. Applied Mathematical Modelling, v. 48, p. 250-268, 2017Tradução . . Disponível em: https://doi.org/10.1016/j.apm.2017.04.010. Acesso em: 20 jul. 2024.
APA
Leão, A. A. S., Furlan, M. M., & Toledo, F. M. B. de. (2017). Decomposition methods for the lot-sizing and cutting-stock problems in paper industries. Applied Mathematical Modelling, 48, 250-268. doi:10.1016/j.apm.2017.04.010
NLM
Leão AAS, Furlan MM, Toledo FMB de. Decomposition methods for the lot-sizing and cutting-stock problems in paper industries [Internet]. Applied Mathematical Modelling. 2017 ; 48 250-268.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.apm.2017.04.010
Vancouver
Leão AAS, Furlan MM, Toledo FMB de. Decomposition methods for the lot-sizing and cutting-stock problems in paper industries [Internet]. Applied Mathematical Modelling. 2017 ; 48 250-268.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.apm.2017.04.010
Artigo de periodico
A branch-and-bound algorithm for the maximum capture problem with random utilities (2016)
Freire, Alexandre da Silva; Moreno, Eduardo; Yushimito, Wilfredo F.
Source: European Journal of Operational Research. Unidade: EACH
Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FREIRE, Alexandre da Silva e MORENO, Eduardo e YUSHIMITO, Wilfredo F. A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research, v. 252, n. 1, p. 204-212, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2015.12.026. Acesso em: 20 jul. 2024.
APA
Freire, A. da S., Moreno, E., & Yushimito, W. F. (2016). A branch-and-bound algorithm for the maximum capture problem with random utilities. European Journal of Operational Research, 252( 1), 204-212. doi:10.1016/j.ejor.2015.12.026
NLM
Freire A da S, Moreno E, Yushimito WF. A branch-and-bound algorithm for the maximum capture problem with random utilities [Internet]. European Journal of Operational Research. 2016 ; 252( 1): 204-212.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2015.12.026
Vancouver
Freire A da S, Moreno E, Yushimito WF. A branch-and-bound algorithm for the maximum capture problem with random utilities [Internet]. European Journal of Operational Research. 2016 ; 252( 1): 204-212.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2015.12.026
Artigo de periodico
A biased random key genetic algorithm for the field technician scheduling problem (2016)
Damm, Ricardo de Brito; Resende, Mauricio G. C ; Ronconi, Débora Pretti
Source: Computers & Operations Research. Unidade: EP
Subjects: ALGORITMOS GENÉTICOS, HEURÍSTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DAMM, Ricardo de Brito e RESENDE, Mauricio G. C e RONCONI, Débora Pretti. A biased random key genetic algorithm for the field technician scheduling problem. Computers & Operations Research, v. No 2016, p. 49-63, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.cor.2016.05.003. Acesso em: 20 jul. 2024.
APA
Damm, R. de B., Resende, M. G. C., & Ronconi, D. P. (2016). A biased random key genetic algorithm for the field technician scheduling problem. Computers & Operations Research, No 2016, 49-63. doi:10.1016/j.cor.2016.05.003
NLM
Damm R de B, Resende MGC, Ronconi DP. A biased random key genetic algorithm for the field technician scheduling problem [Internet]. Computers & Operations Research. 2016 ; No 2016 49-63.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.cor.2016.05.003
Vancouver
Damm R de B, Resende MGC, Ronconi DP. A biased random key genetic algorithm for the field technician scheduling problem [Internet]. Computers & Operations Research. 2016 ; No 2016 49-63.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.cor.2016.05.003
Artigo de periodico
The envy-free pricing problem, unit-demand markets and connections with the network pricing problem (2016)
Fernandes, Cristina Gomes ; Ferreira, Carlos Eduardo ; Franco, Álvaro Junio Pereira; Schouery, Rafael Crivellari Saliba
Source: Discrete Optimization. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS, TEORIA DOS JOGOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes et al. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discrete Optimization, v. 22, p. 141-191, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.disopt.2015.09.003. Acesso em: 20 jul. 2024.
APA
Fernandes, C. G., Ferreira, C. E., Franco, Á. J. P., & Schouery, R. C. S. (2016). The envy-free pricing problem, unit-demand markets and connections with the network pricing problem. Discrete Optimization, 22, 141-191. doi:10.1016/j.disopt.2015.09.003
NLM
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem [Internet]. Discrete Optimization. 2016 ; 22 141-191.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.disopt.2015.09.003
Vancouver
Fernandes CG, Ferreira CE, Franco ÁJP, Schouery RCS. The envy-free pricing problem, unit-demand markets and connections with the network pricing problem [Internet]. Discrete Optimization. 2016 ; 22 141-191.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.disopt.2015.09.003
Artigo de periodico
Kinetic clustering of points on the line (2016)
Fernandes, Cristina Gomes ; Oshiro, Marcio Takashi Iura
Source: Theoretical Computer Science. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, GEOMETRIA COMPUTACIONAL, ALGORITMOS GEOMÉTRICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e OSHIRO, Marcio Takashi Iura. Kinetic clustering of points on the line. Theoretical Computer Science, v. 639, p. 60-71, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.tcs.2016.05.020. Acesso em: 20 jul. 2024.
APA
Fernandes, C. G., & Oshiro, M. T. I. (2016). Kinetic clustering of points on the line. Theoretical Computer Science, 639, 60-71. doi:10.1016/j.tcs.2016.05.020
NLM
Fernandes CG, Oshiro MTI. Kinetic clustering of points on the line [Internet]. Theoretical Computer Science. 2016 ; 639 60-71.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.tcs.2016.05.020
Vancouver
Fernandes CG, Oshiro MTI. Kinetic clustering of points on the line [Internet]. Theoretical Computer Science. 2016 ; 639 60-71.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.tcs.2016.05.020
Artigo de periodico
Robust mixed-integer linear programming models for the irregular strip packing problem (2016)
Cherri, Luiz Henrique; Mundim, Leandro R; Andretta, Marina ; Toledo, Franklina Maria Bragion de ; Oliveira, José F; Carravilla, Maria Antónia
Source: European Journal of Operational Research. Unidade: ICMC
Subjects: ALGORITMOS, OTIMIZAÇÃO COMBINATÓRIA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
CHERRI, Luiz Henrique et al. Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, v. 253, n. 3, p. 570-583, 2016Tradução . . Disponível em: https://doi.org/10.1016/j.ejor.2016.03.009. Acesso em: 20 jul. 2024.
APA
Cherri, L. H., Mundim, L. R., Andretta, M., Toledo, F. M. B. de, Oliveira, J. F., & Carravilla, M. A. (2016). Robust mixed-integer linear programming models for the irregular strip packing problem. European Journal of Operational Research, 253( 3), 570-583. doi:10.1016/j.ejor.2016.03.009
NLM
Cherri LH, Mundim LR, Andretta M, Toledo FMB de, Oliveira JF, Carravilla MA. Robust mixed-integer linear programming models for the irregular strip packing problem [Internet]. European Journal of Operational Research. 2016 ; 253( 3): 570-583.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2016.03.009
Vancouver
Cherri LH, Mundim LR, Andretta M, Toledo FMB de, Oliveira JF, Carravilla MA. Robust mixed-integer linear programming models for the irregular strip packing problem [Internet]. European Journal of Operational Research. 2016 ; 253( 3): 570-583.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.ejor.2016.03.009
Artigo de periodico
Geodesic stability for memoryless binary long-lived consensus (2015)
Fernandes, Cristina Gomes ; Stein, Maya
Source: Journal of Computer and System Sciences. Unidade: IME
Subjects: OTIMIZAÇÃO COMBINATÓRIA, ANÁLISE DE ALGORITMOS, ALGORITMOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e STEIN, Maya. Geodesic stability for memoryless binary long-lived consensus. Journal of Computer and System Sciences, v. 81, n. 7, p. 1210–1220, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.jcss.2015.03.002. Acesso em: 20 jul. 2024.
APA
Fernandes, C. G., & Stein, M. (2015). Geodesic stability for memoryless binary long-lived consensus. Journal of Computer and System Sciences, 81( 7), 1210–1220. doi:10.1016/j.jcss.2015.03.002
NLM
Fernandes CG, Stein M. Geodesic stability for memoryless binary long-lived consensus [Internet]. Journal of Computer and System Sciences. 2015 ; 81( 7): 1210–1220.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.jcss.2015.03.002
Vancouver
Fernandes CG, Stein M. Geodesic stability for memoryless binary long-lived consensus [Internet]. Journal of Computer and System Sciences. 2015 ; 81( 7): 1210–1220.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.jcss.2015.03.002
Artigo de periodico
Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm (2015)
Arbex, Renato Oliveira ; Cunha, Cláudio Barbieri da
Source: Transportation Research - Part B: Methodological. Unidade: EP
Subjects: TRANSPORTE PÚBLICO, OTIMIZAÇÃO COMBINATÓRIA, ESPAÇO URBANO, TRANSPORTE URBANO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARBEX, Renato Oliveira e CUNHA, Cláudio Barbieri da. Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm. Transportation Research - Part B: Methodological, v. No 2015, p. 355-376, 2015Tradução . . Disponível em: https://doi.org/10.1016/j.trb.2015.06.014. Acesso em: 20 jul. 2024.
APA
Arbex, R. O., & Cunha, C. B. da. (2015). Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm. Transportation Research - Part B: Methodological, No 2015, 355-376. doi:10.1016/j.trb.2015.06.014
NLM
Arbex RO, Cunha CB da. Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm [Internet]. Transportation Research - Part B: Methodological. 2015 ; No 2015 355-376.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.trb.2015.06.014
Vancouver
Arbex RO, Cunha CB da. Efficient transit network design and frequencies setting multi-objective optimization by alternating objective genetic algorithm [Internet]. Transportation Research - Part B: Methodological. 2015 ; No 2015 355-376.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.trb.2015.06.014
Trabalho de evento-anais periodico
Approximating minimum k-section in trees with linear diameter (2015)
Fernandes, Cristina Gomes ; Schmidt, Tina Janne; Taraz, Anusch
Conference titles: Latin-American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: ALGORITMOS DE APROXIMAÇÃO, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERNANDES, Cristina Gomes e SCHMIDT, Tina Janne e TARAZ, Anusch. Approximating minimum k-section in trees with linear diameter. . Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. Disponível em: https://doi.org/10.1016/j.endm.2015.07.013. Acesso em: 20 jul. 2024. , 2015
APA
Fernandes, C. G., Schmidt, T. J., & Taraz, A. (2015). Approximating minimum k-section in trees with linear diameter. Amsterdam: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1016/j.endm.2015.07.013
NLM
Fernandes CG, Schmidt TJ, Taraz A. Approximating minimum k-section in trees with linear diameter [Internet]. 2015 ; 50 71-76.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.endm.2015.07.013
Vancouver
Fernandes CG, Schmidt TJ, Taraz A. Approximating minimum k-section in trees with linear diameter [Internet]. 2015 ; 50 71-76.[citado 2024 jul. 20 ] Available from: https://doi.org/10.1016/j.endm.2015.07.013
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: 20 jul. 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 jul. 20 ] 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 jul. 20 ] Available from: https://doi.org/10.1016/j.cor.2014.12.008

USP Schools

ReP

Filtros

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Conference titles

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration