ReP USP - Resultado da busca

Artigo de periodico
Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints (2020)
Helou Neto, Elias Salomão ; Santos, Sandra Augusta ; Simões, Lucas Eduardo Azevedo
In: Journal of Optimization Theory and Applications. Unidade: ICMC
Subjects: Equilíbrio, Programação Matemática, Otimização Restrita, Programação Não Linear
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HELOU NETO, Elias Salomão; SANTOS, Sandra Augusta; SIMÕES, Lucas Eduardo Azevedo. Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints. Journal of Optimization Theory and Applications, New York, Springer, v. 185, p. 433-447, 2020. Disponível em: < https://doi.org/10.1007/s10957-020-01658-1 > DOI: 10.1007/s10957-020-01658-1.
APA
Helou Neto, E. S., Santos, S. A., & Simões, L. E. A. (2020). Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints. Journal of Optimization Theory and Applications, 185, 433-447. doi:10.1007/s10957-020-01658-1
NLM
Helou Neto ES, Santos SA, Simões LEA. Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints [Internet]. Journal of Optimization Theory and Applications. 2020 ; 185 433-447.Available from: https://doi.org/10.1007/s10957-020-01658-1
Vancouver
Helou Neto ES, Santos SA, Simões LEA. Analysis of a new sequential optimality condition applied to mathematical programs with equilibrium constraints [Internet]. Journal of Optimization Theory and Applications. 2020 ; 185 433-447.Available from: https://doi.org/10.1007/s10957-020-01658-1
Artigo de periodico
A new sequential optimality condition for constrained nonsmooth optimization (2020)
Helou Neto, Elias Salomão ; Santos, Sandra Augusta ; Simões, Lucas Eduardo Azevedo
In: SIAM Journal on Optimization. Unidade: ICMC
Subjects: Algoritmos úteis E Específicos, Otimização Global, Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HELOU NETO, Elias Salomão; SANTOS, Sandra Augusta; SIMÕES, Lucas Eduardo Azevedo. A new sequential optimality condition for constrained nonsmooth optimization. SIAM Journal on Optimization, Philadelphia, SIAM, v. 30, n. 2, p. 1610-1637, 2020. Disponível em: < https://doi.org/10.1137/18M1228608 > DOI: https://doi.org/10.1137/18M1228608.
APA
Helou Neto, E. S., Santos, S. A., & Simões, L. E. A. (2020). A new sequential optimality condition for constrained nonsmooth optimization. SIAM Journal on Optimization, 30( 2), 1610-1637. doi:https://doi.org/10.1137/18M1228608
NLM
Helou Neto ES, Santos SA, Simões LEA. A new sequential optimality condition for constrained nonsmooth optimization [Internet]. SIAM Journal on Optimization. 2020 ; 30( 2): 1610-1637.Available from: https://doi.org/10.1137/18M1228608
Vancouver
Helou Neto ES, Santos SA, Simões LEA. A new sequential optimality condition for constrained nonsmooth optimization [Internet]. SIAM Journal on Optimization. 2020 ; 30( 2): 1610-1637.Available from: https://doi.org/10.1137/18M1228608
Artigo de periodico
Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern (2020)
Martin, Mateus ; Birgin, Ernesto Julian Goldberg ; Lobato, Rafael Durbano ; Morabito, Reinaldo ; Munari, Pedro
In: International Transactions in Operational Research. Unidade: IME
Subjects: Programação Matemática, Matemática Da Computação
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
MARTIN, Mateus; BIRGIN, Ernesto Julian Goldberg; LOBATO, Rafael Durbano; MORABITO, Reinaldo; MUNARI, Pedro. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, Oxford, Wiley, v. 27, n. 2, p. 767-793, 2020. Disponível em: < http://dx.doi.org/10.1111/itor.12703 > DOI: 10.1111/itor.12703.
APA
Martin, M., Birgin, E. J. G., Lobato, R. D., Morabito, R., & Munari, P. (2020). Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern. International Transactions in Operational Research, 27( 2), 767-793. doi:10.1111/itor.12703
NLM
Martin M, Birgin EJG, Lobato RD, Morabito R, Munari P. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern [Internet]. International Transactions in Operational Research. 2020 ; 27( 2): 767-793.Available from: http://dx.doi.org/10.1111/itor.12703
Vancouver
Martin M, Birgin EJG, Lobato RD, Morabito R, Munari P. Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern [Internet]. International Transactions in Operational Research. 2020 ; 27( 2): 767-793.Available from: http://dx.doi.org/10.1111/itor.12703
Artigo de periodico
An Augmented Lagrangian method for quasi-equilibrium problems (2020)
Bueno, L. F; Haeser, Gabriel ; Lara, F; Rojas, Frank Navarro
In: Computational Optimization and Applications. Unidade: IME
Subjects: Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, L. F; HAESER, Gabriel; LARA, F; ROJAS, Frank Navarro. An Augmented Lagrangian method for quasi-equilibrium problems. Computational Optimization and Applications, New York, Springer, 2020. Disponível em: < https://doi.org/10.1007/s10589-020-00180-4 > DOI: 10.1007/s10589-020-00180-4.
APA
Bueno, L. F., Haeser, G., Lara, F., & Rojas, F. N. (2020). An Augmented Lagrangian method for quasi-equilibrium problems. Computational Optimization and Applications. doi:10.1007/s10589-020-00180-4
NLM
Bueno LF, Haeser G, Lara F, Rojas FN. An Augmented Lagrangian method for quasi-equilibrium problems [Internet]. Computational Optimization and Applications. 2020 ;Available from: https://doi.org/10.1007/s10589-020-00180-4
Vancouver
Bueno LF, Haeser G, Lara F, Rojas FN. An Augmented Lagrangian method for quasi-equilibrium problems [Internet]. Computational Optimization and Applications. 2020 ;Available from: https://doi.org/10.1007/s10589-020-00180-4
Artigo de periodico
On the solution of linearly constrained optimization problems by means of barrier algorithms (2020)
Birgin, Ernesto Julian Goldberg ; Gardenghi, John Lenon Cardoso ; Martínez, José Mário ; Santos, S. A
In: TOP. Unidade: IME
Subjects: Programação Não Linear, 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; GARDENGHI, John Lenon Cardoso; MARTÍNEZ, José Mário; SANTOS, S. A. On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP, Heidelberg, Springer, 2020. Disponível em: < https://doi.org/10.1007/s11750-020-00559-w > DOI: 10.1007/s11750-020-00559-w.
APA
Birgin, E. J. G., Gardenghi, J. L. C., Martínez, J. M., & Santos, S. A. (2020). On the solution of linearly constrained optimization problems by means of barrier algorithms. TOP. doi:10.1007/s11750-020-00559-w
NLM
Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2020 ;Available from: https://doi.org/10.1007/s11750-020-00559-w
Vancouver
Birgin EJG, Gardenghi JLC, Martínez JM, Santos SA. On the solution of linearly constrained optimization problems by means of barrier algorithms [Internet]. TOP. 2020 ;Available from: https://doi.org/10.1007/s11750-020-00559-w
Artigo de periodico
New constraint qualifications with second-order properties in nonlinear optimization (2020)
Haeser, Gabriel ; Ramos, A.
In: Journal of Optimization Theory and Applications. Unidade: IME
Subjects: Programação Não Linear, Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
HAESER, Gabriel; RAMOS, A. New constraint qualifications with second-order properties in nonlinear optimization. Journal of Optimization Theory and Applications, New York, Springer, v. 184, p. 494-506, 2020. Disponível em: < http://dx.doi.org/10.1007/s10957-019-01603-x > DOI: 10.1007/s10957-019-01603-x.
APA
Haeser, G., & Ramos, A. (2020). New constraint qualifications with second-order properties in nonlinear optimization. Journal of Optimization Theory and Applications, 184, 494-506. doi:10.1007/s10957-019-01603-x
NLM
Haeser G, Ramos A. New constraint qualifications with second-order properties in nonlinear optimization [Internet]. Journal of Optimization Theory and Applications. 2020 ; 184 494-506.Available from: http://dx.doi.org/10.1007/s10957-019-01603-x
Vancouver
Haeser G, Ramos A. New constraint qualifications with second-order properties in nonlinear optimization [Internet]. Journal of Optimization Theory and Applications. 2020 ; 184 494-506.Available from: http://dx.doi.org/10.1007/s10957-019-01603-x
Artigo de periodico
An improved lower bound for the blocking permutation flow shop with total completion time criterion (2020)
Nagano, Marcelo Seido ; Robazzi,^João^Vitor^Silva; Tomazella,^Caio^Paziani
In: Computers & Industrial Engineering. Unidades: EESC, ICMC
Subjects: Programação Matemática, Engenharia De Produção
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
NAGANO, Marcelo Seido; ROBAZZI, ^João^Vitor^Silva; TOMAZELLA, ^Caio^Paziani. An improved lower bound for the blocking permutation flow shop with total completion time criterion. Computers & Industrial Engineering, Kidlington, United Kingdom, Elsevier, v. 146, p. 1-5, 2020. Disponível em: < http://dx.doi.org/10.1016/j.cie.2020.106511 > DOI: 10.1016/j.cie.2020.106511.
APA
Nagano, M. S., Robazzi, ^J. ^V. ^S., & Tomazella, ^C. ^P. (2020). An improved lower bound for the blocking permutation flow shop with total completion time criterion. Computers & Industrial Engineering, 146, 1-5. doi:10.1016/j.cie.2020.106511
NLM
Nagano MS, Robazzi ^J^V^S, Tomazella ^C^P. An improved lower bound for the blocking permutation flow shop with total completion time criterion [Internet]. Computers & Industrial Engineering. 2020 ; 146 1-5.Available from: http://dx.doi.org/10.1016/j.cie.2020.106511
Vancouver
Nagano MS, Robazzi ^J^V^S, Tomazella ^C^P. An improved lower bound for the blocking permutation flow shop with total completion time criterion [Internet]. Computers & Industrial Engineering. 2020 ; 146 1-5.Available from: http://dx.doi.org/10.1016/j.cie.2020.106511
Artigo de periodico
Towards an efficient augmented Lagrangian method for convex quadratic programming (2020)
Bueno, Luís Felipe ; Haeser, Gabriel ; Santos, Luiz-Rafael
In: Computational Optimization and Applications. Unidade: IME
Subjects: Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Luís Felipe; HAESER, Gabriel; SANTOS, Luiz-Rafael. Towards an efficient augmented Lagrangian method for convex quadratic programming. Computational Optimization and Applications, Dordrecht, Springer, v. 76, p. 767-800, 2020. Disponível em: < https://doi.org/10.1007/s10589-019-00161-2 > DOI: 10.1007/s10589-019-00161-2.
APA
Bueno, L. F., Haeser, G., & Santos, L. -R. (2020). Towards an efficient augmented Lagrangian method for convex quadratic programming. Computational Optimization and Applications, 76, 767-800. doi:10.1007/s10589-019-00161-2
NLM
Bueno LF, Haeser G, Santos L-R. Towards an efficient augmented Lagrangian method for convex quadratic programming [Internet]. Computational Optimization and Applications. 2020 ; 76 767-800.Available from: https://doi.org/10.1007/s10589-019-00161-2
Vancouver
Bueno LF, Haeser G, Santos L-R. Towards an efficient augmented Lagrangian method for convex quadratic programming [Internet]. Computational Optimization and Applications. 2020 ; 76 767-800.Available from: https://doi.org/10.1007/s10589-019-00161-2
Artigo de periodico
Complexity and performance of an Augmented Lagrangian algorithm (2020)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
In: Optimization Methods and Software. Unidade: IME
Subjects: Programação Não Linear, Programação Matemática, Análise De Algoritmos
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BIRGIN, Ernesto Julian Goldberg; MARTÍNEZ, José Mário. Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software, Reading, Taylor and Francis, 2020. Disponível em: < http://dx.doi.org/10.1080/10556788.2020.1746962 > DOI: 10.1080/10556788.2020.1746962.
APA
Birgin, E. J. G., & Martínez, J. M. (2020). Complexity and performance of an Augmented Lagrangian algorithm. Optimization Methods and Software. doi:10.1080/10556788.2020.1746962
NLM
Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ;Available from: http://dx.doi.org/10.1080/10556788.2020.1746962
Vancouver
Birgin EJG, Martínez JM. Complexity and performance of an Augmented Lagrangian algorithm [Internet]. Optimization Methods and Software. 2020 ;Available from: http://dx.doi.org/10.1080/10556788.2020.1746962
Artigo de periodico
Solving the permutation flow shop problem with blocking and setup time constraints (2020)
Takano, Mauricio Iwama; Nagano, Marcelo Seido
In: International Journal of Industrial Engineering Computations. Unidade: EESC
Subjects: Programação Matemática, Engenharia De Produção
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
TAKANO, Mauricio Iwama; NAGANO, Marcelo Seido. Solving the permutation flow shop problem with blocking and setup time constraints. International Journal of Industrial Engineering Computations, North Vancouver, Canada, Growing Science, v. 11, p. 469-480, 2020. Disponível em: < http://www.dx.doi.org.br/10.5267/j.ijiec.2019.11.002 > DOI: 10.5267/j.ijiec.2019.11.002.
APA
Takano, M. I., & Nagano, M. S. (2020). Solving the permutation flow shop problem with blocking and setup time constraints. International Journal of Industrial Engineering Computations, 11, 469-480. doi:10.5267/j.ijiec.2019.11.002
NLM
Takano MI, Nagano MS. Solving the permutation flow shop problem with blocking and setup time constraints [Internet]. International Journal of Industrial Engineering Computations. 2020 ; 11 469-480.Available from: http://www.dx.doi.org.br/10.5267/j.ijiec.2019.11.002
Vancouver
Takano MI, Nagano MS. Solving the permutation flow shop problem with blocking and setup time constraints [Internet]. International Journal of Industrial Engineering Computations. 2020 ; 11 469-480.Available from: http://www.dx.doi.org.br/10.5267/j.ijiec.2019.11.002
Artigo de periodico
Optimality conditions and global convergence for nonlinear semidefinite programming (2020)
Andreani, Roberto ; Haeser, Gabriel ; Viana, Daiana S.
In: Mathematical Programming. Unidade: IME
Subjects: 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; HAESER, Gabriel; VIANA, Daiana S. Optimality conditions and global convergence for nonlinear semidefinite programming. Mathematical Programming, Heidelberg, Springer, v. 180, n. 1-2, p. 203-235, 2020. Disponível em: < https://doi.org/10.1007/s10107-018-1354-5 > DOI: 10.1007/s10107-018-1354-5.
APA
Andreani, R., Haeser, G., & Viana, D. S. (2020). Optimality conditions and global convergence for nonlinear semidefinite programming. Mathematical Programming, 180( 1-2), 203-235. doi:10.1007/s10107-018-1354-5
NLM
Andreani R, Haeser G, Viana DS. Optimality conditions and global convergence for nonlinear semidefinite programming [Internet]. Mathematical Programming. 2020 ; 180( 1-2): 203-235.Available from: https://doi.org/10.1007/s10107-018-1354-5
Vancouver
Andreani R, Haeser G, Viana DS. Optimality conditions and global convergence for nonlinear semidefinite programming [Internet]. Mathematical Programming. 2020 ; 180( 1-2): 203-235.Available from: https://doi.org/10.1007/s10107-018-1354-5
Trabalho de evento
Equidade em escalonamento de médicos em sala deeEmergência usando programação matemática (2019)
Devesse, Valdemar Abrão Pedro Anastácio ; Arantes, Márcio da Silva ; Akartunalı, Kerem ; Toledo, Claudio Fabiano Motta
In: Anais. Conference title: Simpósio Brasileiro de Pesquisa Operacional. Unidade: ICMC
Subjects: Programação Matemática, Equidade, Benchmarks
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
DEVESSE, Valdemar Abrão Pedro Anastácio; ARANTES, Márcio da Silva; AKARTUNALI, Kerem; TOLEDO, Claudio Fabiano Motta. Equidade em escalonamento de médicos em sala deeEmergência usando programação matemática. Anais.. Rio de Janeiro: SOBRAPO, 2019.Disponível em: .
APA
Devesse, V. A. P. A., Arantes, M. da S., Akartunalı, K., & Toledo, C. F. M. (2019). Equidade em escalonamento de médicos em sala deeEmergência usando programação matemática. In Anais. Rio de Janeiro: SOBRAPO. Recuperado de https://proceedings.science/sbpo-2019/papers/equidade-em-escalonamento-de-medicos-em-sala-de-emergencia-usando-programacao-matematica
NLM
Devesse VAPA, Arantes M da S, Akartunalı K, Toledo CFM. Equidade em escalonamento de médicos em sala deeEmergência usando programação matemática [Internet]. Anais. 2019 ;Available from: https://proceedings.science/sbpo-2019/papers/equidade-em-escalonamento-de-medicos-em-sala-de-emergencia-usando-programacao-matematica
Vancouver
Devesse VAPA, Arantes M da S, Akartunalı K, Toledo CFM. Equidade em escalonamento de médicos em sala deeEmergência usando programação matemática [Internet]. Anais. 2019 ;Available from: https://proceedings.science/sbpo-2019/papers/equidade-em-escalonamento-de-medicos-em-sala-de-emergencia-usando-programacao-matematica
Artigo de periodico
Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP (2019)
Silva, Marcel Kenji de Carli ; Tunçel, Levent
In: SIAM Journal on Optimization. Unidade: IME
Subjects: Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli; TUNÇEL, Levent. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP. SIAM Journal on Optimization, Philadelphia, Society for Industrial & Applied Mathematics (SIAM), v. 29, n. 4, p. 2650-2676, 2019. Disponível em: < https://doi.org/10.1137/18M1193657 > DOI: 10.1137/18M1193657.
APA
Silva, M. K. de C., & Tunçel, L. (2019). Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP. SIAM Journal on Optimization, 29( 4), 2650-2676. doi:10.1137/18M1193657
NLM
Silva MK de C, Tunçel L. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 2650-2676.Available from: https://doi.org/10.1137/18M1193657
Vancouver
Silva MK de C, Tunçel L. Strict complementarity in semidefinite optimization with elliptopes including the maxCut SDP [Internet]. SIAM Journal on Optimization. 2019 ; 29( 4): 2650-2676.Available from: https://doi.org/10.1137/18M1193657
Trabalho de evento-anais periodico
Algebras, graphs and thetas (2019)
Silva, Marcel Kenji de Carli ; Coutinho, Gabriel ; Godsil, Chris ; Roberson, David E
In: Electronic Notes in Theoretical Computer Science. Conference title: Latin and American Algorithms, Graphs and Optimization Symposium - LAGOS. Unidade: IME
Subjects: Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SILVA, Marcel Kenji de Carli; COUTINHO, Gabriel; GODSIL, Chris; ROBERSON, David E. Algebras, graphs and thetas. Electronic Notes in Theoretical Computer Science[S.l: s.n.], 2019.Disponível em: DOI: 10.1016/j.entcs.2019.08.025.
APA
Silva, M. K. de C., Coutinho, G., Godsil, C., & Roberson, D. E. (2019). Algebras, graphs and thetas. Electronic Notes in Theoretical Computer Science. Amsterdam: Elsevier. doi:10.1016/j.entcs.2019.08.025
NLM
Silva MK de C, Coutinho G, Godsil C, Roberson DE. Algebras, graphs and thetas [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 275-283.Available from: https://doi.org/10.1016/j.entcs.2019.08.025
Vancouver
Silva MK de C, Coutinho G, Godsil C, Roberson DE. Algebras, graphs and thetas [Internet]. Electronic Notes in Theoretical Computer Science. 2019 ; 346 275-283.Available from: https://doi.org/10.1016/j.entcs.2019.08.025
Trabalho de evento
Mathematics and programming: marriage or divorce? (2019)
Souza, Lucas Mendonça de; Ferreira, Bernardo Martins; Felix, Igor Moreira; Brandao, Leonidas de Oliveira ; Brandão, Anarosa Alves Franco ; Pereira, Patricia Alves
In: Proceedings. Conference title: World Engineering Education Conference - EDUNINE. Unidades: IME, EP
Subjects: Tecnologia Educacional, Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
SOUZA, Lucas Mendonça de; FERREIRA, Bernardo Martins; FELIX, Igor Moreira; et al. Mathematics and programming: marriage or divorce? Anais.. Piscataway: IEEE, 2019.Disponível em: DOI: 10.1109/EDUNINE.2019.8875849.
APA
Souza, L. M. de, Ferreira, B. M., Felix, I. M., Brandao, L. de O., Brandão, A. A. F., & Pereira, P. A. (2019). Mathematics and programming: marriage or divorce? In Proceedings. Piscataway: IEEE. doi:10.1109/EDUNINE.2019.8875849
NLM
Souza LM de, Ferreira BM, Felix IM, Brandao L de O, Brandão AAF, Pereira PA. Mathematics and programming: marriage or divorce? [Internet]. Proceedings. 2019 ;Available from: http://dx.doi.org/10.1109/EDUNINE.2019.8875849
Vancouver
Souza LM de, Ferreira BM, Felix IM, Brandao L de O, Brandão AAF, Pereira PA. Mathematics and programming: marriage or divorce? [Internet]. Proceedings. 2019 ;Available from: http://dx.doi.org/10.1109/EDUNINE.2019.8875849
Tese
Sistema autônomo para supervisão de missão e segurança de voo em VANTs (2019)
Arantes, Jesimar da Silva; Toledo, Cláudio Fabiano Motta (Orientador)
Unidade: ICMC
Subjects: Sistemas Autônomos, Computação Evolutiva, Programação Matemática, Aeronaves Não Tripuladas, Voo (engenharia Aeronáutica)
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
ARANTES, Jesimar da Silva; TOLEDO, Cláudio Fabiano Motta. Sistema autônomo para supervisão de missão e segurança de voo em VANTs. 2019.Universidade de São Paulo, São Carlos, 2019. Disponível em: < http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10102019-091702/ >.
APA
Arantes, J. da S., & Toledo, C. F. M. (2019). Sistema autônomo para supervisão de missão e segurança de voo em VANTs. Universidade de São Paulo, São Carlos. Recuperado de http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10102019-091702/
NLM
Arantes J da S, Toledo CFM. Sistema autônomo para supervisão de missão e segurança de voo em VANTs [Internet]. 2019 ;Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10102019-091702/
Vancouver
Arantes J da S, Toledo CFM. Sistema autônomo para supervisão de missão e segurança de voo em VANTs [Internet]. 2019 ;Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-10102019-091702/
Trabalho de evento-resumo
A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework (2019)
Birgin, Ernesto Julian Goldberg ; Martínez, José Mário
In: Conference book. Conference title: International Conference on Continuous Optimization - ICCOPT. Unidade: IME
Subjects: Otimização Matemática, 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; MARTÍNEZ, José Mário. A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework. Anais.. Berlin: Weierstrass Institute for Applied Analysis and Stochastics (WIAS), 2019.Disponível em: .
APA
Birgin, E. J. G., & Martínez, J. M. (2019). A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework. In Conference book. Berlin: Weierstrass Institute for Applied Analysis and Stochastics (WIAS). Recuperado de https://www.iccopt2019.berlin/downloads/ICCOPT2019_Conference_Book.pdf
NLM
Birgin EJG, Martínez JM. A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework [Internet]. Conference book. 2019 ;Available from: https://www.iccopt2019.berlin/downloads/ICCOPT2019_Conference_Book.pdf
Vancouver
Birgin EJG, Martínez JM. A Newton-like method with mixed factorizations and cubic regularization and its usage in an Augmented Lagrangian framework [Internet]. Conference book. 2019 ;Available from: https://www.iccopt2019.berlin/downloads/ICCOPT2019_Conference_Book.pdf
Artigo de periodico
A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (2019)
Birgin, Ernesto Julian Goldberg ; Martinez, José Mario
In: Computational Optimization and Applications. Unidade: IME
Subjects: Otimização Matemática, 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; MARTINEZ, José Mario. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Computational Optimization and Applications, New York, Springer, v. 73, n. 3, p. 707-753, 2019. Disponível em: < https://doi.org/10.1007/s10589-019-00089-7 > DOI: 10.1007/s10589-019-00089-7.
APA
Birgin, E. J. G., & Martinez, J. M. (2019). A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization. Computational Optimization and Applications, 73( 3), 707-753. doi:10.1007/s10589-019-00089-7
NLM
Birgin EJG, Martinez JM. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization [Internet]. Computational Optimization and Applications. 2019 ; 73( 3): 707-753.Available from: https://doi.org/10.1007/s10589-019-00089-7
Vancouver
Birgin EJG, Martinez JM. A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization [Internet]. Computational Optimization and Applications. 2019 ; 73( 3): 707-753.Available from: https://doi.org/10.1007/s10589-019-00089-7
Artigo de periodico
Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications (2019)
Bueno, Luís Felipe ; Haeser, Gabriel ; Rojas, Frank Navarro
In: SIAM Journal on Optimization. Unidade: IME
Subjects: Programação Matemática, Programação Não Linear, Teoria Dos Jogos
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
BUENO, Luís Felipe; HAESER, Gabriel; ROJAS, Frank Navarro. Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications. SIAM Journal on Optimization, Philadelphia, Society for Industrial & Applied Mathematics (SIAM), v. 29, n. 1, p. 31-54, 2019. Disponível em: < http://dx.doi.org/10.1137/17m1162524 > DOI: 10.1137/17m1162524.
APA
Bueno, L. F., Haeser, G., & Rojas, F. N. (2019). Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications. SIAM Journal on Optimization, 29( 1), 31-54. doi:10.1137/17m1162524
NLM
Bueno LF, Haeser G, Rojas FN. Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications [Internet]. SIAM Journal on Optimization. 2019 ; 29( 1): 31-54.Available from: http://dx.doi.org/10.1137/17m1162524
Vancouver
Bueno LF, Haeser G, Rojas FN. Optimality conditions and constraint qualifications for generalized Nash equilibrium problems and their practical implications [Internet]. SIAM Journal on Optimization. 2019 ; 29( 1): 31-54.Available from: http://dx.doi.org/10.1137/17m1162524
Tese
The Vehicle Routing Problem with Drones (2019)
Costa, Joao Guilherme Cavalcanti; Santos, Maristela Oliveira dos (Orientador)
Unidade: ICMC
Subjects: Aeronaves Não Tripuladas, Algoritmos Genéticos, Logística, Programação Matemática
A citação é gerada automaticamente e pode não estar totalmente de acordo com as normas
ABNT
COSTA, Joao Guilherme Cavalcanti; SANTOS, Maristela Oliveira dos. The Vehicle Routing Problem with Drones. 2019.Universidade de São Paulo, São Carlos, 2019. Disponível em: < http://www.teses.usp.br/teses/disponiveis/55/55134/tde-29082019-091040/ >.
APA
Costa, J. G. C., & Santos, M. O. dos. (2019). The Vehicle Routing Problem with Drones. Universidade de São Paulo, São Carlos. Recuperado de http://www.teses.usp.br/teses/disponiveis/55/55134/tde-29082019-091040/
NLM
Costa JGC, Santos MO dos. The Vehicle Routing Problem with Drones [Internet]. 2019 ;Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-29082019-091040/
Vancouver
Costa JGC, Santos MO dos. The Vehicle Routing Problem with Drones [Internet]. 2019 ;Available from: http://www.teses.usp.br/teses/disponiveis/55/55134/tde-29082019-091040/