Jiawei Zhang
Orcid: 0000-0003-4988-6028Affiliations:
- 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 45 papers
between 2002 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Manuf. Serv. Oper. Manag., 2024
Manag. Sci., 2024
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
Oper. Res., 2022
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions.
CoRR, 2022
Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022
2020
2019
Oper. Res., 2019
2017
Oper. Res., 2017
2016
Oper. Res., 2016
2015
Oper. Res., 2015
Asia Pac. J. Oper. Res., 2015
2013
Optim. Methods Softw., 2013
INFORMS J. Comput., 2013
2012
Math. Program., 2012
Oper. Res., 2012
2011
2010
Math. Oper. Res., 2010
2009
Math. Oper. Res., 2009
2008
2007
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
On approximating complex quadratic optimization problems via semidefinite programming relaxations.
Math. Program., 2007
Proceedings of the Internet and Network Economics, Third International Workshop, 2007
2006
SIAM J. Comput., 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
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
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
J. Glob. Optim., 2003
An approximation algorithm for scheduling two parallel machines with capacity constraints.
Discret. Appl. Math., 2003
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
Proceedings of the 42nd IEEE Conference on Decision and Control, 2003
2002
Oper. Res. Lett., 2002
An improved rounding method and semidefinite programming relaxation for graph partition.
Math. Program., 2002
Proceedings of the 43rd Symposium on Foundations of Computer Science (FOCS 2002), 2002
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002