Research & Publications

Recent Working Papers

1.   The Impact of Profit Differentials on the Value of a Little Flexibility, (Shixin Wang, Jiawei Zhang, and Yicheng Zhang), under revision, 2023.

2. Breaking the Lower Bound with (Little) Structure: Acceleration in Non-convex Stochastic Optimization with Heavy-tailed Noise, (Zijian Liu, Jiawei Zhang, and Zhengyuan Zhou), to appear in the proceedings of the 36th Annual Conference on Learning Theory (COLT 2023).  

3. A General Framework for Resource Constrained Revenue Management with Demand Learning and Large Action Space, (Sentao Miao, Yining Wang, and Jiawei Zhang), under 2nd round revision, 2024.

4. Online Resource Allocation with Stochastic Resource Consumption, (Jiashuo Jiang and Jiawei Zhang), under revision, 2023. 

Publications

1. Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions, (Jiashuo Jiang, Will Ma, and Jiawei Zhang), Operations Research, accepted for publication, 2024. 

2. Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities, (Jiashuo Jiang, Will Ma, and Jiawei Zhang), Mathematics of Operations Research, accepted for publication, 2024.   

• A preliminary version appeared in the proceedings of the 24th ACM Conference on Economics and Computation (EC'23) , 2023.

3. Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack, (Jiashuo Jiang, Will Ma, and Jiawei Zhang), Operations Research, accepted for publication, 2024. 

• A preliminary version appeared in the proceedings of the ACM-SIAM Symposium on Discrete Algorithm (SODA 2022)

4. Doubly Optimal No-Regret Learning in Strongly Monotone Games with Bandit Feedback, (Wenjia Ba, Tianyi Lin, Jiawei Zhang, and Zhengyuan Zhou), Operations Research, accepted for publication, 2024.

5. Online Stochastic Optimization with Wasserstein Based Non-stationarity, (Jiashuo Jiang, Xiaocheng Li, and Jiawei Zhang), Management Science, accepted for publication, 2024.

6. Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies, (Boxiao Chen, Jiashuo Jiang, Jiawei Zhang and Zhengyuan Zhou), Management Science, accepted for publication, 2023.

7. Minimax Regret Robust Screening with Moment Information, (Shixin Wang, Shaoxuan Liu, and Jiawei Zhang), Manufacturing & Service Operations Management, published online, 2024.

8. Robust Assortment Optimization under the Markov Chain Choice Model, (Antoine Désir, Vineet Goyal, Bo Jiang, Tian Xie, and Jiawei Zhang),  Operations Research, published online, 2023.

9. Achieving High Individual Service-Levels without Safety Stock? Optimal Rationing Policy of Pooled Resources, (Jiashuo Jiang, Shixin Wang, and Jiawei Zhang), Operations Research, 71(1), pp. 358–377, 2023.

10. Capacitated Assortment Optimization: Hardness and Approximation , (Antoine Désir, Vineet Goyal, and J. Zhang), Operations Research, 70(2), pp. 893-904, 2022.

11. Robust Optimization Approach to Process Flexibility Designs with Price Differentials, (Shixin Wang, Xuan Wang, and Jiawei Zhang), Manufacturing & Service Operations Management, 24(1), pp. 632-646, 2022.

12. A Review of Flexible Processes and Operations, (Shixin Wang, Xuan Wang, and Jiawei Zhang), Production and Operations Management, 30(6), pp.1804-1824, 2021.

13. Online Resource Allocation with Limited Flexibility, (Arash Asadpour, Xuan Wang, and Jiawei Zhang), Management Science, 66(2), pp.642-666, 2020.

14. Optimal Design of Process Flexibility for General Production Systems, (Xin Chen, Tengyu Ma, Jiawei Zhang, and Yuan. Zhou), Operations Research, 67(2), pp. 516-531, 2019.

15. Budget Allocations in Operational Risk Management  (Yuqian  Xu, Jiawei Zhang, and Mike Pinedo, Probability in the Engineering and Informational Sciences, 32(3), pp. 434-459, 2018.

16. A NonCooperative Approach to Cost Allocation in Joint Replenishment (Simai He, Jay Sethuraman, Xuan Wang, and Jiawei Zhang), Operations Research, 65(6), pp.1562-1573, 2017.

17. Multi-Sourcing Supply Network Design: Two-Stage Chance-Constrained Model, Tractable Approximations, and Computational Results, (Yu Li , Jia Shu, Miao Song, Jiawei Zhang, Huan Zheng), INFORMS Journal on Computing, 29(2), pp.287-300, 2017.

18. Duality Approaches to Economic Lot-Sizing Games (Xin Chen and Jiawei Zhang), Production and Operations Management, 25(7), pp. 1203-1215 , 2016.

19. Sparse Process Flexibility Designs: Is Long Chain Really Optimal? (Antoine Desir, Vineet Goyal, Yehua Wei, and Jiawei Zhang), Operations Research, 64(2), pp. 416-431, 2016.

20. Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders (with Xi Chen and Yuan Zhou), Operations Research, accepted for publication, 2015.

21. Optimizing Product Launches in the Presence of Strategic Consumers (with Ilan Lobel, Jigar Patel, Gustavo Vulcano), Management Science, 62(6), pp. 1778-1799, 2016.

22. Process Flexibility: A Distribution-Free Bound on the Performance of K-Chain (with Xuan Wang), Operations Research, 63(3), pp 555-571, 2015.

23. Appointment Scheduling with Limited Distributional Information (with Ho-Yin Mak and Ying Rong), Management Science, 61(2):316-334, 2015.

24. Sequencing Appointments for Service Systems Using Inventory Approximations (with Ho-Yin Mak and Ying Rong), M&SOM, 16(2), pp. 251-262, 2014.

25. A Note on Appointment Scheduling with Piecewise Linear Cost Function (with Dongdong Ge, Guohua Wan, Zizhuo Wang), Mathematics of Operations Research, forthcoming, 2014.

26. Approximation Algorithms for Integrated Distribution Network Design Problems (with Y.Li, J. Shu, X. Wang, N. Xiu, D. Xu), INFORMS Journal on Computing, 25(3), pp. 572-584, 2013.

27. Newsvendor Optimization with Limited Distribution Information (with Zhisu Zhu and Yinyu Ye), Optimization Methods and Software, 28(3), pp. 640-667, 2013.

28. Polymatroid Optimization, Submodularity, and Joint Replenishment Games (with Simai He and Shuzhong Zhang), Operations Research, 60(1), pp. 128-137, 2012.

29. Design of Price Mechanisms for Network Resource Allocation via Price of Anarchy (with Ying-Ju Chen), Mathematical Programming, 131(1-2), pp. 333-364, 2012.

30. The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms (with Zuo-Jun Shen and Lezhou Zhan), INFORMS Journal on Computing, 23(3), pp. 470-482, 2011.

31. Geomtric Rounding: Dependent Randomized Rounding Scheme (D. Ge, S. He, Y.Ye, J. Zhang), Journal of Combinatorial Optimization, 22(4), pp. 699-725, 2011.

32. Bounding Probability of Small Deviation: a Fourth Moment Approach (with Simai He and Shuzhong Zhang), Mathematics of Operations Research, Vol. 35, pp. 233-256, 2010.

33. Integrating Facility Location and Production Planning Decisions (E. Romeijn, T. Sharkey, and Z.-J. Shen), Networks, Vol. 55, pp. 78-89, 2010.

34. A Stochastic Programming Duality Approach to Inventory Centralization Games (with Xin Chen), Operations Research, Vol. 57, pp. 840-851, 2009.

35. Cost Allocation for Joint Replenishment Models, Operations Research, Vol 57, No. 1, pp. 146-156, 2009.

36. Stochastic Combinatorial Optimization with Controllable Risk Aversion Level (with Man-Cho So and Yinyu Ye), Mathematics of Operations Research, Vol. 34, pp. 522-537, 2009.

37. Approximation algorithms for general one-warehouse multi-retailer systems (Z.-J. Shen, J. Shu, D. Simchi-Levi, C.-P. Teo), Naval Research Logistics, Vol. 56, pp. 646-658, 2009.

38. Some Characterization for SOC-monotone and SOC-convex functions (J.S. Chen, X. Chen, S. Pan, J. Zhang), Journal of Global Optimization, Vol. 45, pp. 259-279, 2009.

39. A unified theorem on SDP rank reduction (with Man-Cho So and Yinyu Ye), Mathematics of Operations Research, Vol. 33, No. 4, pp. 910-920, 2008.

40. A linear decision-based approximation approach to stochastic programming (with Xin Chen, Melvyn Sim, and Peng Sun), Operations Research, Vol. 56, No. 2, pp. 344-357, 2008.

41. Scheduling Multiple Products on Parallel Machines with Setup Costs (V. Krasik, J. Leung, M. Pinedo, J. Zhang), Naval Research Logistics, Vol. 55. No. 7, pp. 654 -669, 2008.

42. On Approximating Complex Quadratic Optimization Problems via Semidenite Programming Relaxations (A. M-C. So, J. Zhang, Y. Ye), Mathematical Programming, Vol. 110, No. 1, pp. 93-110, 2007.

43. Approximating the Radii of Point Sets (K. Vagradarajan, S. Venkatesh, Y. Ye, J. Zhang), SIAM Journal on Computing, Vol 36, No. 6, pp. 1764-1776, 2007.

44. Minimizing Total Weighted Completion Time when Scheduling Orders in a Flexible Environment with Uniform Machines (J. Leung, H. Li, M. Pinedo, J. Zhang), Information Processing Letters, Vol. 103, No. 3, pp. 119-129, 2007.

45. Approximating the Two-Level Facility Location Problem Via a Quasi-Greedy Approach, Mathematical Programming, Vol. 108, No.1, pp. 159-176, 2006.

46. Approximation Algorithms for Metric Facility Location Problems (M. Mahdian, Y.Ye, J. Zhang), SIAM Journal on Computing, Vol 36, No. 2, pp. 411-432, 2006.

47. Partitioning of Testing Time: Theoretical Properties and Practical Implications (T. Wang, J. Zhang), Psychometrika, Vol. 71, No. 1, pp. 105-120, 2006.

48. Lot-sizing Scheduling with Batch Setup Times (B. Chen, Y. Ye, J. Zhang), Journal of Scheduling, Vol. 9, No. 3, pp. 299-310, 2006.

49. Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem (J. Zhang, B. Chen, Y. Ye), Mathematics of Operations Research, Vol 30, No. 2, pp. 389-403, 2005.

50. Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem (A. Ageev, Y. Ye, J. Zhang), SIAM Journal on Discrete Mathematics, Vol 18, No. 1, pp. 207-217, 2004.

51. Improved Approximations for Max Set Splitting and Max NAE SAT (J. Zhang, Y.Ye, Q. Han), Discrete Applied Mathematics, vol. 142, no 1-3, pp. 133-149, 2004.

52. Approximate the 2-Catalog Segmentation Problem Using Semidenite Programming Relaxation (D. Xu, Y. Ye, J. Zhang), Optimization Methods and Software, Vol. 18, No. 6, pp. 705-719, 2003.

53. An Approximation Algorithm for Scheduling Two Parallel Machines with Capacity Constraints (H. Yang, Y. Ye, J. Zhang), Discrete Applied Mathematics, Vol. 130, No. 3, pp. 449-467, 2003.

54. Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection (Y. Ye, J. Zhang), Journal of Global Optimization, Vol. 25, No. 1, pp. 55-73, 2003.

55. An Improved Rounding Method and Semidefinite Programming Relaxation for Graph Partition (Q. Han, Y. Ye, J. Zhang), Mathematical Programming, Vol. 92, No. 3, pp. 509-535, 2002.

56. A Note on the Maximization Version of the Multi-level Facility Location Problem (Y. Ye, J. Zhang), Operations Research Letters, Vol. 30, No. 5, pp. 333-335, 2002.

57. On Approximation of Max-Vertex-Cover (Q. Han, Y. Ye, H. Zhang, J. Zhang), European Journal of Operational Research, Vol. 143, No. 2, pp. 207-220, 2002.

58. Parallel Machine Scheduling with Splitting Jobs (W. Xing, J. Zhang), Discrete Applied Mathematics, Vol. 103, No. 1-3, pp. 259-269, 2000.