Yunlong Wang
Yunlong Wang
Embedded Files
About Me
About Me
Hi, I am Yunlong Wang (王云龙), a sixth-year PhD candidate at Shanghai Jiao Tong University (SJTU), Antai College of Economics and Management (ACEM), advised by Dr. Ying Rong and Dr. Taotao He. I am currently in a two-year visiting program (23 fall - 25 fall) at the University of Colorado Boulder (CU Boulder, Leeds School of Business), advised by Dr. Rui Zhang.
I am on the 2025-2026 academic job market.
My research lies at the intersection of discrete choice modeling, optimization, and revenue management, using mixed-integer programming approaches. I focus on the computational and algorithmic aspects of discrete choice models, as well as (social) network-based influence problems. I also have training in continuous optimization, particularly in advanced methods for algorithmic acceleration.
I have a couple of industry internship experiences at Tencent (AI Lab) and Huawei, where I worked on accelerating machine learning algorithms and optimizing scheduling strategies for 5G base station operations, respectively.
Research Papers
Research Papers
Under Review
Under Review
Assortment Optimization for Online Video Games, with Fan You, Thomas Vossen, Rui Zhang, Production and Operations Management, major revision (2025).
An Integer Programming Approach for Quick-Commerce Assortment Planning, with Yajing Chen, Taotao He, Ying Rong, Management Science, minor revision (2025). (arXiv) (Python Code)
Publications
Publications
Omnichannel Product Selection and Shelf Space Planning Optimization, with Yajing Chen, Zhimin Wu, Omega, 103074, 2024.
Proximal Gradient/Semismooth Newton Methods for Projection onto a Polyhedron via the Duality Gap Active Set Strategy, with Chungen Shen, Leihong Zhang, & Weihong Yang, Journal of Scientific Computing, 97(1): 3, 2023. (Code)
An Accelerated Active-Set Algorithm for a Quadratic Semi-definite Program with General Constraints, with Chungen Shen, Wenjuan Xue, & Leihong Zhang, Computational Optimization and Applications, 78(1): 1-42, 2021. (Code)
Limited Memory BFGS Algorithm for the Matrix Approximation Problem in Frobenius Norm, with Chungen Shen, Changxing Fan, & Wenjuan Xue, Computational and Applied Mathematics, 39: 1-25, 2020. (Code)
Working Papers
Working Papers
New Formulations and Valid Inequalities for the Least Cost Influence Problem on Social Networks, with Rui. Zhang, S. Raghu Raghavan.
Gap Safe Detection Rules of Active Set for Convex Programs and Application in an Augmented Lagrangian Algorithm, with Chungen. Shen.
Conference & Talks
Conference & Talks
Assortment Optimization for Online Video Games
2025 INFORMS Revenue Management and Pricing Section Conference, New York, July 2025.
2025 INFORMS International Meeting, Singapore, July 2025.
2025 Purdue Supply Chain and Operations Management Conference, Purdue, August 2025.
New Formulations and Valid Inequalities for the Least Cost Influence Problem on Social Networks.
2024 INFORMS Telecommunications and Network Analytics Conference, Online, May 2024.
2024 Purdue Operations Conference, Purdue University, August 2024.
2024 INFORMS Annual Meeting, Seattle, October 2024.
Integer Programming Approach for Quick-Commerce Assortment Planning.
Doctoral Forum of Economics and Management, ACEM, Shanghai Jiao Tong University, July 2023.
Proximal Gradient/Semismooth Newton Methods for Projection onto a Polyhedron via the Duality-Gap-Active-Set Strategy.
Mathematical Optimization Society - Operations Research Society of China (ORSC-MOS23), Chengdu, May 2023
An Accelerated Active-set Algorithm for Semidefinite Programs with General Constraints.
The 3rd Statistics and Operations Research Young Scholars Forum, Operations Research Association in Shanghai, December 2019.
Page updated
Google Sites
Report abuse