CV Lattes
ORCID
Google Scholar Citations
Universidade Estadual de Campinas (UNICAMP). Instituto de Computação (IC) (Institutional affiliation from the last research proposal) Birthplace: Brazil
graduation at Bacharelado Em Ciência da Computação from Universidade de São Paulo (2008) and doctorate at Computer Science from Universidade de São Paulo (2014). Has experience in Computer Science, focusing on Analysis of Algorithms and Computational Complexity, acting on the following subjects: unit-demand auctions, approximation algorithms, pricing problem, algortimos de aproximação and complexidade. (Source: Lattes Curriculum)
| News published in Agência FAPESP Newsletter about the researcher |
| More itemsLess items |
| TITULO |
| Articles published in other media outlets ( ): |
| More itemsLess items |
| VEICULO: TITULO (DATA) |
| VEICULO: TITULO (DATA) |
In this research project our goal is to contribute to the advancement of the Combinatorial Optimization field focusing, in particular, in cutting and packing problems.These problems were introduced by Kantorovich in 1939 and Brooks et al. in 1940 with applications in the industry in mind and are very common in situations where it is necessary to cut materials (as metal, glass, paper, etc)…
The long waiting time for elective surgeries is a global challenge, especially after the COVID-19 pandemic. This time is prolonged due to the complexity of scheduling these surgeries, which involves factors such as the allocation of operating rooms, the availability of medical teams and the management of cancellations. Fortunately, we can approach this process as an optimization problem, …
Cutting and Packing Problems are essential in manufacturing and logistics. They aim to minimize waste, directly influencing operational efficiency. The Cutting Stock Problem (CSP) optimizes material cutting, while the Bin Packing Problem (BPP) focuses on efficient item packing. Given their high practical applications in industry and intrinsic computational complexities, they are problems …
The Minimum Path-Collection Exact Cover (PCEC) is a problem where, given a directed graph G and a set of paths of G, it is necessary to find the subset of paths of lowest cardinality such that every edge of the graph is covered exactly once . The Minimum k-Path Splitting Exact Cover (k-PSEC) is a variant of the PCEC in which there are restrictions on the chosen paths. These problems belon…
The rapid development of Internet of Things applications was one of the factors that drove the introduction of Edge Computing concept, which brings cloud tasks to the edge of the network. However, the lack of resource allocation management can cause problems or even extinguish the benefits of data being processed in Edge Computing. In addition, the mobility of devices makes this resource …
(Only some records are available in English at this moment)
Cutting and Packing Problems are essential in manufacturing and logistics. They aim to minimize waste, directly influencing operational efficiency. The Cutting Stock Problem (CSP) optimizes material cutting, while the Bin Packing Problem (BPP) focuses on efficient item packing. Given their high practical applications in industry and intrinsic computational complexities, they have been wid…
Soon, billions of devices will be connected to the Internet and most of them will need external resources to store and process their data. The concept of Edge Computing can bring benefits to these devices by making these resources available at the edge of the network, to be closer to the user. However, these offered resources need to be managed so that they are allocated efficiently. To s…
| 1 / 1 | Completed research grants |
| 1 / 1 | Ongoing scholarships in Brazil |
| 11 / 10 | Completed scholarships in Brazil |
| 1 / 1 | Ongoing scholarships abroad |
| 1 / 1 | Completed scholarships abroad |
| 15 / 14 | All research grants and scholarships |
| Associated processes | |