CV Lattes
ResearcherID
ORCID
Universidade Federal de São Carlos (UFSCAR). Centro de Ciências Exatas e de Tecnologia (CCET) (Institutional affiliation for the last research proposal) Birthplace: Brazil
B.Sc. in Computer Engineering at State University of Campinas (2007), M.Sc. in Computer Science at State University of Campinas (2010), and Ph.D. in Computer Science at State University of Campinas (2015), with one year of research internship abroad at Cornell University. Postdoctoral researcher in Computer Science at University of São Paulo (2018) and, currently, is an adjunct professor at the Department of Computing of Federal University of São Carlos. Has experience with Algorithms and Combinatorial Optimization, working mainly on the following subjects: online algorithms, competitive analysis, approximation algorithms, facility location problems, network design problems, and randomized algorithms. (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) |
Vehicle Routing Problems, in general, involve decisions that minimize the costs of transporting products through different routes using several vehicles to serve a non-homogeneous and geographically dispersed demand. These problems have great impact for the three sectors of economy, since they aim to minimize costs and to model logistical systems that are present from the manufacturing of…
The Vehicle Routing Problem involves finding a set of routes, which minimizes the overall costs, for a fleet of vehicles to traverse in order to serve a given set of customers. The problem is very important to industry, since it is useful for modeling logistical problems such as product distribution and people transportation. This project aims to study and develop exact algorithms for thi…
In Scheduling Problems, the goal is to find the best distribution of jobs to be performed by machines, aiming to minimize some aspect of the production process. Many of these problems have great theoretical difficulty, as they are NP-Hard, which means that there is no algorithm able to find the optimal solution in polynomial time, unless P=NP. They also have great practical relevance, mai…
Nos problemas de corte em grafos busca-se encontrar um conjunto de arestas que, ao serem removidas, desconectam determinados vértices, cumprindo requisitos e particularidades dos mais diversos cenários. Esses problemas são bastante relevantes tanto do ponto de vista de dificuldade teórica, muito deles sendo problemas NP-difíceis para os quais diversos algoritmos de aproximação são conheci…
(Only some records are available in English at this moment)
In the Facility Location Problem, it is sought to decide how many and which facilities to open in order to serve the connection demands of the clients. It is a very relevant problem both due to its theoretical interest, being an NP-hard problem widely studied and for which numerous approximation algorithms and metaheuristics are known, as well as for being motivated by practical applicati…
In this project we work with the online and incremental versions of Facility Location Problems. (AU)
| 1 / 1 | Ongoing scholarships in Brazil |
| 9 / 7 | Completed scholarships in Brazil |
| 2 / 2 | Completed scholarships abroad |
| 12 / 10 | All Scholarships |
| Associated processes | |
SAN FELICE, MARIO CESAR; WILLIAMSON, DAVID P.; LEE, ORLANDO. A Randomized -Competitive Algorithm for the Online Connected Facility Location Problem. ALGORITHMICA, v. 76, n. 4, p. 1139-1157, DEC 2016. Web of Science Citations: 0. (09/15535-1)
DE LIMA, MURILO SANTOS; SAN FELICE, MARIO CESAR; LEE, ORLANDO. Group parking permit problems. DISCRETE APPLIED MATHEMATICS, v. 281, n. SI, p. 172-194, JUL 15 2020. (14/18781-1, 15/11937-9, 17/11382-2)
(References retrieved automatically from State of São Paulo Research Institutions)
FELICE, Mário César San. O problema do k-Servidor. Dissertação (Mestrado) - Instituto de Computação. Universidade Estadual de Campinas (UNICAMP). (07/57997-6)