ML & Optimization Researcher
Email: haoranzhu94 [at] gmail [dot] com
[LinkedIn] [Google Scholar] [CV ]
I am currently a Senior Applied Scientist at Microsoft. Previously I was a PhD student in the Department of Industrial & Systems Engineering at the University of Wisconsin-Madison and Wisconsin Institute for Discovery, working with Jeff Linderoth and Alberto Del Pia. I obtained my B.S. in Mathematics and Statistics from Nanjing University in 2016 and my M.S. in Computer Sciences from UW-Madison in 2020.
I am interested in broad areas of optimization with more focus on discrete and combinatorial optimization. Most of my latest work are centered around the development and study of polyhedral relaxations for a variety of nonconvex sets that appear frequently in different optimization problems. For more details, you can see my statement of research here.
New Classes of Facets for Complementarity Knapsack Problem
with Alberto Del Pia and Jeff Linderoth.
Discrete Applied Mathematics (2024)
Recognition of Facets for Knapsack Polytope is Dp-complete
submitted to Mathematics of Operations Research
On the Complexity of Separating Cutting Planes for the Knapsack Polytope
with Alberto Del Pia and Jeff Linderoth.
Mathematical Programming (2023)
Extended Relaxations and Cutting-planes for Linear Programs with Complementarity Constraints
with Alberto Del Pia and Jeff Linderoth.
Journal of Global Optimization (2024)
[slides] [poster]
New Classes of Facets for Complementarity Knapsack Problem
with Alberto Del Pia and Jeff Linderoth.
International Symposium on Combinatorial Optimization (ISCO), 2022
[slides]
On the Complexity of Separation From the Knapsack Polytope
with Alberto Del Pia and Jeff Linderoth.
Integer Programming and Combinatorial Optimization (IPCO), 2022
[slides]
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets: Theory and Computation
with Alberto Del Pia and Jeff Linderoth.
Mathematical Programming (2022)
The k-aggregation Closure for Covering Sets
Discrete Optimization (2023)
[poster]
On the Polyhedrality of the Chvatal-Gomory Closure
submitted to Mathematical Programming, under review
[poster] [video]
Integer Packing Sets Form a Well-Quasi-Ordering
with Alberto Del Pia, Dion Gijswijt and Jeff Linderoth.
Operations Research Letters 49(2) 226-230 (2021)
Multi-cover Inequalities for Totally-Ordered Multiple Knapsack Sets
with Alberto Del Pia and Jeff Linderoth.
Integer Programming and Combinatorial Optimization (IPCO), 2021
[poster] [slides]
[video]
A Scalable MIP-based Method for Learning Optimal Multivariate Decision Trees
with Pavankumar Murali, Dzung T. Phan, Lam M. Nguyen and Jayant R. Kalagnanam.
Neural Information Processing Systems (NeurIPS), 2020
[poster] [slides]
[video]
Optimal Interpretable Decision Trees using Integer Linear Programming Techniques filed on February 20, 2020.
with Pavankumar Murali, Dung Tien Phan and Lam M. Nguyen.
United States Patent Application 20210264290.
Prediction modeling in sequential flow networks filed on February 20, 2020.
with Pavankumar Murali and Dhavalkumar C. Patel.
United States Patent Application 20210264288.
Full-time Microsoft, Redmond, WA, Aug 2022 - Now
Research Co-op (IBM Research AI group) at IBM T. J. Watson Research Center, March 2019 - September 2019
Session Chair of “Proximity Theory on IP and Topics in Discrete Optimization”, INFORMS 2020 annual meeting
In my spare time, other than research and work, I am also actively engaged in all kinds of physical sports and activities. Soccer, running, hiking and swimming are some of my favorites. I am also competitive in bodybuilding and powerlifting. Sometimes I like posting videos in Instagram.