ReP USP - Resultado da busca

Artigo de periodico
Models for two-dimensional bin packing problems with customer order spread (2024)
Martin, Mateus ; Yanasse, Horacio Hideki ; Santos, Maristela Oliveira dos ; Morabito, Reinaldo
Source: Journal of Combinatorial Optimization. Unidade: ICMC
Subjects: PESQUISA OPERACIONAL, EMPACOTAMENTO E COBERTURA, MANUFATURA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTIN, Mateus et al. Models for two-dimensional bin packing problems with customer order spread. Journal of Combinatorial Optimization, v. 48, p. 1-27, 2024Tradução . . Disponível em: https://doi.org/10.1007/s10878-024-01201-2. Acesso em: 30 set. 2024.
APA
Martin, M., Yanasse, H. H., Santos, M. O. dos, & Morabito, R. (2024). Models for two-dimensional bin packing problems with customer order spread. Journal of Combinatorial Optimization, 48, 1-27. doi:10.1007/s10878-024-01201-2
NLM
Martin M, Yanasse HH, Santos MO dos, Morabito R. Models for two-dimensional bin packing problems with customer order spread [Internet]. Journal of Combinatorial Optimization. 2024 ; 48 1-27.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10878-024-01201-2
Vancouver
Martin M, Yanasse HH, Santos MO dos, Morabito R. Models for two-dimensional bin packing problems with customer order spread [Internet]. Journal of Combinatorial Optimization. 2024 ; 48 1-27.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10878-024-01201-2
Artigo de periodico
Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds (2024)
Andreani, Roberto ; Couto, Kelvin R. ; Ferreira, Orizon Pereira ; Haeser, Gabriel
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, ANÁLISE NUMÉRICA, PESQUISA OPERACIONAL, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds. SIAM Journal on Optimization, v. 34, n. 2, p. 1799-1825, 2024Tradução . . Disponível em: https://doi.org/10.1137/23M1582382. Acesso em: 30 set. 2024.
APA
Andreani, R., Couto, K. R., Ferreira, O. P., & Haeser, G. (2024). Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds. SIAM Journal on Optimization, 34( 2), 1799-1825. doi:10.1137/23M1582382
NLM
Andreani R, Couto KR, Ferreira OP, Haeser G. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds [Internet]. SIAM Journal on Optimization. 2024 ; 34( 2): 1799-1825.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/23M1582382
Vancouver
Andreani R, Couto KR, Ferreira OP, Haeser G. Constraint qualifications and strong global Convergence properties of an augmented lagrangian method on riemannian manifolds [Internet]. SIAM Journal on Optimization. 2024 ; 34( 2): 1799-1825.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/23M1582382
Artigo de periodico
On optimality conditions for nonlinear conic programming (2022)
Andreani, Roberto ; Gómez, Walter ; Haeser, Gabriel ; Mito, Leonardo ; Ramos, Alberto
Source: Mathematics of Operations Research. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. On optimality conditions for nonlinear conic programming. Mathematics of Operations Research, v. 47, n. 3, p. 2160-2185, 2022Tradução . . Disponível em: https://doi.org/10.1287/moor.2021.1203. Acesso em: 30 set. 2024.
APA
Andreani, R., Gómez, W., Haeser, G., Mito, L., & Ramos, A. (2022). On optimality conditions for nonlinear conic programming. Mathematics of Operations Research, 47( 3), 2160-2185. doi:10.1287/moor.2021.1203
NLM
Andreani R, Gómez W, Haeser G, Mito L, Ramos A. On optimality conditions for nonlinear conic programming [Internet]. Mathematics of Operations Research. 2022 ; 47( 3): 2160-2185.[citado 2024 set. 30 ] Available from: https://doi.org/10.1287/moor.2021.1203
Vancouver
Andreani R, Gómez W, Haeser G, Mito L, Ramos A. On optimality conditions for nonlinear conic programming [Internet]. Mathematics of Operations Research. 2022 ; 47( 3): 2160-2185.[citado 2024 set. 30 ] Available from: https://doi.org/10.1287/moor.2021.1203
Artigo de periodico
Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming (2022)
Andreani, Roberto ; Haeser, Gabriel ; Mito, Leonardo ; Ramírez, C. Héctor ; Silveira, Thiago Parente da
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ANDREANI, Roberto et al. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming. Journal of Optimization Theory and Applications, v. 195, p. 42-78, 2022Tradução . . Disponível em: https://doi.org/10.1007/s10957-022-02056-5. Acesso em: 30 set. 2024.
APA
Andreani, R., Haeser, G., Mito, L., Ramírez, C. H., & Silveira, T. P. da. (2022). Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming. Journal of Optimization Theory and Applications, 195, 42-78. doi:10.1007/s10957-022-02056-5
NLM
Andreani R, Haeser G, Mito L, Ramírez CH, Silveira TP da. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming [Internet]. Journal of Optimization Theory and Applications. 2022 ; 195 42-78.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-022-02056-5
Vancouver
Andreani R, Haeser G, Mito L, Ramírez CH, Silveira TP da. Global convergence of algorithms under constant rank conditions for nonlinear second-order cone programming [Internet]. Journal of Optimization Theory and Applications. 2022 ; 195 42-78.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-022-02056-5
Artigo de periodico
Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations (2022)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
Source: SIAM Journal on Numerical Analysis. Unidade: IME
Subjects: ANÁLISE NUMÉRICA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTÍNEZ, José Mário. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. SIAM Journal on Numerical Analysis, v. 60, n. 6, p. 3145-3180, 2022Tradução . . Disponível em: https://doi.org/10.1137/20M1388024. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., & Martínez, J. M. (2022). Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations. SIAM Journal on Numerical Analysis, 60( 6), 3145-3180. doi:10.1137/20M1388024
NLM
Birgin EJG, Martínez JM. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations [Internet]. SIAM Journal on Numerical Analysis. 2022 ; 60( 6): 3145-3180.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/20M1388024
Vancouver
Birgin EJG, Martínez JM. Secant acceleration of sequential residual methods for solving large-scale nonlinear systems of equations [Internet]. SIAM Journal on Numerical Analysis. 2022 ; 60( 6): 3145-3180.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/20M1388024
Artigo de periodico
Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget (2021)
Moreira, Daniel Augusto de Melo; Delgado, Karina Valdivia ; Barros, Leliane Nunes de ; Mauá, Denis Deratani
Source: International Journal of Approximate Reasoning. Unidades: EACH, IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROCESSOS DE MARKOV, TEORIA DOS JOGOS, TEORIA DA DECISÃO
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MOREIRA, Daniel Augusto de Melo et al. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. International Journal of Approximate Reasoning, v. 139, p. 143-165, 2021Tradução . . Disponível em: https://doi.org/10.1016/j.ijar.2021.09.003. Acesso em: 30 set. 2024.
APA
Moreira, D. A. de M., Delgado, K. V., Barros, L. N. de, & Mauá, D. D. (2021). Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget. International Journal of Approximate Reasoning, 139, 143-165. doi:10.1016/j.ijar.2021.09.003
NLM
Moreira DA de M, Delgado KV, Barros LN de, Mauá DD. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget [Internet]. International Journal of Approximate Reasoning. 2021 ; 139 143-165.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.ijar.2021.09.003
Vancouver
Moreira DA de M, Delgado KV, Barros LN de, Mauá DD. Efficient algorithms for Risk-Sensitive Markov Decision Processes with limited budget [Internet]. International Journal of Approximate Reasoning. 2021 ; 139 143-165.[citado 2024 set. 30 ] Available from: https://doi.org/10.1016/j.ijar.2021.09.003
Artigo de periodico
Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming (2021)
Proença, Nathan Benedetto; Silva, Marcel Kenji de Carli ; Coutinho, Gabriel
Source: SIAM Journal on Discrete Mathematics. Unidade: IME
Subjects: PESQUISA OPERACIONAL, COMBINATÓRIA, TEORIA DOS GRAFOS, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
PROENÇA, Nathan Benedetto e SILVA, Marcel Kenji de Carli e COUTINHO, Gabriel. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming. SIAM Journal on Discrete Mathematics, v. 35, n. 4, p. 2880–2907, 2021Tradução . . Disponível em: https://doi.org/10.1137/19M1306427. Acesso em: 30 set. 2024.
APA
Proença, N. B., Silva, M. K. de C., & Coutinho, G. (2021). Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming. SIAM Journal on Discrete Mathematics, 35( 4), 2880–2907. doi:10.1137/19M1306427
NLM
Proença NB, Silva MK de C, Coutinho G. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 4): 2880–2907.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/19M1306427
Vancouver
Proença NB, Silva MK de C, Coutinho G. Dual Hoffman bounds for the stability and chromatic numbers based on semidefinite programming [Internet]. SIAM Journal on Discrete Mathematics. 2021 ; 35( 4): 2880–2907.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/19M1306427
Artigo de periodico
On a conjecture in second-order optimality conditions (2018)
Behling, Roger; Haeser, Gabriel ; Ramos, Alberto; Viana, Daiana S.
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, ÁLGEBRA LINEAR, ÁLGEBRA MULTILINEAR, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BEHLING, Roger et al. On a conjecture in second-order optimality conditions. Journal of Optimization Theory and Applications, v. 176, n. 3, p. 625-633, 2018Tradução . . Disponível em: https://doi.org/10.1007/s10957-018-1229-1. Acesso em: 30 set. 2024.
APA
Behling, R., Haeser, G., Ramos, A., & Viana, D. S. (2018). On a conjecture in second-order optimality conditions. Journal of Optimization Theory and Applications, 176( 3), 625-633. doi:10.1007/s10957-018-1229-1
NLM
Behling R, Haeser G, Ramos A, Viana DS. On a conjecture in second-order optimality conditions [Internet]. Journal of Optimization Theory and Applications. 2018 ; 176( 3): 625-633.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-018-1229-1
Vancouver
Behling R, Haeser G, Ramos A, Viana DS. On a conjecture in second-order optimality conditions [Internet]. Journal of Optimization Theory and Applications. 2018 ; 176( 3): 625-633.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-018-1229-1
Artigo de periodico
An extension of Yuan's lemma and its applications in optimization (2017)
Haeser, Gabriel
Source: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, PROGRAMAÇÃO NÃO LINEAR
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel. An extension of Yuan's lemma and its applications in optimization. Journal of Optimization Theory and Applications, v. 174, n. 3, p. 641-649, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10957-017-1123-2. Acesso em: 30 set. 2024.
APA
Haeser, G. (2017). An extension of Yuan's lemma and its applications in optimization. Journal of Optimization Theory and Applications, 174( 3), 641-649. doi:10.1007/s10957-017-1123-2
NLM
Haeser G. An extension of Yuan's lemma and its applications in optimization [Internet]. Journal of Optimization Theory and Applications. 2017 ; 174( 3): 641-649.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-017-1123-2
Vancouver
Haeser G. An extension of Yuan's lemma and its applications in optimization [Internet]. Journal of Optimization Theory and Applications. 2017 ; 174( 3): 641-649.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10957-017-1123-2
Artigo de periodico
BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem (2017)
Furlan, Marcos; Santos, Maristela Oliveira dos
Source: Journal of Intelligent Manufacturing. 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 e SANTOS, Maristela Oliveira dos. BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem. Journal of Intelligent Manufacturing, v. 28, n. 4, p. 929-944, 2017Tradução . . Disponível em: https://doi.org/10.1007/s10845-014-1030-4. Acesso em: 30 set. 2024.
APA
Furlan, M., & Santos, M. O. dos. (2017). BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem. Journal of Intelligent Manufacturing, 28( 4), 929-944. doi:10.1007/s10845-014-1030-4
NLM
Furlan M, Santos MO dos. BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem [Internet]. Journal of Intelligent Manufacturing. 2017 ; 28( 4): 929-944.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10845-014-1030-4
Vancouver
Furlan M, Santos MO dos. BFO: a hybrid bees algorithm for the multi-level capacitated lot-sizing problem [Internet]. Journal of Intelligent Manufacturing. 2017 ; 28( 4): 929-944.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10845-014-1030-4
Artigo de periodico
The use of quadratic regularization with a cubic descent condition for unconstrained optimization (2017)
Birgin, Ernesto Julian Goldberg ; Martinez, Jose Mario
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, CÁLCULO DE VARIAÇÕES, CONTROLE ÓTIMO, MÉTODOS NUMÉRICOS, PROGRAMAÇÃO NÃO LINEAR, ANÁLISE NUMÉRICA, CIÊNCIA DA COMPUTAÇÃO, TEORIA DA COMPUTAÇÃO, OTIMIZAÇÃO IRRESTRITA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, Jose Mario. The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM Journal on Optimization, v. 27, n. 2, p. 1049-1074, 2017Tradução . . Disponível em: https://doi.org/10.1137/16m110280x. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2017). The use of quadratic regularization with a cubic descent condition for unconstrained optimization. SIAM Journal on Optimization, 27( 2), 1049-1074. doi:10.1137/16m110280x
NLM
Birgin EJG, Martinez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization [Internet]. SIAM Journal on Optimization. 2017 ; 27( 2): 1049-1074.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/16m110280x
Vancouver
Birgin EJG, Martinez JM. The use of quadratic regularization with a cubic descent condition for unconstrained optimization [Internet]. SIAM Journal on Optimization. 2017 ; 27( 2): 1049-1074.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/16m110280x
Artigo de periodico
Sequential equality-constrained optimization for nonlinear programming (2016)
Birgin, Ernesto Julian Goldberg ; Bueno, L. F; Martinez, José Mario
Source: Computational Optimization and Applications. Unidade: IME
Subjects: PROGRAMAÇÃO NÃO LINEAR, OTIMIZAÇÃO MATEMÁTICA, PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e BUENO, L. F e MARTINEZ, José Mario. Sequential equality-constrained optimization for nonlinear programming. Computational Optimization and Applications, 2016Tradução . . Disponível em: https://doi.org/10.1007/s10589-016-9849-6. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., Bueno, L. F., & Martinez, J. M. (2016). Sequential equality-constrained optimization for nonlinear programming. Computational Optimization and Applications. doi:10.1007/s10589-016-9849-6
NLM
Birgin EJG, Bueno LF, Martinez JM. Sequential equality-constrained optimization for nonlinear programming [Internet]. Computational Optimization and Applications. 2016 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10589-016-9849-6
Vancouver
Birgin EJG, Bueno LF, Martinez JM. Sequential equality-constrained optimization for nonlinear programming [Internet]. Computational Optimization and Applications. 2016 ;[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10589-016-9849-6
Artigo de periodico
The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic (2013)
Cherri, Adriana Cristina; Arenales, Marcos Nereu ; Yanasse, Horacio Hideki
Source: International Transactions in 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
CHERRI, Adriana Cristina e ARENALES, Marcos Nereu e YANASSE, Horacio Hideki. The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic. International Transactions in Operational Research, v. 20, n. 2, p. 189-199, 2013Tradução . . Disponível em: https://doi.org/10.1111/j.1475-3995.2012.00868.x. Acesso em: 30 set. 2024.
APA
Cherri, A. C., Arenales, M. N., & Yanasse, H. H. (2013). The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic. International Transactions in Operational Research, 20( 2), 189-199. doi:10.1111/j.1475-3995.2012.00868.x
NLM
Cherri AC, Arenales MN, Yanasse HH. The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic [Internet]. International Transactions in Operational Research. 2013 ; 20( 2): 189-199.[citado 2024 set. 30 ] Available from: https://doi.org/10.1111/j.1475-3995.2012.00868.x
Vancouver
Cherri AC, Arenales MN, Yanasse HH. The usable leftover one-dimensional cutting stock problem-a priority-in-use heuristic [Internet]. International Transactions in Operational Research. 2013 ; 20( 2): 189-199.[citado 2024 set. 30 ] Available from: https://doi.org/10.1111/j.1475-3995.2012.00868.x
Artigo de periodico
Simple heuristics for the assembly line worker assignment and balancing problem (2012)
Moreira, Mayron César de Oliveira; Ritt, Marcus; Costa, Alysson Machado; Chaves, Antonio A
Source: Journal of Heuristics. 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
MOREIRA, Mayron César de Oliveira et al. Simple heuristics for the assembly line worker assignment and balancing problem. Journal of Heuristics, v. 18, n. 3, p. 505-524, 2012Tradução . . Disponível em: https://doi.org/10.1007/s10732-012-9195-5. Acesso em: 30 set. 2024.
APA
Moreira, M. C. de O., Ritt, M., Costa, A. M., & Chaves, A. A. (2012). Simple heuristics for the assembly line worker assignment and balancing problem. Journal of Heuristics, 18( 3), 505-524. doi:10.1007/s10732-012-9195-5
NLM
Moreira MC de O, Ritt M, Costa AM, Chaves AA. Simple heuristics for the assembly line worker assignment and balancing problem [Internet]. Journal of Heuristics. 2012 ; 18( 3): 505-524.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10732-012-9195-5
Vancouver
Moreira MC de O, Ritt M, Costa AM, Chaves AA. Simple heuristics for the assembly line worker assignment and balancing problem [Internet]. Journal of Heuristics. 2012 ; 18( 3): 505-524.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s10732-012-9195-5
Parte de monografia/livro
A linear optimization approach for increasing sustainability in vegetable crop production (2011)
Santos, Lana Mara R. dos; Arenales, Marcos Nereu ; Costa, Alysson Machado; Santos, Ricardo H. S.
Source: Computational methods for agricultural research : advances and applications. Unidade: ICMC
Subjects: PESQUISA OPERACIONAL, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SANTOS, Lana Mara R. dos et al. A linear optimization approach for increasing sustainability in vegetable crop production. Computational methods for agricultural research : advances and applications. Tradução . Hershey: IGI Global, 2011. p. 524 . . Acesso em: 30 set. 2024.
APA
Santos, L. M. R. dos, Arenales, M. N., Costa, A. M., & Santos, R. H. S. (2011). A linear optimization approach for increasing sustainability in vegetable crop production. In Computational methods for agricultural research : advances and applications (p. 524 ). Hershey: IGI Global.
NLM
Santos LMR dos, Arenales MN, Costa AM, Santos RHS. A linear optimization approach for increasing sustainability in vegetable crop production. In: Computational methods for agricultural research : advances and applications. Hershey: IGI Global; 2011. p. 524 .[citado 2024 set. 30 ]
Vancouver
Santos LMR dos, Arenales MN, Costa AM, Santos RHS. A linear optimization approach for increasing sustainability in vegetable crop production. In: Computational methods for agricultural research : advances and applications. Hershey: IGI Global; 2011. p. 524 .[citado 2024 set. 30 ]
Artigo de periodico
Operations research/management science tools for integrating people with disabilites into employment: a study on Valencia's Sheltered Work Centres for Disabled (2010)
Miralles, Cristóbal; Marí-Gracia, Juan A.; Ferrus, Gabriel; Costa, Alysson Machado
Source: International Transactions in 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
MIRALLES, Cristóbal et al. Operations research/management science tools for integrating people with disabilites into employment: a study on Valencia's Sheltered Work Centres for Disabled. International Transactions in Operational Research, v. 17, n. 4, p. 457-473, 2010Tradução . . Disponível em: https://doi.org/10.1111/j.1475-3995.2009.00727.x. Acesso em: 30 set. 2024.
APA
Miralles, C., Marí-Gracia, J. A., Ferrus, G., & Costa, A. M. (2010). Operations research/management science tools for integrating people with disabilites into employment: a study on Valencia's Sheltered Work Centres for Disabled. International Transactions in Operational Research, 17( 4), 457-473. doi:10.1111/j.1475-3995.2009.00727.x
NLM
Miralles C, Marí-Gracia JA, Ferrus G, Costa AM. Operations research/management science tools for integrating people with disabilites into employment: a study on Valencia's Sheltered Work Centres for Disabled [Internet]. International Transactions in Operational Research. 2010 ; 17( 4): 457-473.[citado 2024 set. 30 ] Available from: https://doi.org/10.1111/j.1475-3995.2009.00727.x
Vancouver
Miralles C, Marí-Gracia JA, Ferrus G, Costa AM. Operations research/management science tools for integrating people with disabilites into employment: a study on Valencia's Sheltered Work Centres for Disabled [Internet]. International Transactions in Operational Research. 2010 ; 17( 4): 457-473.[citado 2024 set. 30 ] Available from: https://doi.org/10.1111/j.1475-3995.2009.00727.x
Artigo de periodico
Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints (2009)
Costa, Alysson Machado; Cordeau, Jean-François; Laporte, Gilbert
Source: Networks. 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
COSTA, Alysson Machado e CORDEAU, Jean-François e LAPORTE, Gilbert. Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints. Networks, v. 53, n. 2, p. 141-159, 2009Tradução . . Disponível em: https://doi.org/10.1002/net.20274. Acesso em: 30 set. 2024.
APA
Costa, A. M., Cordeau, J. -F., & Laporte, G. (2009). Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints. Networks, 53( 2), 141-159. doi:10.1002/net.20274
NLM
Costa AM, Cordeau J-F, Laporte G. Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints [Internet]. Networks. 2009 ; 53( 2): 141-159.[citado 2024 set. 30 ] Available from: https://doi.org/10.1002/net.20274
Vancouver
Costa AM, Cordeau J-F, Laporte G. Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints [Internet]. Networks. 2009 ; 53( 2): 141-159.[citado 2024 set. 30 ] Available from: https://doi.org/10.1002/net.20274
Artigo de periodico
New reduction techniques for the group Steiner tree problem (2007)
Ferreira, Carlos Eduardo ; Oliveira Filho, Fernando Mário de
Source: SIAM Journal on Optimization. Unidade: IME
Subjects: PESQUISA OPERACIONAL, PROGRAMAÇÃO MATEMÁTICA, OTIMIZAÇÃO COMBINATÓRIA
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
FERREIRA, Carlos Eduardo e OLIVEIRA FILHO, Fernando Mário de. New reduction techniques for the group Steiner tree problem. SIAM Journal on Optimization, v. 17, n. 4, p. 1176-1188, 2007Tradução . . Disponível em: https://doi.org/10.1137/040610891. Acesso em: 30 set. 2024.
APA
Ferreira, C. E., & Oliveira Filho, F. M. de. (2007). New reduction techniques for the group Steiner tree problem. SIAM Journal on Optimization, 17( 4), 1176-1188. doi:10.1137/040610891
NLM
Ferreira CE, Oliveira Filho FM de. New reduction techniques for the group Steiner tree problem [Internet]. SIAM Journal on Optimization. 2007 ; 17( 4): 1176-1188.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/040610891
Vancouver
Ferreira CE, Oliveira Filho FM de. New reduction techniques for the group Steiner tree problem [Internet]. SIAM Journal on Optimization. 2007 ; 17( 4): 1176-1188.[citado 2024 set. 30 ] Available from: https://doi.org/10.1137/040610891
Artigo de periodico
A spectral conjugate gradient method for unconstrained optimization (2001)
Birgin, Ernesto Julian Goldberg ; Martinez, Jesus Manuel
Source: Applied Mathematics and Optimization. Unidade: IME
Subjects: PROGRAMAÇÃO MATEMÁTICA, PESQUISA OPERACIONAL
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg e MARTINEZ, Jesus Manuel. A spectral conjugate gradient method for unconstrained optimization. Applied Mathematics and Optimization, v. 43, n. 2, p. 117-128, 2001Tradução . . Disponível em: https://doi.org/10.1007/s00245-001-0003-0. Acesso em: 30 set. 2024.
APA
Birgin, E. J. G., & Martinez, J. M. (2001). A spectral conjugate gradient method for unconstrained optimization. Applied Mathematics and Optimization, 43( 2), 117-128. doi:10.1007/s00245-001-0003-0
NLM
Birgin EJG, Martinez JM. A spectral conjugate gradient method for unconstrained optimization [Internet]. Applied Mathematics and Optimization. 2001 ; 43( 2): 117-128.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s00245-001-0003-0
Vancouver
Birgin EJG, Martinez JM. A spectral conjugate gradient method for unconstrained optimization [Internet]. Applied Mathematics and Optimization. 2001 ; 43( 2): 117-128.[citado 2024 set. 30 ] Available from: https://doi.org/10.1007/s00245-001-0003-0
Trabalho de evento
Multi-step-ahead monthly streamflow forecasting by a neurofuzzy network model (2001)
Ballini, Rosangela; Soares, Secundino; Andrade, Marinho Gomes de
Source: Proceedings. Conference titles: IFSA World Congress. Unidade: ICMC
Subjects: PESQUISA OPERACIONAL, REDES NEURAIS
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BALLINI, Rosangela e SOARES, Secundino e ANDRADE, Marinho Gomes de. Multi-step-ahead monthly streamflow forecasting by a neurofuzzy network model. 2001, Anais.. New Jersey: IEEE, 2001. . Acesso em: 30 set. 2024.
APA
Ballini, R., Soares, S., & Andrade, M. G. de. (2001). Multi-step-ahead monthly streamflow forecasting by a neurofuzzy network model. In Proceedings. New Jersey: IEEE.
NLM
Ballini R, Soares S, Andrade MG de. Multi-step-ahead monthly streamflow forecasting by a neurofuzzy network model. Proceedings. 2001 ;[citado 2024 set. 30 ]
Vancouver
Ballini R, Soares S, Andrade MG de. Multi-step-ahead monthly streamflow forecasting by a neurofuzzy network model. Proceedings. 2001 ;[citado 2024 set. 30 ]

USP Schools

ReP

Filtros

USP Schools

Departament

Authors

USP affiliated authors

Date published

Subjects

Source title

Publisher

Conference titles

Funding Agencies

Indexado em

Normalized affiliation

Non normalized affiliation