Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJiawei Zhang 0006
Person information
- affiliation: New York University, Department of Information, Operations and Management Sciences, Stern School of Business, NY, USA
- affiliation: Stanford University, Department of Management Science and Engineering, School of Engineering, CA, USA
Other persons with the same name
- Jiawei Zhang (aka: Jia-Wei Zhang, Jia Wei Zhang) — disambiguation page
- Jiawei Zhang 0001
![[0000-0002-2111-7617]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-2111-7617")
— University of California, Davis, Department of Computer Science, IFM Lab, CA, USA (and 2 more) - Jiawei Zhang 0002 — SenseTime Research, Shenzhen, China (and 1 more)
- Jiawei Zhang 0003 — Purdue University, West Lafayette, IN, USA
- Jiawei Zhang 0004 — Beijing University of Posts and Telecommunication, State Key Laboratory of Information Photonics and Optical Communications, China
- Jiawei Zhang 0007 — Chinese University of Hong Kong, School of Science and Engineering, Shenzhen, China (and 1 more)
- Jiawei Zhang 0008 — East China Jiaotong University, China
- Jia-Wei Zhang 0009 (aka: Jiawei Zhang 0009) — Guangxi University, School of Business Administration, Nanning, China
- Jia-Wei Zhang 0010 (aka: Jiawei Zhang 0010) — Northeast Forestry University, Electromechanical Engineering Academy, Harbin, China
- Jiawei Zhang 0011 — Xidian University, School of Cyber Engineering, Xi'an, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j27]Shixin Wang, Shaoxuan Liu, Jiawei Zhang:
Minimax Regret Robust Screening with Moment Information. Manuf. Serv. Oper. Manag. 26(3): 992-1012 (2024)- 2023
- [j26]Jiashuo Jiang, Shixin Wang, Jiawei Zhang:
Achieving High Individual Service Levels Without Safety Stock? Optimal Rationing Policy of Pooled Resources. Oper. Res. 71(1): 358-377 (2023) - [c11]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. EC 2023: 909 - 2022
- [j25]Antoine Désir, Vineet Goyal, Jiawei Zhang:
Technical Note - Capacitated Assortment Optimization: Hardness and Approximation. Oper. Res. 70(2): 893-904 (2022) - [c10]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. SODA 2022: 1221-1246 - [i6]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tightness without Counterexamples: A New Approach and New Results for Prophet Inequalities. CoRR abs/2205.00588 (2022) - [i5]Boxiao Chen, Jiashuo Jiang, Jiawei Zhang, Zhengyuan Zhou:
Learning to Order for Inventory Systems with Lost Sales and Uncertain Supplies. CoRR abs/2207.04550 (2022) - [i4]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions. CoRR abs/2210.07996 (2022) - 2021
- [i3]Jiashuo Jiang, Will Ma, Jiawei Zhang:
Tight Guarantees for Multi-unit Prophet Inequalities and Online Stochastic Knapsack. CoRR abs/2107.02058 (2021) - 2020
- [i2]Jiashuo Jiang, Xiaocheng Li, Jiawei Zhang:
Online Stochastic Optimization with Wasserstein Based Non-stationarity. CoRR abs/2012.06961 (2020)
2010 – 2019
- 2019
- [j24]Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou:
Optimal Design of Process Flexibility for General Production Systems. Oper. Res. 67(2): 516-531 (2019) - 2018
- [i1]Xi Chen, Tengyu Ma, Jiawei Zhang, Yuan Zhou:
Optimal Design of Process Flexibility for General Production Systems. CoRR abs/1806.02894 (2018) - 2017
- [j23]Simai He, Jay Sethuraman, Xuan Wang, Jiawei Zhang:
A NonCooperative Approach to Cost Allocation in Joint Replenishment. Oper. Res. 65(6): 1562-1573 (2017) - 2015
- [j22]Chenchen Wu, Dachuan Xu, Jiawei Zhang:
Safe Approximations for Distributionally Robust Joint Chance Constrained Program. Asia Pac. J. Oper. Res. 32(1): 1540004:1-1540004:20 (2015) - [j21]Xi Chen, Jiawei Zhang, Yuan Zhou:
Optimal Sparse Designs for Process Flexibility via Probabilistic Expanders. Oper. Res. 63(5): 1159-1176 (2015) - 2013
- [j20]Zhisu Zhu, Jiawei Zhang, Yinyu Ye:
Newsvendor optimization with limited distribution information. Optim. Methods Softw. 28(3): 640-667 (2013) - 2012
- [j19]Simai He, Jiawei Zhang, Shuzhong Zhang:
Polymatroid Optimization, Submodularity, and Joint Replenishment Games. Oper. Res. 60(1): 128-137 (2012) - [j18]Ying-Ju Chen, Jiawei Zhang:
Design of price mechanisms for network resource allocation via price of anarchy. Math. Program. 131(1-2): 333-364 (2012) - 2011
- [j17]Dongdong Ge, Simai He, Yinyu Ye, Jiawei Zhang:
Geometric rounding: a dependent randomized rounding scheme. J. Comb. Optim. 22(4): 699-725 (2011) - 2010
- [j16]Simai He, Jiawei Zhang, Shuzhong Zhang:
Bounding Probability of Small Deviation: A Fourth Moment Approach. Math. Oper. Res. 35(1): 208-232 (2010)
2000 – 2009
- 2009
- [j15]Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level. Math. Oper. Res. 34(3): 522-537 (2009) - 2008
- [j14]Anthony Man-Cho So, Yinyu Ye, Jiawei Zhang:
A Unified Theorem on SDP Rank Reduction. Math. Oper. Res. 33(4): 910-920 (2008) - 2007
- [j13]Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
On approximating complex quadratic optimization problems via semidefinite programming relaxations. Math. Program. 110(1): 93-110 (2007) - [j12]Kasturi R. Varadarajan, Srinivasan Venkatesh, Yinyu Ye, Jiawei Zhang:
Approximating the Radii of Point Sets. SIAM J. Comput. 36(6): 1764-1776 (2007) - [c9]Lihua Chen, Yinyu Ye, Jiawei Zhang:
A Note on Equilibrium Pricing as Convex Optimization. WINE 2007: 7-16 - [r2]Jiawei Zhang, Yinyu Ye, Anthony Man-Cho So:
On Analyzing Semidefinite Programming Relaxations of Complex Quadratic Optimization Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - [r1]Jiawei Zhang, Yinyu Ye, Anthony Man-Cho So:
Greedy Algorithms for Metric Facility Location Problems. Handbook of Approximation Algorithms and Metaheuristics 2007 - 2006
- [j11]Bo Chen, Yinyu Ye, Jiawei Zhang:
Lot-sizing scheduling with batch setup times. J. Sched. 9(3): 299-310 (2006) - [j10]Mohammad Mahdian, Yinyu Ye, Jiawei Zhang:
Approximation Algorithms for Metric Facility Location Problems. SIAM J. Comput. 36(2): 411-432 (2006) - [c8]Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
Stochastic Combinatorial Optimization with Controllable Risk Aversion Level. APPROX-RANDOM 2006: 224-235 - 2005
- [j9]Jiawei Zhang, Bo Chen, Yinyu Ye:
A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem. Math. Oper. Res. 30(2): 389-403 (2005) - [c7]Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye:
On Approximating Complex Quadratic Optimization Problems via Semidefinite Programming Relaxations. IPCO 2005: 125-135 - 2004
- [j8]Jiawei Zhang, Yinyu Ye, Qiaoming Han:
Improved approximations for max set splitting and max NAE SAT. Discret. Appl. Math. 142(1-3): 133-149 (2004) - [j7]Alexander A. Ageev, Yinyu Ye, Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. SIAM J. Discret. Math. 18(1): 207-217 (2004) - [c6]Alexandre M. Bayen, Claire J. Tomlin, Yinyu Ye, Jiawei Zhang:
An approximation algorithm for scheduling aircraft with holding time. CDC 2004: 2760-2767 - [c5]Jiawei Zhang, Bo Chen, Yinyu Ye:
A Multi-exchange Local Search Algorithm for the Capacitated Facility Location Problem: (Extended Abstract). IPCO 2004: 219-233 - 2003
- [j6]Heng Yang, Yinyu Ye, Jiawei Zhang:
An approximation algorithm for scheduling two parallel machines with capacity constraints. Discret. Appl. Math. 130(3): 449-467 (2003) - [j5]Yinyu Ye, Jiawei Zhang:
Approximation of Dense-n/2-Subgraph and the Complement of Min-Bisection. J. Glob. Optim. 25(1): 55-73 (2003) - [j4]Dachuan Xu, Yinyu Ye, Jiawei Zhang:
Approximating the 2-catalog segmentation problem using semidefinite programming relaxations. Optim. Methods Softw. 18(6): 705-719 (2003) - [c4]Alexandre M. Bayen, Claire J. Tomlin, Yinyu Ye, Jiawei Zhang:
MILP formulation and polynomial time algorithm for an aircraft scheduling problem. CDC 2003: 5003-5010 - [c3]Alexander A. Ageev, Yinyu Ye, Jiawei Zhang:
Improved Combinatorial Approximation Algorithms for the k-Level Facility Location Problem. ICALP 2003: 145-156 - [c2]Mohammad Mahdian, Yingyu Ye, Jiawei Zhang:
A 2-Approximation Algorithm for the Soft-Capacitated Facility Location Problem. RANDOM-APPROX 2003: 129-140 - 2002
- [j3]Qiaoming Han, Yinyu Ye, Hantao Zhang, Jiawei Zhang:
On approximation of max-vertex-cover. Eur. J. Oper. Res. 143(2): 342-355 (2002) - [j2]Qiaoming Han, Yinyu Ye, Jiawei Zhang:
An improved rounding method and semidefinite programming relaxation for graph partition. Math. Program. 92(3): 509-535 (2002) - [j1]Jiawei Zhang, Yinyu Ye:
A note on the maximization version of the multi-level facility location problem. Oper. Res. Lett. 30(5): 333-335 (2002) - [c1]Mohammad Mahdian, Yinyu Ye, Jiawei Zhang:
Improved Approximation Algorithms for Metric Facility Location Problems. APPROX 2002: 229-242
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-26 22:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
