My research interests span the theory of integer programming, combinatorial optimization, polyhedral combinatorics, and algorithms for discrete optimization.
Currently, I am actively working on various topics related to cutting-plane methods for urban transportation problems, such as the traveling salesman problem with drone and the crew scheduling problem.

• Research area: Integer programming, polyhedral combinatorics, cutting plane methods, algorithms, and neural combinatorial optimization.

• Research area: Large-scale intelligence algorithms for urban mobility.

• Research area: Integer programming, stochastic optimization, and algorithms.

Teaching Assistant

• Operations Research: Optimization, IE30031, Spring, 2025.

Internship Tutor

• Computational Optimization Methods Lab (COMET) Summer Internship Tutor, 2025.

• Role: Developing algorithms and designing database structures for predicting photomask fabrication lead time.

• Role: Implementing a Branch-Price-and-Cut algorithm for the three-dimensional binpacking problem.