Optimization Researcher and Developer
Email: bochuan [dot] lyu [at] gmail [dot] com
[LinkedIn] [Google Scholar]
I am currently an operations research specialist at SAS Institute working on optimization solvers, such as LP/MILP solvers. I received my M.A. and Ph.D. degrees from the Department of Computational Applied Mathematics and Operations Research at Rice University in 2022 and 2023 respectively, working with Joey Huchette at Google Research and Illya V. Hicks. Before Rice, I obtained my Bachelor of Science in Mathematics from Rose-Hulman Institute of Technology in 2019, working with Megan Heyman and Allen Holder.
I am primarily interested in mathematical optimization with a concentration on mixed-integer programming and combinatorial optimization. My Ph.D. study is focused on modeling disjunctive constraints under the independent branching scheme.
Full-Time SAS Institute, Houston, TX (remote), June 2023 - Present
Internship SAS Institute, Houston, TX (remote), May 2022 - August 2022
Internship Alibaba Group, Houston, TX (remote), June 2021 - August 2021
Co-op Rockwell Collins (Collins Aerospace), Cedar Rapids, IA, September 2016 - March 2017
A complete list of publications can be found on my Google scholar page.
Building formulations for piecewise linear relaxations of nonlinear functions
Bochuan Lyu, Illya V. Hicks, Joey Huchette
Submitted (2023)
[code]
Maximal clique and edge-ranking bounds of biclique cover number
Bochuan Lyu, Illya V. Hicks
Submitted (2023)
Modeling combinatorial disjunctive constraints via junction trees
Bochuan Lyu, Illya V. Hicks, Joey Huchette
Mathematical Programming (2023)
Finding biclique partitions of co-chordal graphs
Bochuan Lyu, Illya V. Hicks
Discrete Applied Mathematics (2023)
A Simplex Approach to Solving Robust Metabolic Models with Low-Dimensional Uncertainty
Allen Holder, Bochuan Lyu
Harvey J. Greenberg: A Legacy Bridging Operations Research and Computing (2021)
Tumor copy number deconvolution integrating bulk and single-cell sequencing data
Haoyun Lei, Bochuan Lyu, E Michael Gertz, Alejandro A Schäffer, Xulian Shi, Kui Wu, Guibo Li, Liqin Xu, Yong Hou, Michael Dean, Russell Schwartz
Journal of Computational Biology (2020)
Biclique Partitions, Biclique Covers, and Disjunctive Constraints
Ph.D. Dissertation (2023)
Modeling Disjunctive Constraints via Junction Trees
Master Thesis (2021)
Verifying binarized neural networks: Convex relaxations, mixed-integer programming, and consistency
under the supervision of Joey Huchette
[code]
Note that similar work was studied independently around the same time.
ANOVA.boot: Residual and wild bootstrap in 1-way and 2-way ANOVA
under the supervision of Megan Heyman
“Modeling Combinatorial Disjunctive Constraints via Junction Trees and Applications in Robotics”, SIAM Conference on Optimization (OP23), May 31-June 3, 2023, Seattle, WA.
“Modeling Combinatorial Disjunctive Constraints via Junction Trees”, 2022 INFORMS Annual Meeting, October 16-19, 2022, Indianapolis, IN.
“Modeling Disjunctive Constraints via Junction Trees”, 2022 INFORMS Optimization Society Conference, March 13-15, 2022, Greenville, SC.