Zizhuo Wang

According to our database1, Zizhuo Wang authored at least 37 papers between 2008 and 2021.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Home service routing and appointment scheduling with stochastic service times.
Eur. J. Oper. Res., 2021

Information Disclosure and Pricing Policies for Sales of Network Goods.
Oper. Res., 2020

Probabilistic forecasting with temporal convolutional neural network.
Neurocomputing, 2020

Random Walk Bandits.
CoRR, 2020

The Value of Price Discrimination in Large Random Networks.
Proceedings of the 2019 ACM Conference on Economics and Computation, 2019

On substitutability and complementarity in discrete choice models.
Oper. Res. Lett., 2018

Optimal worst-case pricing for a logit demand model with network effects.
Oper. Res. Lett., 2018

Optimal pricing for selling to a static multi-period newsvendor.
Oper. Res. Lett., 2017

Consumer Choice Models with Endogenous Network Effects.
Manag. Sci., 2017

Knapsack with variable weights satisfying linear constraints.
J. Glob. Optim., 2017

Technical Note - On the Relation Between Several Discrete Choice Models.
Oper. Res., 2017

Assortment Optimization under a Single Transition Model.
CoRR, 2017

Strong NP-Hardness for Sparse Optimization with Concave Penalty Functions.
Proceedings of the 34th International Conference on Machine Learning, 2017

Hidden-City Ticketing: The Cause and Impact.
Transp. Sci., 2016

Pricing Personalized Bundles: A New Approach and An Empirical Study.
Manuf. Serv. Oper. Manag., 2016

Technical Note - Intertemporal Price Discrimination via Reference Price Effects.
Oper. Res., 2016

Optimal Pricing for a Multinomial Logit Choice Model with Network Effects.
Oper. Res., 2016

Scheduling under linear constraints.
Eur. J. Oper. Res., 2016

Likelihood robust optimization for data-driven problems.
Comput. Manag. Sci., 2016

On solving convex optimization problems with linear ascending constraints.
Optim. Lett., 2015

A dynamic learning algorithm for online matching problems with concave returns.
Eur. J. Oper. Res., 2015

Strong NP-Hardness Result for Regularized $L_q$-Minimization Problems with Concave Penalty Functions.
CoRR, 2015

Complexity of unconstrained $$L_2-L_p$$ minimization.
Math. Program., 2014

A Note on Appointment Scheduling with Piecewise Linear Cost Functions.
Math. Oper. Res., 2014

Close the Gaps: A Learning-While-Doing Algorithm for Single-Product Revenue Management Problems.
Oper. Res., 2014

A Dynamic Near-Optimal Algorithm for Online Linear Programming.
Oper. Res., 2014

An Improved Algorithm for Fixed-Hub Single Allocation Problem.
CoRR, 2014

A simple policy for multiple queues with size-independent service times.
Oper. Res. Lett., 2013

A Near-Optimal Dynamic Learning Algorithm for Online Matching Problems with Concave Returns.
CoRR, 2013

Non-Line-of-Sight Node Localization Based on Semi-Definite Programming in Wireless Sensor Networks.
IEEE Trans. Wirel. Commun., 2012

A Unified Framework for Dynamic Prediction Market Design.
Oper. Res., 2011

Close the Gaps: A Learning-while-Doing Algorithm for a Class of Single-Product Revenue Management Problems
CoRR, 2011

Non-line-of-sight Node Localization based on Semi-Definite Programming in Wireless Sensor Networks
CoRR, 2010

A unified framework for dynamic pari-mutuel information market design.
Proceedings of the Proceedings 10th ACM Conference on Electronic Commerce (EC-2009), 2009

Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization.
SIAM J. Optim., 2008

Parimutuel Betting on Permutations.
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

Real-time tracking for sensor networks via sdp and gradient method.
Proceedings of the ACM International Workshop on Mobile Entity Localization and Tracking in GPS-less Environments, 2008