Jiawei Zhang

Orcid: 0000-0003-4988-6028

Affiliations:
  • New York University, Department of Information, Operations and Management Sciences, Stern School of Business, NY, USA
  • Stanford University, Department of Management Science and Engineering, School of Engineering, CA, USA


According to our database1, Jiawei Zhang authored at least 38 papers between 2002 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources.
Oper. Res., January, 2023

Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities.
Proceedings of the 24th ACM Conference on Economics and Computation, 2023

2022
Technical Note - Capacitated Assortment Optimization: Hardness and Approximation.
Oper. Res., 2022

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions.
CoRR, 2022

Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies.
CoRR, 2022

Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack.
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

2020
Online Stochastic Optimization with Wasserstein Based Non-stationarity.
CoRR, 2020

2019
Optimal Design of Process Flexibility for General Production Systems.
Oper. Res., 2019

2017
A NonCooperative Approach to Cost Allocation in Joint Replenishment.
Oper. Res., 2017

2013
Newsvendor optimization with limited distribution information.
Optim. Methods Softw., 2013

2012
Design of price mechanisms for network resource allocation via price of anarchy.
Math. Program., 2012

Polymatroid Optimization, Submodularity, and Joint Replenishment Games.
Oper. Res., 2012

2011
Geometric rounding: a dependent randomized rounding scheme.
J. Comb. Optim., 2011

2010
Bounding Probability of Small Deviation: A Fourth Moment Approach.
Math. Oper. Res., 2010

2009
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level.
Math. Oper. Res., 2009

2008
A Unified Theorem on SDP Rank Reduction.
Math. Oper. Res., 2008

2007
Greedy Algorithms for Metric Facility Location Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems.
Proceedings of the Handbook of Approximation Algorithms and Metaheuristics., 2007

Approximating the Radii of Point Sets.
SIAM J. Comput., 2007

On approximating complex quadratic optimization problems via semidefinite programming relaxations.
Math. Program., 2007

A Note on Equilibrium Pricing as Convex Optimization.
Proceedings of the Internet and Network Economics, Third International Workshop, 2007

2006
Approximation Algorithms for Metric Facility Location Problems.
SIAM J. Comput., 2006

Lot-sizing scheduling with batch setup times.
J. Sched., 2006

2005
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem.
Math. Oper. Res., 2005

2004
Improved Combinatorial Approximation Algorithms for the <i>k</i>-Level Facility Location Problem.
SIAM J. Discret. Math., 2004

Improved approximations for max set splitting and max NAE SAT.
Discret. Appl. Math., 2004

A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract).
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

An approximation algorithm for scheduling aircraft with holding time.
Proceedings of the 43rd IEEE Conference on Decision and Control, 2004

2003
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations.
Optim. Methods Softw., 2003

Approximation of Dense-<i>n</i>/2-Subgraph and the Complement of Min-Bisection.
J. Glob. Optim., 2003

An approximation algorithm for scheduling two parallel machines with capacity constraints.
Discret. Appl. Math., 2003

A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem.
Proceedings of the Approximation, 2003

Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

MILP formulation and polynomial time algorithm for an aircraft scheduling problem.
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003

2002
A note on the maximization version of the multi-level facility location problem.
Oper. Res. Lett., 2002

An improved rounding method and semidefinite programming relaxation for graph partition.
Math. Program., 2002

On approximation of max-vertex-cover.
Eur. J. Oper. Res., 2002

Improved Approximation Algorithms for Metric Facility Location Problems.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002


  Loading...