Undergraduate in Molecular Sciences from the University of São Paulo (USP). Master's student in Computer Science at the Institute of Mathematics and Statistics IME/USP. Student of the Theory of Computation, Combinatorics, and Optimization research group. He also participates in academic Olympiads in the ACM-ICPC format as a member of the MaratonUSP extension group. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| TITULO |
| Articles published in other media outlets (0 total): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
This is a research project to be carried out by Gabriel Morete de Azevedo towards a MSc degree under the guidance of Y. Wakabayashi at IME-USP. It is a project in combinatorial optimization that addresses problems on connectivity augmentation of graphs, with emphasis on their algorithmic aspects. Generally speaking, the goal of the problems to be investigated is to increase the connectivi…
This is an undergraduate research project to be carried out at IME-USP from 01/08/2020 to 30/7/2021. The main goal of this project is to study the prize-collecting Steiner tree problem, a well-known generalization of the Steiner tree problem in graphs which has many applications. The study includes formulations, exact approaches, and approximations. Moreover, the student will be familiari…
In this project we propose the study of topics in combinatorial optimization including graph theory, integer programming and some applications. In particular, we are interested with linear programming formulations: Given a matrix A m by n, and vectors b, with m real components, and c, with n real components, we want to find an vector x, with n real non-negative components, which maximizes…
This is the BEPE-MS research proposal of Gabriel Morete de Azevedo, M.Sc. studentat the Institute of Mathematics and Statistics of the University of São Paulo, to be conducted at the Combinatorics & Optimization Department of the University of Waterloo,under the supervision of Professor Joseph Cheriyan. It is a project in combinatorial optimization that addresses problems on connectivity …
| 3 / 3 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 4 / 4 | All Scholarships |
| Associated processes | |
CV Lattes
ORCID