Research Fellow in Combinatorial Optimization
Department of Data Science and Artificial Intelligence
Monash University
I study hybrid algorithms that exploit the strengths of integer programming at routing, constraint programming at scheduling and heuristic search at path finding to automate decision-making and achieve faster operations planning
I develop branch-and-cut-and-price algorithms for large-scale combinatorial optimization using Dantzig–Wolfe reformulation, column generation, cutting planes, polyhedral analysis and Benders decomposition.
I code high-performance solvers through efficient data structures, profiler-guided design and low-level optimization to improve run time and memory use.