Sensitivity analysis and relaxation of the Static Traffic Assignment Problem with Capacity Constraints. - Theophile Cabannes; Elizabeth Glista; Kshama Dwarakanath; Xu Rao; Tanya Veeravalli; Alexandre M. Bayen (CDC, 2019)

The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem. - Dorit S. Hochbaum; Xu Rao (Oper. Res., 2019)

Network Flow Methods for the Minimum Covariates Imbalance Problem. - Dorit S. Hochbaum; Xu Rao (CoRR, 2020)

Algorithms and Complexity for Variants of Covariates Fine Balance. - Dorit S. Hochbaum; Asaf Levin; Xu Rao (CoRR, 2020)

Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer. - Dorit S. Hochbaum; Xu Rao (Inf. Process. Lett., 2020)

A fully polynomial time approximation scheme for the Replenishment Storage problem. - Dorit S. Hochbaum; Xu Rao (Oper. Res. Lett., 2020)

Complexity, algorithms and applications of the integer network flow with fractional supplies problem. - Dorit S. Hochbaum; Asaf Levin; Xu Rao (Oper. Res. Lett., 2021)

Network flow methods for the minimum covariate imbalance problem. - Dorit S. Hochbaum; Xu Rao; Jason J. Sauppe (Eur. J. Oper. Res., 2022)

Algorithms and Complexities of Matching Variants in Covariate Balancing. - Dorit S. Hochbaum; Asaf Levin; Xu Rao (Oper. Res., 2023)