About Me
My research is mainly about Combinatorial Optimization and Operations Research. I enjoy investigating the theoretical and structural properties of optimization problems, as well as implementing efficient and practical algorithms. I have the privilege of being supervised by Professor Ricardo Fukasawa.
Download my resume. You can access my master’s dissertation here.
Interests
- Mixed-Integer Programming
- Benders' and Dantzig-Wolfe Decomposition
- Stochastic Programming
- Polyhedral Combinatorics
- Vehicle Routing Problems
Education
-
PhD in Combinatorics and Optimization, 2026 (expected)
University of Waterloo
-
MS in Computer Science, 2020
University of Campinas
-
BS in Computer Engineering, 2018
University of Campinas
Experience
PhD in
Combinatorics and Optimization
I work with professor Ricardo Fukasawa on Integer
Programming techniques.
Applied
Scientist Intern
Worked on large-scale middle-mile load scheduling.
Formulated a consistency model ensuring that outbound dispatches respect
inbound arrivals and sort center processing capacity, and derived valid
inequalities that achieved over 1000× speedup on a production
instance.
Student
Researcher
Worked in the Operations Research team on airline
disruption management. Developed mathematical models for large-scale
instances and implemented column-generation-based algorithms in C++.
Software
Developer
Back-End Developer. Working with Java and using
technologies like Apache Camel, Active MQ, MariaDB, Spring Boot, Docker and
Git/SVN.
Undergraduate Student Researcher
Together with professor Nathan Sturtevant, developed a
Puzzle Generator for the game “The Witness”. The generator was made using
techniques based on Procedural Content Generation. The work was published in
AIIDE'18.
Teaching
Teaching
Assistant
- Undergraduate: CO 370 Deterministic OR Models (4 terms), CO 327 Deterministic OR Models for non-specialists, CO 372 Portfolio Optimization Models, CO 454 Scheduling, MATH 118 Calculus 2 for Engineering
- Graduate: CO 673 Optimization for Data Science
- Designed and ran Python/Gurobi tutorials for CO 370 (Fall 2024); graded and advised course projects
- Guest lectures on cutting-plane methods (CO 370, Spring 2023) and polyhedral theory (CO 652 Integer Programming, Winter 2025)
Mentoring
- Modi Liu and Ruby Fang (Undergraduate), Cutting planes for vehicle routing problems, 2024 – 2025
- Xinyue Fan and Crystal Zhou (Undergraduate), Branch-cut-and-price algorithms for a robust green vehicle routing problem, 2024
Accomplishments
Publications
Misc
- INFORMS Annual Meeting, Atlanta, US, 2025 — Scenario-optimal recourse policy for the vehicle routing problem with stochastic demands
- INFORMS Computing Society Conference, Toronto, Canada, 2025 — Recovering the Dantzig-Wolfe bound via corner Benders' cuts
- INFORMS Transportation Science and Logistics Society Workshop, Nantes, France, 2024 — Approximating the recourse cost of stochastic vehicle routing problems
- International Symposium on Mathematical Programming (ISMP), Montréal, Canada, 2024 — Approximating the recourse cost function of the vehicle routing problem with stochastic demands
- Logistics and Optimization Group, Universidade Federal da Paraíba, Brazil, 2024 (invited, virtual) — Introduction to two-stage stochastic programming
- INFORMS Annual Meeting, Indianapolis, US, 2022 — Exact approaches for stochastic vehicle routing problems with scenarios
MIP 2024 and Cornell ORIE Young Researchers Workshop 2024 — Benders' cuts via corner polyhedra: an application to the stochastic vehicle routing problem
MIP 2025 — Combining Column Generation and Column Elimination
MIP South America 2025 — Scenario-optimal recourse policies for vehicle routing problems with stochastic demands
- Reviewer for Transportation Research Part B, INFORMS Journal on Computing, Operations Research Letters, Networks, IPCO and Brazilian Symposium on Operations Research (SBPO)