Everything can be optimized
I am an Operations Research scientist and software developer. I enjoy researching optimization methodologies, teaching optimization courses, and writing software that uses optimization to solve real-world problems.
My journey:
- MIP Engineer at OptiLogic (2025-)
- Solving MIPs for Supply Chain design problems.
- Ph.D in Algorithms, Combinatorics, and Optimization from Carnegie Mellon University’s Tepper School of Business (2020-2025)
- Researched models and methods for solving discrete optimization problems. I was advised by the amazing Willem-Jan van Hoeve.
- Supported by the NSF Graduate Research Fellowship Program
- Quantiative Developer for Marshall Wace Asset Management (2017-2020)
- Built a treasury optimization system and improved the automated trading system.
- B.S. in Applied Mathematics and Statistics from Johns Hopkins University (2014-2017)
- Solved umpire crew scheduling problems for Minor League Baseball.
My research:
- Model relaxations and exact methods.
- My dissertation focused on developing a new exact method that computes dual bounds for large-scale discrete optimization problems with a particular form. slides.
- Gerald L. Thompson Doctoral Dissertation Award in Management Science (2025).
- Column Elimination: An Iterative Approach to Solving Arc Flow Formulations
- With Willem-Jan van Hoeve.
- Major Revision at Operations Research.
- Finalist for the TSL Best Student Paper Award (2025).
- Column Elimination For Capacitated Vehicle Routing Problems
- With Willem-Jan van Hoeve.
- Published in CPAIOR conference proceedings (2023).
- Best Student Paper at CPAIOR.
- My dissertation focused on developing a new exact method that computes dual bounds for large-scale discrete optimization problems with a particular form. slides.
- Computation.
- From cliques to colorings and back again develops a state-of-the-art SAT solver for the vertex coloring problem.
- With Marijn Heule and Willem-Jan van Hoeve.
- Published in Constraint Programming conference proceedings (2022).
- A Quantum-Inspired Bilevel Optimization Algorithm for the First Responder Network Design Problem is a quantum approach to solving a network design problem.
- With Sridhar Tayur, Ananth Tenneti, Amirreza Pashapour, Sibel Salman, and Baris Yildiz.
- Published in INFORMS Journal on Computing (2025).
- Work-in-progress “Computing a Nonnegative Dyadic Solution to a System of Linear Equations” is the first implementation of a dyadic linear programming solver.
- From cliques to colorings and back again develops a state-of-the-art SAT solver for the vertex coloring problem.
- Algorithm portfolios.
- Variable ordering for decision diagrams: A portfolio approach tries to allocate limited runtime to several heuristics with unknown performance.
- With Willem-Jan van Hoeve.
- Published in Constraints (2022).
- Variable ordering for decision diagrams: A portfolio approach tries to allocate limited runtime to several heuristics with unknown performance.
Fun things:
- I host a podcast called Optimizing You.
- I won a charity competition at Marshall Wace to support the All Stars Project Development School for Youth.
- I work as a freelancer solving optimization problems on Upwork.com. Some projects involved staffing nurses in hospitals, scheduling youth basketball leagues, and planning construction projects!
- I am a former president of the CMU INFORMS Student Chapter and former chair of the student-run YinzOR Conference.
- I am a former president of the Hopkins Undergraduate Society of Applied Mathematics.
- I am a math tutor for local high school students.
- I recently completed my first triathlon.
Checkout my CV.
Thanks for visiting, and feel free to reach out.