Ph.D. in Industrial Engineering, University of Wisconsin-Madison, 2021

M.S. in Computer Sciences, University of Wisconsin-Madison, 2020

B.S. in Statistics, Nanjing University, 2017

Dr. Rui Chen is an Assistant Professor of the Chinese University of Hong Kong, Shenzhen. He received his Ph.D. degree in Industrial Engineering (with a focus on Decision Science and Operations Research) at the University of Wisconsin-Madison in 2021. Prior to that, he obtained his B.S. degree in Statistics from Nanjing University in 2017, and his M.S. degree in Computer Sciences from the University of Wisconsin-Madison in 2020. He also worked as a Postdoctoral Associate at Cornell Tech from 2021 to 2024, and a research intern at IBM research in 2019 and 2020.

Dr. Chen's research is dedicated to the development of theory and computational tools for addressing optimization challenges, especially those involving randomness and discreteness, with wide applications in logistics, social science and data science. His work has been published in top journals such as Operations Research and Mathematical Programming, as well as top conferences such as IPCO and ICML.

Journal papers

1. R. Chen, O. Günlük and A. Lodi, "Recovering Dantzig-Wolfe bounds by cutting planes", Operations Research (Articles in Advance), 2024+

2. R. Chen, S. Dash and O. Günlük, "Convexifying multilinear sets with cardinality constraints: structural properties, nested case and extensions", Discrete Optimization 50 100804, 2023

3. R. Chen and J. Luedtke, "Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables", Mathematical Programming (Online First), 2023+

4. R. Chen, S. Dash and O. Günlük, "Multilinear sets with two monomials and cardinality constraints" Discrete Applied Mathematics 324 67-79, 2023

5. R. Chen and J. Luedtke, "On generating Lagrangian cuts for two-stage stochastic integer programs" INFORMS Journal on Computing 34(4) 2332-2349, 2022

6. R. Chen and J. Luedtke, "On sample average approximation for two-stage stochastic programs without relatively complete recourse", Mathematical Programming 196 719-754, 2022

Referred conference proceedings

1. B. van Rossum, R. Chen and A. Lodi, "A new branching rule for range minimization problems", International Conference on Integer Programming and Combinatorial Optimization (forthcoming), 2024

2. B. van Rossum, R. Chen and A. Lodi, "Optimizing fairness over time with homogeneous workers", Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems, OASIcs 115 17:1-17:6, 2023

3. R. Chen and J. Luedtke, "Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables", International Conference on Integer Programming and Combinatorial Optimization, LNCS 13265 98-111, 2022

4. R. Chen, S. Dash and T. Gao, "Integer programming for causal structure learning in the presence of latent variables", International Conference on Machine Learning, PMLR 139 1550-1560, 2021

5. R. Chen, S. Dash and O. Günlük, "Cardinality constrained multilinear sets", International Symposium on Combinatorial Optimization, LNCS 12176 54-65, 2020