Weijun Xie

Orcid: 0000-0001-5157-1194

Affiliations:
  • Georgia Institute of Technology, Atlanta, GA, USA
  • Virginia Tech, Blacksburg, VA, USA (2017 - 2022)
  • Georgia Institute of Technology, Atlanta, GA, USA (PhD 2017)
  • University of Illinois at Urbana Champaign, Urbana, IL, USA (2010 - 2013)
  • Tsinghua University, Institute of Transportation Engineering, Department of Civil Engineering, Beijing, China (former)


According to our database1, Weijun Xie authored at least 39 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Beyond symmetry: best submatrix selection for the sparse truncated SVD.
Math. Program., November, 2024

Distributionally Favorable Optimization: A Framework for Data-Driven Decision-Making with Endogenous Outliers.
SIAM J. Optim., March, 2024

A note on quadratic constraints with indicator variables: Convex hull description and perspective relaxation.
Oper. Res. Lett., 2024

Best Principal Submatrix Selection for the Maximum Entropy Sampling Problem: Scalable Algorithms and Performance Guarantees.
Oper. Res., 2024

D-Optimal Data Fusion: Exact and Approximation Algorithms.
INFORMS J. Comput., 2024

On the Partial Convexification of the Low-Rank Spectral Optimization: Rank Bounds and Algorithms.
Proceedings of the Integer Programming and Combinatorial Optimization, 2024

ReDBeam: Real-time MU-MIMO Beamforming with Limited CSI Data Samples.
Proceedings of the IEEE International Conference on Communications, 2024

Learning Fair Policies for Multi-Stage Selection Problems from Observational Data.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Automated Vehicle Identification Based on Car-Following Data With Machine Learning.
IEEE Trans. Intell. Transp. Syst., December, 2023

Distributionally Robust Fair Transit Resource Allocation During a Pandemic.
Transp. Sci., July, 2023

2022
ALSO-X and ALSO-X+: Better Convex Approximations for Chance Constrained Programs.
Oper. Res., November, 2022

Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making.
Math. Program., 2022

Optimized Bonferroni approximations of distributionally robust joint chance constraints.
Math. Program., 2022

Smooth Robust Tensor Completion for Background/Foreground Separation with Missing Pixels: Novel Algorithm with Convergence Guarantee.
J. Mach. Learn. Res., 2022

On Cluster-Aware Supervised Learning: Frameworks, Convergent Algorithms, and Applications.
INFORMS J. Comput., 2022

D<sup>2</sup>BF - Data-Driven Beamforming in MU-MIMO with Channel Estimation Uncertainty.
Proceedings of the IEEE INFOCOM 2022, 2022

2021
Clustered Discriminant Regression for High-Dimensional Data Feature Extraction and Its Applications in Healthcare and Additive Manufacturing.
IEEE Trans Autom. Sci. Eng., 2021

On distributionally robust chance constrained programs with Wasserstein distance.
Math. Program., 2021

Multiproduct Newsvendor Problem with Customer-Driven Demand Substitution: A Stochastic Integer Program Perspective.
INFORMS J. Comput., 2021

Robust multi-product newsvendor model with uncertain demand and substitution.
Eur. J. Oper. Res., 2021

2020
Scalable Algorithms for the Sparse Ridge Regression.
SIAM J. Optim., 2020

Tractable reformulations of two-stage distributionally robust linear programs over the type-∞ Wasserstein ball.
Oper. Res. Lett., 2020

Approximation Algorithms for <i>D</i>-optimal Design.
Math. Oper. Res., 2020

Bicriteria Approximation of Chance-Constrained Covering Problems.
Oper. Res., 2020

Unbiased Subdata Selection for Fair Classification: A Unified Framework and Scalable Algorithms.
CoRR, 2020

Exact and Approximation Algorithms for Sparse PCA.
CoRR, 2020

2019
Combinatorial Algorithms for Optimal Design.
Proceedings of the Conference on Learning Theory, 2019

2018
On Deterministic Reformulations of Distributionally Robust Joint Chance Constrained Optimization Problems.
SIAM J. Optim., 2018

On quantile cuts and their closure for chance constrained optimization problems.
Math. Program., 2018

Relaxations and approximations of chance constraints under finite distributions.
Math. Program., 2018

Approximate Positively Correlated Distributions and Approximation Algorithms for D-optimal Design.
CoRR, 2018

Distributionally robust simple integer recourse.
Comput. Manag. Sci., 2018

Approximate Positive Correlated Distributions and Approximation Algorithms for D-optimal Design.
Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

2017
Nonanticipative duality, relaxations, and formulations for chance-constrained stochastic programs.
Math. Program., 2017

2016
Reliable Location-Routing Design Under Probabilistic Facility Disruptions.
Transp. Sci., 2016

Optimizing Location and Capacity for Multiple Types of Locomotive Maintenance Shops.
Comput. Aided Civ. Infrastructure Eng., 2016

On the Quantile Cut Closure of Chance-Constrained Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 2016

2013
Dynamic Planning of Facility Locations with Benefits from Multitype Facility Colocation.
Comput. Aided Civ. Infrastructure Eng., 2013

2009
Stabilization of traffic flow based on multi-anticipative intelligent driver model.
Proceedings of the 12th International IEEE Conference on Intelligent Transportation Systems, 2009


  Loading...