Improved Approximation Algorithms for Metric Facility Location Problems. - Mohammad Mahdian; Yinyu Ye 001; Jiawei Zhang 006 (APPROX, 2002)

On Approximating the Radii of Point Sets in High Dimensions. - Kasturi R. Varadarajan; Srinivasan Venkatesh 001; Jiawei Zhang 006 (FOCS, 2002)

On approximation of max-vertex-cover. - Qiaoming Han; Yinyu Ye 001; Hantao Zhang 001; Jiawei Zhang 006 (Eur. J. Oper. Res., 2002)

An improved rounding method and semidefinite programming relaxation for graph partition. - Qiaoming Han; Yinyu Ye 001; Jiawei Zhang 006 (Math. Program., 2002)

A note on the maximization version of the multi-level facility location problem. - Jiawei Zhang 006; Yinyu Ye 001 (Oper. Res. Lett., 2002)

MILP formulation and polynomial time algorithm for an aircraft scheduling problem. - Alexandre M. Bayen; Claire J. Tomlin; Yinyu Ye 001; Jiawei Zhang 006 (CDC, 2003)

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. - Alexander A. Ageev; Yinyu Ye 001; Jiawei Zhang 006 (ICALP, 2003)

A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. - Mohammad Mahdian; Yingyu Ye; Jiawei Zhang 006 (RANDOM-APPROX, 2003)

An approximation algorithm for scheduling two parallel machines with capacity constraints. - Heng Yang; Yinyu Ye 001; Jiawei Zhang 006 (Discret. Appl. Math., 2003)

Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection. - Yinyu Ye 001; Jiawei Zhang 006 (J. Glob. Optim., 2003)

Approximating the 2-catalog segmentation problem using semidefinite programming relaxations. - Dachuan Xu; Yinyu Ye 001; Jiawei Zhang 006 (Optim. Methods Softw., 2003)

An approximation algorithm for scheduling aircraft with holding time. - Alexandre M. Bayen; Claire J. Tomlin; Yinyu Ye 001; Jiawei Zhang 006 (CDC, 2004)

A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract). - Jiawei Zhang 006; Bo Chen 002; Yinyu Ye 001 (IPCO, 2004)

Improved approximations for max set splitting and max NAE SAT. - Jiawei Zhang 006; Yinyu Ye 001; Qiaoming Han (Discret. Appl. Math., 2004)

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. - Alexander A. Ageev; Yinyu Ye 001; Jiawei Zhang 006 (SIAM J. Discret. Math., 2004)

A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem. - Jiawei Zhang 006; Bo Chen 002; Yinyu Ye 001 (Math. Oper. Res., 2005)

Lot-sizing scheduling with batch setup times. - Bo Chen 002; Yinyu Ye 001; Jiawei Zhang 006 (J. Sched., 2006)

Approximation Algorithms for Metric Facility Location Problems. - Mohammad Mahdian; Yinyu Ye 001; Jiawei Zhang 006 (SIAM J. Comput., 2006)

A Note on Equilibrium Pricing as Convex Optimization. - Lihua Chen; Yinyu Ye 001; Jiawei Zhang 006 (WINE, 2007)

On approximating complex quadratic optimization problems via semidefinite programming relaxations. - Anthony Man-Cho So; Jiawei Zhang 006; Yinyu Ye 001 (Math. Program., 2007)

Approximating the Radii of Point Sets. - Kasturi R. Varadarajan; Srinivasan Venkatesh 001; Yinyu Ye 001; Jiawei Zhang 006 (SIAM J. Comput., 2007)

On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems. - Jiawei Zhang 006; Yinyu Ye 001; Anthony Man-Cho So (Handbook of Approximation Algorithms and Metaheuristics, 2007)

Greedy Algorithms for Metric Facility Location Problems. - Jiawei Zhang 006; Yinyu Ye 001; Anthony Man-Cho So (Handbook of Approximation Algorithms and Metaheuristics, 2007)

A Unified Theorem on SDP Rank Reduction. - Anthony Man-Cho So; Yinyu Ye 001; Jiawei Zhang 006 (Math. Oper. Res., 2008)

Stochastic Combinatorial Optimization with Controllable Risk Aversion Level. - Anthony Man-Cho So; Jiawei Zhang 006; Yinyu Ye 001 (Math. Oper. Res., 2009)

Bounding Probability of Small Deviation: A Fourth Moment Approach. - Simai He; Jiawei Zhang 006; Shuzhong Zhang (Math. Oper. Res., 2010)

Geometric rounding: a dependent randomized rounding scheme. - Dongdong Ge; Simai He; Yinyu Ye 001; Jiawei Zhang 006 (J. Comb. Optim., 2011)

Polymatroid Optimization, Submodularity, and Joint Replenishment Games. - Simai He; Jiawei Zhang 006; Shuzhong Zhang (Oper. Res., 2012)

Design of price mechanisms for network resource allocation via price of anarchy. - Ying-Ju Chen; Jiawei Zhang 006 (Math. Program., 2012)

Approximation Algorithms for Integrated Distribution Network Design Problems. - Yu Li; Jia Shu; Xi Wang; Naihua Xiu; Dachuan Xu; Jiawei Zhang 006 (INFORMS J. Comput., 2013)

Newsvendor optimization with limited distribution information. - Zhisu Zhu; Jiawei Zhang 006; Yinyu Ye 001 (Optim. Methods Softw., 2013)

Safe Approximations for Distributionally Robust Joint Chance Constrained Program. - Chenchen Wu; Dachuan Xu; Jiawei Zhang 006 (Asia Pac. J. Oper. Res., 2015)

Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders. - Xi Chen 010; Jiawei Zhang 006; Yuan Zhou 007 (Oper. Res., 2015)

Sparse Process Flexibility Designs: Is the Long Chain Really Optimal? - Antoine Désir; Vineet Goyal; Yehua Wei; Jiawei Zhang 006 (Oper. Res., 2016)

A NonCooperative Approach to Cost Allocation in Joint Replenishment. - Simai He; Jay Sethuraman; Xuan Wang 003; Jiawei Zhang 006 (Oper. Res., 2017)

Optimal Design of Process Flexibility for General Production Systems. - Xi Chen 010; Tengyu Ma 001; Jiawei Zhang 006; Yuan Zhou 007 (Oper. Res., 2019)

Online Stochastic Optimization with Wasserstein Based Non-stationarity. - Jiashuo Jiang; Xiaocheng Li; Jiawei Zhang 006 (CoRR, 2020)

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (SODA, 2022)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (CoRR, 2022)

Technical Note - Capacitated Assortment Optimization: Hardness and Approximation. - Antoine Désir; Vineet Goyal; Jiawei Zhang 006 (Oper. Res., 2022)

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (EC, 2023)

Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources. - Jiashuo Jiang; Shixin Wang 006; Jiawei Zhang 006 (Oper. Res., 2023)

Robust Assortment Optimization Under the Markov Chain Choice Model. - Antoine Désir; Vineet Goyal; Bo Jiang 007; Tian Xie 008; Jiawei Zhang 006 (Oper. Res., 2024)

Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies. - Boxiao Chen; Jiashuo Jiang; Jiawei Zhang 006; Zhengyuan Zhou (Manag. Sci., 2024)

Minimax Regret Robust Screening with Moment Information. - Shixin Wang 006; Shaoxuan Liu; Jiawei Zhang 006 (Manuf. Serv. Oper. Manag., 2024)

Tight Guarantees for Multiunit Prophet Inequalities and Online Stochastic Knapsack. - Jiashuo Jiang; Will Ma; Jiawei Zhang 006 (Oper. Res., 2025)