default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZizhuo Wang 0001
Person information
- affiliation: Chinese University of Hong Kong, Institute for Data and Decision Analytics, Shenzhen, China
- affiliation: University of Minnesota, Industrial and Systems Engineering, MN, USA
- affiliation (PhD 2012): Stanford University, CA, USA
Other persons with the same name
- Zizhuo Wang — disambiguation page
- Zizhuo Wang 0002 — Tsinghua University, Beijing, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j33]Miao Zhang
, Jingyuan Yang, Chuwen Zhang, Simai He, Huikang Liu, Jinshen Wang, Zizhuo Wang:
An approximate dynamic programming approach for solving aircraft fleet engine maintenance problem: Methodology and a case study. Eur. J. Oper. Res. 321(3): 958-973 (2025)- 2024
- [i16]Zhengyang Tang, Chenyu Huang, Xin Zheng, Shixi Hu, Zizhuo Wang, Dongdong Ge, Benyou Wang:
ORLM: Training Large Language Models for Optimization Modeling. CoRR abs/2405.17743 (2024) - 2023
- [j32]Feng Zhu, Shaoxuan Liu, Rowan Wang, Zizhuo Wang:
Assign-to-Seat: Dynamic Capacity Control for Selling High-Speed Train Tickets. Manuf. Serv. Oper. Manag. 25(3): 921-938 (2023) - [j31]Yunzong Xu, Zizhuo Wang:
Assortment Optimization for a Multistage Choice Model. Manuf. Serv. Oper. Manag. 25(5): 1748-1764 (2023) - [j30]Yinbin Han, Zizhuo Wang:
Optimal switching policy for batch servers. Oper. Res. Lett. 51(6): 560-567 (2023) - 2022
- [j29]Jiali Huang, Ankur Mani, Zizhuo Wang:
The Value of Price Discrimination in Large Social Networks. Manag. Sci. 68(6): 4454-4477 (2022) - [j28]Hongyu Chen, Zizhuo Wang:
Optimal control for parallel queues with a single batch server. Oper. Res. Lett. 50(4): 377-383 (2022) - [c8]Dian Yu, Jianjun Gao, Weiping Wu, Zizhuo Wang:
Price Interpretability of Prediction Markets: A Convergence Analysis. EC 2022: 466-467 - [c7]Bo Jiang, Zizhuo Wang, Nanxi Zhang:
Revenue Management Under a Price Alert Mechanism. WINE 2022: 366-367 - [c6]Tong Xie, Zizhuo Wang:
Personalized Assortment Optimization Under Consumer Choice Models with Local Network Effects. WINE 2022: 374 - [i15]Dian Yu, Jianjun Gao, Weiping Wu, Zizhuo Wang:
Price Interpretability of Prediction Markets: A Convergence Analysis. CoRR abs/2205.08913 (2022) - [i14]Dongdong Ge, Qi Huangfu, Zizhuo Wang, Jian Wu, Yinyu Ye:
Cardinal Optimizer (COPT) User Guide. CoRR abs/2208.14314 (2022) - 2021
- [j27]Yang Zhan, Zizhuo Wang, Guohua Wan:
Home service routing and appointment scheduling with stochastic service times. Eur. J. Oper. Res. 288(1): 98-110 (2021) - [j26]Guiyun Feng, Guangwen Kong, Zizhuo Wang:
We Are on the Way: Analysis of On-Demand Ride-Hailing Systems. Manuf. Serv. Oper. Manag. 23(5): 1237-1256 (2021) - 2020
- [j25]Yitian Chen, Yanfei Kang, Yixiong Chen, Zizhuo Wang:
Probabilistic forecasting with temporal convolutional neural network. Neurocomputing 399: 491-501 (2020) - [j24]Xi Chen, Qihang Lin, Zizhuo Wang:
Comparison-Based Algorithms for One-Dimensional Stochastic Convex Optimization. INFORMS J. Optim. 2(1): 34-56 (2020) - [j23]Ming Hu, Zizhuo Wang, Yinbo Feng:
Information Disclosure and Pricing Policies for Sales of Network Goods. Oper. Res. 68(4): 1162-1177 (2020) - [i13]Tianyu Wang, Lin F. Yang, Zizhuo Wang:
Random Walk Bandits. CoRR abs/2011.01445 (2020)
2010 – 2019
- 2019
- [c5]Jiali Huang, Ankur Mani, Zizhuo Wang:
The Value of Price Discrimination in Large Random Networks. EC 2019: 243-244 - [i12]Yitian Chen, Yanfei Kang, Yixiong Chen, Zizhuo Wang:
Probabilistic Forecasting with Temporal Convolutional Neural Network. CoRR abs/1906.04397 (2019) - 2018
- [j22]Guiyun Feng, Xiaobo Li, Zizhuo Wang:
On substitutability and complementarity in discrete choice models. Oper. Res. Lett. 46(1): 141-146 (2018) - [j21]Chenhao Du, William L. Cooper, Zizhuo Wang:
Optimal worst-case pricing for a logit demand model with network effects. Oper. Res. Lett. 46(3): 345-351 (2018) - 2017
- [j20]Guiyun Feng, Xiaobo Li, Zizhuo Wang:
Technical Note - On the Relation Between Several Discrete Choice Models. Oper. Res. 65(6): 1516-1525 (2017) - [j19]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Knapsack with variable weights satisfying linear constraints. J. Glob. Optim. 69(3): 713-725 (2017) - [j18]Ruxian Wang, Zizhuo Wang:
Consumer Choice Models with Endogenous Network Effects. Manag. Sci. 63(11): 3944-3960 (2017) - [j17]Xiao Alison Chen, Zizhuo Wang, Hongsong Yuan:
Optimal pricing for selling to a static multi-period newsvendor. Oper. Res. Lett. 45(5): 415-420 (2017) - [c4]Yichen Chen, Dongdong Ge, Mengdi Wang, Zizhuo Wang, Yinyu Ye, Hao Yin:
Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions. ICML 2017: 740-747 - [i11]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Assortment Optimization under a Single Transition Model. CoRR abs/1702.03700 (2017) - 2016
- [j16]Zizhuo Wang, Peter W. Glynn, Yinyu Ye:
Likelihood robust optimization for data-driven problems. Comput. Manag. Sci. 13(2): 241-261 (2016) - [j15]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Scheduling under linear constraints. Eur. J. Oper. Res. 253(2): 290-297 (2016) - [j14]Zizhuo Wang:
Technical Note - Intertemporal Price Discrimination via Reference Price Effects. Oper. Res. 64(2): 290-296 (2016) - [j13]Chenhao Du, William L. Cooper, Zizhuo Wang:
Optimal Pricing for a Multinomial Logit Choice Model with Network Effects. Oper. Res. 64(2): 441-455 (2016) - [j12]Zhengliang Xue, Zizhuo Wang, Markus Ettl:
Pricing Personalized Bundles: A New Approach and An Empirical Study. Manuf. Serv. Oper. Manag. 18(1): 51-68 (2016) - [j11]Zizhuo Wang, Yinyu Ye:
Hidden-City Ticketing: The Cause and Impact. Transp. Sci. 50(1): 288-305 (2016) - 2015
- [j10]Xiao Alison Chen, Zizhuo Wang:
A dynamic learning algorithm for online matching problems with concave returns. Eur. J. Oper. Res. 247(2): 379-388 (2015) - [j9]Zizhuo Wang:
On solving convex optimization problems with linear ascending constraints. Optim. Lett. 9(5): 819-838 (2015) - [i10]Dongdong Ge, Zizhuo Wang, Yinyu Ye, Hao Yin:
Strong NP-Hardness Result for Regularized $L_q$-Minimization Problems with Concave Penalty Functions. CoRR abs/1501.00622 (2015) - [i9]Kameng Nip, Zhenbo Wang, Zizhuo Wang:
Scheduling under Linear Constraints. CoRR abs/1510.08551 (2015) - 2014
- [j8]Zizhuo Wang, Shiming Deng, Yinyu Ye:
Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems. Oper. Res. 62(2): 318-331 (2014) - [j7]Shipra Agrawal, Zizhuo Wang, Yinyu Ye:
A Dynamic Near-Optimal Algorithm for Online Linear Programming. Oper. Res. 62(4): 876-890 (2014) - [j6]Dongdong Ge, Guohua Wan, Zizhuo Wang, Jiawei Zhang:
A Note on Appointment Scheduling with Piecewise Linear Cost Functions. Math. Oper. Res. 39(4): 1244-1251 (2014) - [j5]Xiaojun Chen, Dongdong Ge, Zizhuo Wang, Yinyu Ye:
Complexity of unconstrained $$L_2-L_p$$ minimization. Math. Program. 143(1-2): 371-383 (2014) - [i8]Dongdong Ge, Zizhuo Wang, Lai Wei, Jiawei Zhang:
An Improved Algorithm for Fixed-Hub Single Allocation Problem. CoRR abs/1402.4183 (2014) - 2013
- [j4]Yuhang Liu, Zizhuo Wang:
A simple policy for multiple queues with size-independent service times. Oper. Res. Lett. 41(5): 535-539 (2013) - [i7]Yuhang Liu, Zizhuo Wang:
A Simple Policy for Multiple Queues with Size-Independent Service Times. CoRR abs/1306.3513 (2013) - [i6]Xiao Chen, Zizhuo Wang:
A Near-Optimal Dynamic Learning Algorithm for Online Matching Problems with Concave Returns. CoRR abs/1307.5934 (2013) - 2012
- [j3]Hongyang Chen, Gang Wang, Zizhuo Wang, Hing-Cheung So, H. Vincent Poor:
Non-Line-of-Sight Node Localization Based on Semi-Definite Programming in Wireless Sensor Networks. IEEE Trans. Wirel. Commun. 11(1): 108-116 (2012) - 2011
- [j2]Shipra Agrawal, Erick Delage, Mark Peters, Zizhuo Wang, Yinyu Ye:
A Unified Framework for Dynamic Prediction Market Design. Oper. Res. 59(3): 550-568 (2011) - [i5]Zizhuo Wang, Shiming Deng, Yinyu Ye:
Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems. CoRR abs/1101.4681 (2011) - [i4]Xiaojun Chen, Dongdong Ge, Zizhuo Wang, Yinyu Ye:
Complexity of Unconstrained L_2-L_p Minimization. CoRR abs/1105.0638 (2011) - 2010
- [i3]Hongyang Chen, Kenneth Wing-Kin Lui, Zizhuo Wang, Hing-Cheung So, H. Vincent Poor:
Non-line-of-sight Node Localization based on Semi-Definite Programming in Wireless Sensor Networks. CoRR abs/1001.0080 (2010)
2000 – 2009
- 2009
- [c3]Shipra Agrawal, Erick Delage, Mark Peters, Zizhuo Wang, Yinyu Ye:
A unified framework for dynamic pari-mutuel information market design. EC 2009: 255-264 - [i2]Shipra Agrawal, Zizhuo Wang, Yinyu Ye:
A Dynamic Near-Optimal Algorithm for Online Linear Programming. CoRR abs/0911.2974 (2009) - 2008
- [j1]Zizhuo Wang, Song Zheng, Yinyu Ye, Stephen P. Boyd:
Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization. SIAM J. Optim. 19(2): 655-673 (2008) - [c2]Zizhuo Wang, Yichuan Ding:
Real-time tracking for sensor networks via sdp and gradient method. MELT 2008: 109-112 - [c1]Shipra Agrawal, Zizhuo Wang, Yinyu Ye:
Parimutuel Betting on Permutations. WINE 2008: 126-137 - [i1]Shipra Agrawal, Zizhuo Wang, Yinyu Ye:
Parimutuel Betting on Permutations. CoRR abs/0804.2288 (2008)
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 2025-01-20 23:01 CET 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:
