ReP USP - Resultado da busca

Artigo de periodico
Density of identifying codes of hexagonal grids with finite number of rows (2024)
Sampaio, Rudini Menezes ; Sobral, Gabriel Augusto Gonçalves ; Wakabayashi, Yoshiko
Source: RAIRO - Operations Research. Unidades: IME, BIOINFORMÁTICA
Subjects: TEORIA DA INFORMAÇÃO, TEORIA DA COMUNICAÇÃO, TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SAMPAIO, Rudini Menezes e SOBRAL, Gabriel Augusto Gonçalves e WAKABAYASHI, Yoshiko. Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, v. 58, n. 2, p. 1633-1651, 2024Tradução . . Disponível em: https://doi.org/10.1051/ro/2024046. Acesso em: 05 out. 2024.
APA
Sampaio, R. M., Sobral, G. A. G., & Wakabayashi, Y. (2024). Density of identifying codes of hexagonal grids with finite number of rows. RAIRO - Operations Research, 58( 2), 1633-1651. doi:10.1051/ro/2024046
NLM
Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2024 out. 05 ] Available from: https://doi.org/10.1051/ro/2024046
Vancouver
Sampaio RM, Sobral GAG, Wakabayashi Y. Density of identifying codes of hexagonal grids with finite number of rows [Internet]. RAIRO - Operations Research. 2024 ; 58( 2): 1633-1651.[citado 2024 out. 05 ] Available from: https://doi.org/10.1051/ro/2024046
Artigo de periodico
Mathematical model with pressure constraints to minimize electric energy costs in the operation of hydraulic pumps (2023)
Miquelin, Leticia Maria ; Santos, Maristela Oliveira dos ; Furlan, Marcos Mansano ; Soler, Edilaine Martins
Source: IEEE Latin America Transactions. Unidade: ICMC
Subjects: ELETRICIDADE, ABASTECIMENTO DE ÁGUA, BOMBAS HIDRÁULICAS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MIQUELIN, Leticia Maria et al. Mathematical model with pressure constraints to minimize electric energy costs in the operation of hydraulic pumps. IEEE Latin America Transactions, v. 21, n. 3, p. 483-489, 2023Tradução . . Disponível em: https://doi.org/10.1109/TLA.2023.10068836. Acesso em: 05 out. 2024.
APA
Miquelin, L. M., Santos, M. O. dos, Furlan, M. M., & Soler, E. M. (2023). Mathematical model with pressure constraints to minimize electric energy costs in the operation of hydraulic pumps. IEEE Latin America Transactions, 21( 3), 483-489. doi:10.1109/TLA.2023.10068836
NLM
Miquelin LM, Santos MO dos, Furlan MM, Soler EM. Mathematical model with pressure constraints to minimize electric energy costs in the operation of hydraulic pumps [Internet]. IEEE Latin America Transactions. 2023 ; 21( 3): 483-489.[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/TLA.2023.10068836
Vancouver
Miquelin LM, Santos MO dos, Furlan MM, Soler EM. Mathematical model with pressure constraints to minimize electric energy costs in the operation of hydraulic pumps [Internet]. IEEE Latin America Transactions. 2023 ; 21( 3): 483-489.[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/TLA.2023.10068836
Trabalho de evento-resumo
A heuristic method for the close enough traveling salesman problem (2023)
Birgin, Ernesto Julian Goldberg ; Ertel, Paula Cristina Rohr
Source: Abstracts. Conference titles: Conference of the International Federation of Operational Research Societies - IFORS. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e ERTEL, Paula Cristina Rohr. A heuristic method for the close enough traveling salesman problem. 2023, Anais.. Fribourg: Association of European Operational Research Societies, 2023. Disponível em: https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540. Acesso em: 05 out. 2024.
APA
Birgin, E. J. G., & Ertel, P. C. R. (2023). A heuristic method for the close enough traveling salesman problem. In Abstracts. Fribourg: Association of European Operational Research Societies. Recuperado de https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540
NLM
Birgin EJG, Ertel PCR. A heuristic method for the close enough traveling salesman problem [Internet]. Abstracts. 2023 ;[citado 2024 out. 05 ] Available from: https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540
Vancouver
Birgin EJG, Ertel PCR. A heuristic method for the close enough traveling salesman problem [Internet]. Abstracts. 2023 ;[citado 2024 out. 05 ] Available from: https://www.euro-online.org/conf/ifors2023/treat_abstract?paperid=540
Artigo de periodico
A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem (2022)
Viana, Monique Simplicio ; Contreras, Rodrigo Colnago ; Morandin Junior, Orides
Source: Sensors. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANA, Monique Simplicio e CONTRERAS, Rodrigo Colnago e MORANDIN JUNIOR, Orides. A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem. Sensors, v. 22, p. 1-26, 2022Tradução . . Disponível em: https://doi.org/10.3390/s22124561. Acesso em: 05 out. 2024.
APA
Viana, M. S., Contreras, R. C., & Morandin Junior, O. (2022). A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem. Sensors, 22, 1-26. doi:10.3390/s22124561
NLM
Viana MS, Contreras RC, Morandin Junior O. A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem [Internet]. Sensors. 2022 ; 22 1-26.[citado 2024 out. 05 ] Available from: https://doi.org/10.3390/s22124561
Vancouver
Viana MS, Contreras RC, Morandin Junior O. A new frequency analysis operator for population improvement in genetic algorithms to solve the job shop scheduling problem [Internet]. Sensors. 2022 ; 22 1-26.[citado 2024 out. 05 ] Available from: https://doi.org/10.3390/s22124561
Trabalho de evento
Approximations for the Steiner multicycle problem (2022)
Fernandes, Cristina Gomes ; Lintzmayer, Carla Negri ; Moura, Phablo Fernando Soares
Source: Proceedings. Conference titles: Latin American Symposium on Theoretical Informatics - LATIN. 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 LINTZMAYER, Carla Negri e MOURA, Phablo Fernando Soares. Approximations for the Steiner multicycle problem. 2022, Anais.. Cham: Instituto de Matemática e Estatística, Universidade de São Paulo, 2022. Disponível em: https://doi.org/10.1007/978-3-031-20624-5_12. Acesso em: 05 out. 2024.
APA
Fernandes, C. G., Lintzmayer, C. N., & Moura, P. F. S. (2022). Approximations for the Steiner multicycle problem. In Proceedings. Cham: Instituto de Matemática e Estatística, Universidade de São Paulo. doi:10.1007/978-3-031-20624-5_12
NLM
Fernandes CG, Lintzmayer CN, Moura PFS. Approximations for the Steiner multicycle problem [Internet]. Proceedings. 2022 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_12
Vancouver
Fernandes CG, Lintzmayer CN, Moura PFS. Approximations for the Steiner multicycle problem [Internet]. Proceedings. 2022 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-031-20624-5_12
Artigo de periodico
Acoustic levitation of a Mie sphere using a 2D transducer array (2021)
Zehnter, Sebastian ; Andrade, Marco Aurélio Brizzotti ; Ament, Christoph
Source: Journal of Applied Physics. Unidade: IF
Subjects: ACÚSTICA, ACÚSTICA, OTIMIZAÇÃO COMBINATÓRIA, MATLAB
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ZEHNTER, Sebastian e ANDRADE, Marco Aurélio Brizzotti e AMENT, Christoph. Acoustic levitation of a Mie sphere using a 2D transducer array. Journal of Applied Physics, v. 129, n. 13, 2021Tradução . . Disponível em: https://doi.org/10.1063/5.0037344. Acesso em: 05 out. 2024.
APA
Zehnter, S., Andrade, M. A. B., & Ament, C. (2021). Acoustic levitation of a Mie sphere using a 2D transducer array. Journal of Applied Physics, 129( 13). doi:10.1063/5.0037344
NLM
Zehnter S, Andrade MAB, Ament C. Acoustic levitation of a Mie sphere using a 2D transducer array [Internet]. Journal of Applied Physics. 2021 ; 129( 13):[citado 2024 out. 05 ] Available from: https://doi.org/10.1063/5.0037344
Vancouver
Zehnter S, Andrade MAB, Ament C. Acoustic levitation of a Mie sphere using a 2D transducer array [Internet]. Journal of Applied Physics. 2021 ; 129( 13):[citado 2024 out. 05 ] Available from: https://doi.org/10.1063/5.0037344
Trabalho de evento-anais periodico
A graph-based crossover and soft-repair operators for the steiner tree problem (2021)
Godoi, Giliard Almeida de; Tinós, Renato ; Sanches, Danilo Sipoli
Source: Lecture Notes in Computer Science. Conference titles: Brazilian Conference on Intelligent Systems - BRACIS. Unidade: FFCLRP
Subjects: TEORIA DOS GRAFOS, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS GENÉTICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
GODOI, Giliard Almeida de e TINÓS, Renato e SANCHES, Danilo Sipoli. A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-91702-9_8. Acesso em: 05 out. 2024. , 2021
APA
Godoi, G. A. de, Tinós, R., & Sanches, D. S. (2021). A graph-based crossover and soft-repair operators for the steiner tree problem. Lecture Notes in Computer Science. Cham: Springer. doi:10.1007/978-3-030-91702-9_8
NLM
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
Vancouver
Godoi GA de, Tinós R, Sanches DS. A graph-based crossover and soft-repair operators for the steiner tree problem [Internet]. Lecture Notes in Computer Science. 2021 ; 13073 111-125.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-030-91702-9_8
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: 05 out. 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 out. 05 ] 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 out. 05 ] Available from: https://doi.org/10.1016/j.ejor.2020.09.029
Artigo de periodico
Meta-heuristics for the one-dimensional cutting stock problem with usable leftover (2020)
Ravelo, Santiago Valdés ; Meneses, Cláudio Nogueira de ; Santos, Maristela Oliveira dos
Source: Journal of Heuristics. Unidade: ICMC
Subjects: HEURÍSTICA, OTIMIZAÇÃO COMBINATÓRIA, ALGORITMOS ÚTEIS E ESPECÍFICOS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
RAVELO, Santiago Valdés e MENESES, Cláudio Nogueira de e SANTOS, Maristela Oliveira dos. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. Journal of Heuristics, v. 26, p. 585-618, 2020Tradução . . Disponível em: https://doi.org/10.1007/s10732-020-09443-z. Acesso em: 05 out. 2024.
APA
Ravelo, S. V., Meneses, C. N. de, & Santos, M. O. dos. (2020). Meta-heuristics for the one-dimensional cutting stock problem with usable leftover. Journal of Heuristics, 26, 585-618. doi:10.1007/s10732-020-09443-z
NLM
Ravelo SV, Meneses CN de, Santos MO dos. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover [Internet]. Journal of Heuristics. 2020 ; 26 585-618.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s10732-020-09443-z
Vancouver
Ravelo SV, Meneses CN de, Santos MO dos. Meta-heuristics for the one-dimensional cutting stock problem with usable leftover [Internet]. Journal of Heuristics. 2020 ; 26 585-618.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s10732-020-09443-z
Artigo de periodico
A new generalized partition crossover for the traveling salesman problem: tunneling between local optima (2020)
Tinós, Renato ; Whitley, Darrell; Ochoa, Gabriela
Source: Evolutionary Computation. Unidade: FFCLRP
Subjects: COMPUTAÇÃO EVOLUTIVA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato e WHITLEY, Darrell e OCHOA, Gabriela. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation, v. 28, n. 2, p. 255-288, 2020Tradução . . Disponível em: https://doi.org/10.1162/evco_a_00254. Acesso em: 05 out. 2024.
APA
Tinós, R., Whitley, D., & Ochoa, G. (2020). A new generalized partition crossover for the traveling salesman problem: tunneling between local optima. Evolutionary Computation, 28( 2), 255-288. doi:10.1162/evco_a_00254
NLM
Tinós R, Whitley D, Ochoa G. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima [Internet]. Evolutionary Computation. 2020 ; 28( 2): 255-288.[citado 2024 out. 05 ] Available from: https://doi.org/10.1162/evco_a_00254
Vancouver
Tinós R, Whitley D, Ochoa G. A new generalized partition crossover for the traveling salesman problem: tunneling between local optima [Internet]. Evolutionary Computation. 2020 ; 28( 2): 255-288.[citado 2024 out. 05 ] Available from: https://doi.org/10.1162/evco_a_00254
Artigo de periodico
A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem (2020)
Viana, Monique Simplicio ; Morandin Junior, Orides ; Contreras, Rodrigo Colnago
Source: Sensors. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA, SCHEDULING
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANA, Monique Simplicio e MORANDIN JUNIOR, Orides e CONTRERAS, Rodrigo Colnago. A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem. Sensors, v. 20, n. 18, p. Se 2020, 2020Tradução . . Disponível em: https://doi.org/10.3390/s20185440. Acesso em: 05 out. 2024.
APA
Viana, M. S., Morandin Junior, O., & Contreras, R. C. (2020). A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem. Sensors, 20( 18), Se 2020. doi:10.3390/s20185440
NLM
Viana MS, Morandin Junior O, Contreras RC. A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem [Internet]. Sensors. 2020 ; 20( 18): Se 2020.[citado 2024 out. 05 ] Available from: https://doi.org/10.3390/s20185440
Vancouver
Viana MS, Morandin Junior O, Contreras RC. A modified genetic algorithm with local search strategies and multi-crossover operator for Job Shop Scheduling Problem [Internet]. Sensors. 2020 ; 20( 18): Se 2020.[citado 2024 out. 05 ] Available from: https://doi.org/10.3390/s20185440
Trabalho de evento
Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem (2020)
Viana, Monique Simplicio ; Morandin Junior, Orides ; Contreras, Rodrigo Colnago
Source: Proceedings. Conference titles: International Conference on Agents and Artificial Intelligence - ICAART. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANA, Monique Simplicio e MORANDIN JUNIOR, Orides e CONTRERAS, Rodrigo Colnago. Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem. 2020, Anais.. Lisboa: SciTePress, 2020. Disponível em: https://doi.org/10.5220/0008937004630474. Acesso em: 05 out. 2024.
APA
Viana, M. S., Morandin Junior, O., & Contreras, R. C. (2020). Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem. In Proceedings. Lisboa: SciTePress. doi:10.5220/0008937004630474
NLM
Viana MS, Morandin Junior O, Contreras RC. Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem [Internet]. Proceedings. 2020 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.5220/0008937004630474
Vancouver
Viana MS, Morandin Junior O, Contreras RC. Transgenic genetic algorithm to minimize the makespan in the job shop scheduling problem [Internet]. Proceedings. 2020 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.5220/0008937004630474
Artigo de periodico
A notion of total dual integrality for convex, semidefinite, and extended formulations (2020)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: PROGRAMAÇÃO INTEIRA E FLUXOS EM REDE, PROGRAMAÇÃO CONVEXA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli e TUNÇEL, Levent. A notion of total dual integrality for convex, semidefinite, and extended formulations. SIAM Journal on Discrete Mathematics, v. 34, n. 1, p. 470-496, 2020Tradução . . Disponível em: https://doi.org/10.1137/18M1169710. Acesso em: 05 out. 2024.
APA
Silva, M. K. de C., & Tunçel, L. (2020). A notion of total dual integrality for convex, semidefinite, and extended formulations. SIAM Journal on Discrete Mathematics, 34( 1), 470-496. doi:10.1137/18M1169710
NLM
Silva MK de C, Tunçel L. A notion of total dual integrality for convex, semidefinite, and extended formulations [Internet]. SIAM Journal on Discrete Mathematics. 2020 ; 34( 1): 470-496.[citado 2024 out. 05 ] Available from: https://doi.org/10.1137/18M1169710
Vancouver
Silva MK de C, Tunçel L. A notion of total dual integrality for convex, semidefinite, and extended formulations [Internet]. SIAM Journal on Discrete Mathematics. 2020 ; 34( 1): 470-496.[citado 2024 out. 05 ] Available from: https://doi.org/10.1137/18M1169710
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: 05 out. 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 out. 05 ] 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 out. 05 ] Available from: https://doi.org/10.1016/j.disc.2019.111717
Artigo de periodico
A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem (2020)
Azevedo, Leonildo José de Melo de ; Estrella, Júlio Cezar ; Toledo, Claudio Fabiano Motta ; Reiff-Marganiec, Stephan
Source: IEEE Access. Unidade: ICMC
Subjects: OTIMIZAÇÃO COMBINATÓRIA, COMPUTAÇÃO EM NUVEM, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
AZEVEDO, Leonildo José de Melo de et al. A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem. IEEE Access, v. 8, p. 122469-122479, 2020Tradução . . Disponível em: https://doi.org/10.1109/ACCESS.2020.3006171. Acesso em: 05 out. 2024.
APA
Azevedo, L. J. de M. de, Estrella, J. C., Toledo, C. F. M., & Reiff-Marganiec, S. (2020). A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem. IEEE Access, 8, 122469-122479. doi:10.1109/ACCESS.2020.3006171
NLM
Azevedo LJ de M de, Estrella JC, Toledo CFM, Reiff-Marganiec S. A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem [Internet]. IEEE Access. 2020 ; 8 122469-122479.[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/ACCESS.2020.3006171
Vancouver
Azevedo LJ de M de, Estrella JC, Toledo CFM, Reiff-Marganiec S. A multi-objective optimized service level agreement approach applied on a cloud computing ecosystem [Internet]. IEEE Access. 2020 ; 8 122469-122479.[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/ACCESS.2020.3006171
Trabalho de evento-anais periodico
An improved local search genetic algorithm with multi-crossover for job shop scheduling problem (2020)
Viana, Monique Simplicio ; Morandin Junior, Orides ; Contreras, Rodrigo Colnago
Source: Lecture Notes in Artificial Intelligence. Conference titles: International Conference on Artificial Intelligence and Soft Computing - ICAISC. Unidade: ICMC
Subjects: ALGORITMOS GENÉTICOS, OTIMIZAÇÃO COMBINATÓRIA, HEURÍSTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
VIANA, Monique Simplicio e MORANDIN JUNIOR, Orides e CONTRERAS, Rodrigo Colnago. An improved local search genetic algorithm with multi-crossover for job shop scheduling problem. Lecture Notes in Artificial Intelligence. Cham: Springer. Disponível em: https://doi.org/10.1007/978-3-030-61401-0_43. Acesso em: 05 out. 2024. , 2020
APA
Viana, M. S., Morandin Junior, O., & Contreras, R. C. (2020). An improved local search genetic algorithm with multi-crossover for job shop scheduling problem. Lecture Notes in Artificial Intelligence. Cham: Springer. doi:10.1007/978-3-030-61401-0_43
NLM
Viana MS, Morandin Junior O, Contreras RC. An improved local search genetic algorithm with multi-crossover for job shop scheduling problem [Internet]. Lecture Notes in Artificial Intelligence. 2020 ; 12415 464-479.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-030-61401-0_43
Vancouver
Viana MS, Morandin Junior O, Contreras RC. An improved local search genetic algorithm with multi-crossover for job shop scheduling problem [Internet]. Lecture Notes in Artificial Intelligence. 2020 ; 12415 464-479.[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-030-61401-0_43
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: 05 out. 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 out. 05 ] 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 out. 05 ] Available from: https://doi.org/10.1016/j.dam.2019.08.002
Trabalho de evento
An RBF network based crossover for pseudo-boolean optimization (2019)
Tinós, Renato
Source: Proceedings. Conference titles: Brazilian Conference on Intelligent Systems (BRACIS). Unidade: FFCLRP
Subjects: ALGORITMOS GENÉTICOS, REDES NEURAIS, RECOMBINAÇÃO GENÉTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TINÓS, Renato. An RBF network based crossover for pseudo-boolean optimization. 2019, Anais.. Piscataway: IEEE, 2019. Disponível em: https://doi.org/10.1109/BRACIS.2019.00039. Acesso em: 05 out. 2024.
APA
Tinós, R. (2019). An RBF network based crossover for pseudo-boolean optimization. In Proceedings. Piscataway: IEEE. doi:10.1109/BRACIS.2019.00039
NLM
Tinós R. An RBF network based crossover for pseudo-boolean optimization [Internet]. Proceedings. 2019 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/BRACIS.2019.00039
Vancouver
Tinós R. An RBF network based crossover for pseudo-boolean optimization [Internet]. Proceedings. 2019 ;[citado 2024 out. 05 ] Available from: https://doi.org/10.1109/BRACIS.2019.00039
Parte de monografia/livro
A bi-objective mixed integer model for the single link inventory routing problem using the 'épsilon'-constraint method (2019)
Mundim, Arianne Alves da Silva ; Santos, Maristela Oliveira dos ; Morabito, Reinaldo
Source: Advances in optimization and decision science for society, services and enterprises. Unidade: ICMC
Subjects: ESTOQUES, REVISÃO SISTEMÁTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MUNDIM, Arianne Alves da Silva e SANTOS, Maristela Oliveira dos e MORABITO, Reinaldo. A bi-objective mixed integer model for the single link inventory routing problem using the 'épsilon'-constraint method. Advances in optimization and decision science for society, services and enterprises. Tradução . Cham: Springer, 2019. . Disponível em: https://doi.org/10.1007/978-3-030-34960-8_36. Acesso em: 05 out. 2024.
APA
Mundim, A. A. da S., Santos, M. O. dos, & Morabito, R. (2019). A bi-objective mixed integer model for the single link inventory routing problem using the 'épsilon'-constraint method. In Advances in optimization and decision science for society, services and enterprises. Cham: Springer. doi:10.1007/978-3-030-34960-8_36
NLM
Mundim AA da S, Santos MO dos, Morabito R. A bi-objective mixed integer model for the single link inventory routing problem using the 'épsilon'-constraint method [Internet]. In: Advances in optimization and decision science for society, services and enterprises. Cham: Springer; 2019. [citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-030-34960-8_36
Vancouver
Mundim AA da S, Santos MO dos, Morabito R. A bi-objective mixed integer model for the single link inventory routing problem using the 'épsilon'-constraint method [Internet]. In: Advances in optimization and decision science for society, services and enterprises. Cham: Springer; 2019. [citado 2024 out. 05 ] Available from: https://doi.org/10.1007/978-3-030-34960-8_36
Artigo de periodico
Counting Hamiltonian cycles in the matroid basis graph (2019)
Fernandes, Cristina Gomes ; Hernández Vélez, César ; Pina Júnior, José Coelho de ; Ramírez Alfonsín, Jorge Luis
Source: Graphs and Combinatorics. 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
FERNANDES, Cristina Gomes et al. Counting Hamiltonian cycles in the matroid basis graph. Graphs and Combinatorics, v. 35, n. 2, 2019Tradução . . Disponível em: https://doi.org/10.1007/s00373-019-02011-8. Acesso em: 05 out. 2024.
APA
Fernandes, C. G., Hernández Vélez, C., Pina Júnior, J. C. de, & Ramírez Alfonsín, J. L. (2019). Counting Hamiltonian cycles in the matroid basis graph. Graphs and Combinatorics, 35( 2). doi:10.1007/s00373-019-02011-8
NLM
Fernandes CG, Hernández Vélez C, Pina Júnior JC de, Ramírez Alfonsín JL. Counting Hamiltonian cycles in the matroid basis graph [Internet]. Graphs and Combinatorics. 2019 ; 35( 2):[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s00373-019-02011-8
Vancouver
Fernandes CG, Hernández Vélez C, Pina Júnior JC de, Ramírez Alfonsín JL. Counting Hamiltonian cycles in the matroid basis graph [Internet]. Graphs and Combinatorics. 2019 ; 35( 2):[citado 2024 out. 05 ] Available from: https://doi.org/10.1007/s00373-019-02011-8

USP Schools

ReP

Filtros

Document Types

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Countries/Territories

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation

Countries of institutions of collaboration