On sample average approximation for two-stage stochastic programs without relatively complete recourse R Chen, J Luedtke Mathematical Programming, 2022 | 13 | 2022 |
On generating Lagrangian cuts for two-stage stochastic integer programs R Chen, J Luedtke INFORMS Journal on Computing, 2022 | 6 | 2022 |
Integer programming for causal structure learning in the presence of latent variables R Chen, S Dash, T Gao International Conference on Machine Learning, 1550-1560, 2021 | 6 | 2021 |
Cardinality constrained multilinear sets R Chen, S Dash, O Günlük Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal …, 2020 | 6 | 2020 |
Multilinear sets with two monomials and cardinality constraints R Chen, S Dash, O Günlük Discrete Applied Mathematics 324, 67-79, 2023 | 5 | 2023 |
Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables R Chen, J Luedtke Mathematical Programming, 1-32, 2023 | 2 | 2023 |
Optimizing Fairness over Time with Homogeneous Workers (Short Paper) B van Rossum, R Chen, A Lodi 23rd Symposium on Algorithmic Approaches for Transportation Modelling …, 2023 | 2 | 2023 |
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions R Chen, S Dash, O Günlük Discrete Optimization 50, 100804, 2023 | 1 | 2023 |
A Simple Algorithm for Online Decision Making R Chen, O Gunluk, A Lodi, G Wang arXiv preprint arXiv:2211.03997, 2022 | 1 | 2022 |
Valid inequalities and integer programming formulations for stochastic integer programming and some machine learning problems R Chen The University of Wisconsin-Madison, 2021 | 1 | 2021 |
Recovering Dantzig–Wolfe Bounds by Cutting Planes R Chen, O Günlük, A Lodi Operations Research, 2024 | | 2024 |
A New Branching Rule for Range Minimization Problems B van Rossum, R Chen, A Lodi arXiv preprint arXiv:2311.03885, 2023 | | 2023 |
The Complexity of Recognizing Facets for the Knapsack Polytope R Chen, H Zhu arXiv preprint arXiv:2211.03311, 2022 | | 2022 |