Xu Rao
Xu Rao has a total of 4 co-authors. Here are the top co-authors by number of shared publications:
- Dorit S. Hochbaum
University of California, Berkeley
5 shared publications - Asaf Levin
Faculty of Data and Decisions Sciences, The Technion, Haifa, Israel
2 shared publications - Guohong Zhang
School of Mathematics and Statistics, Southwest University, Chongqing 400715, P. R. China
1 shared publication - Xiaoli Wang
School of Mathematics and Statistics, Southwest University, Chongqing 400715, P. R. China
1 shared publication
Latest Publications
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 71 (5) , 1800-1814
Algorithms and Complexities of Matching Variants in Covariate Balancing
In an observational study there are two disjointed groups of samples, one of treatment samples and the other of control samples. Each of the samples is characterized by several observed covariates.... Here, we study several variants of matching problems that arise in covariate balancing. Covariate balancing problems can be viewed as variants of matching, or b-matching, with global side constrain...
- 1 September 2023
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 71 (5) , 1800-1814
Algorithms and Complexities of Matching Variants in Covariate Balancing
In an observational study there are two disjointed groups of samples, one of treatment samples and the other of control samples. Each of the samples is characterized by several observed covariates.... Here, we study several variants of matching problems that arise in covariate balancing. Covariate balancing problems can be viewed as variants of matching, or b-matching, with global side constrain...
- Open Access
- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 27 (11) , 6655-6677
A reaction-diffusion-advection SIS epidemic model with linear external source and open advective environments
In this paper, we propose a reaction-diffusion-advection SIS epidemic model with linear external source to study the effects of open advective environments on the persistence and extinction of infectious diseases. Threshold-type results on the global dynamics in terms of the basic reproduction number$ \mathcal{R}_{0} $ are established. It is found that the introduction of open advective environments leads to different monotonicity and asymptotic properties of the basic reproduction number$ \mathcal{R}_0 $ with respect to the diffusion rate$ d_I $ and advection speed$ q $ . Our analytical results suggest that increasing the advection speed or decreasing the diffusion rate of infected individuals helps to eradicate the diseases in open advective environments.- 1 January 2022
- Published by American Institute of Mathematical Sciences (AIMS) in Discrete and Continuous Dynamical Systems-Series B
- Vol. 27 (11) , 6655-6677
Open AccessA reaction-diffusion-advection SIS epidemic model with linear external source and open advective environments
In this paper, we propose a reaction-diffusion-advection SIS epidemic model with linear external source to study the effects of open advective environments on the persistence and extinction of infectious diseases. Threshold-type results on the global dynamics in terms of the basic reproduction number$ \mathcal{R}_{0} $ are established. It is found that the introduction of open advective environments leads to different monotonicity and asymptotic properties of the basic reproduction number$ \mathcal{R}_0 $ with respect to the diffusion rate$ d_I $ and advection speed$ q $ . Our analytical results suggest that increasing the advection speed or decreasing the diffusion rate of infected individuals helps to eradicate the diseases in open advective environments. - 1 July 2021
- Published by Elsevier in Operations Research Letters
- Vol. 49 (4) , 559-564
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
- 1 July 2021
- Published by Elsevier in Operations Research Letters
- Vol. 49 (4) , 559-564
Complexity, algorithms and applications of the integer network flow with fractional supplies problem
- 1 November 2020
- Published by Elsevier in Operations Research Letters
- Vol. 48 (6) , 835-839
A fully polynomial time approximation scheme for the Replenishment Storage problem
- 1 November 2020
- Published by Elsevier in Operations Research Letters
- Vol. 48 (6) , 835-839
A fully polynomial time approximation scheme for the Replenishment Storage problem
- 1 September 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 67 (5) , 1345-1361
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem
The replenishment storage problem (RSP) is to minimize the storage capacity requirement for a multiitem inventory system, where each item has a given reorder size, uniform demand, and cycle length. The discrete RSP, which allows reorders to take place only at integer time units within the cycle, is NP hard for constant joint cycle length (the least common multiple of the length of all individual cycles). We show that discrete RSP is weakly NP hard for constant joint cycle length and strongly NP hard for nonconstant joint cycle length. For constant joint cycle-length discrete RSP, we present a pseudopolynomial time algorithm that solves the problem optimally and the first known fully polynomial time approximation scheme for the single-cycle RSP. The scheme is utilizing a newly introduced integer programming formulation of the problem. For the strongly NP-hard RSP with nonconstant joint cycle length, we devise a polynomial time approximation scheme, which runs in linear time for fixed $\epsilon$. This paper further explores the relationship of discrete RSP with the continuous RSP, where reorders can take place at any time within a cycle.- 1 September 2019
- Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research
- Vol. 67 (5) , 1345-1361
The Replenishment Schedule to Minimize Peak Storage Problem: The Gap Between the Continuous and Discrete Versions of the Problem
The replenishment storage problem (RSP) is to minimize the storage capacity requirement for a multiitem inventory system, where each item has a given reorder size, uniform demand, and cycle length. The discrete RSP, which allows reorders to take place only at integer time units within the cycle, is NP hard for constant joint cycle length (the least common multiple of the length of all individual cycles). We show that discrete RSP is weakly NP hard for constant joint cycle length and strongly NP hard for nonconstant joint cycle length. For constant joint cycle-length discrete RSP, we present a pseudopolynomial time algorithm that solves the problem optimally and the first known fully polynomial time approximation scheme for the single-cycle RSP. The scheme is utilizing a newly introduced integer programming formulation of the problem. For the strongly NP-hard RSP with nonconstant joint cycle length, we devise a polynomial time approximation scheme, which runs in linear time for fixed $\epsilon$. This paper further explores the relationship of discrete RSP with the continuous RSP, where reorders can take place at any time within a cycle.