Background and Research

Education

• 2013.7-2017.7

  Ph.D., Operations Research. Department of Mathematical Sciences, Tsinghua University, Beijing, China (Supervisor: Zhenbo Wang)

• 2011.8-2013.7

  M.Sc., Operations Research. Department of Mathematical Sciences, Tsinghua University, Beijing, China (Supervisor: Zhenbo Wang)

• 2007.8-2011.7

  B.Sc., Information and Computing Sciences. School of Mathematical Sciences, Fudan University, Shanghai, China

• 1995.9-2007.7

  Kwong Tai middle school, Macau SAR, China

Work Experience

• 2024.5 - Now​

  Associate Professor, College of Management, Shenzhen University, Shenzhen, China

• 2020.8 - 2024.4​

  Assistant Professor, School of Mathematical Sciences, Xiamen University, Xiamen, China

• 2017.7 - 2020.7​

  Associate Research Fellow, School of Mathematics (Zhuhai), Sun Yat-sen University, Zhuhai, China

Visiting Experience

• 2021.7-9, 2019.11-12

  Faculty of Business Administration. University of Macau, Macau, China

• 2023.7-8, 2019.9-11

  Institute for Data and Decision Analytics. The Chinese University of Hong Kong (Shenzhen), Shenzhen, China

• 2019.7-8

  Department of Systems Engineering and Engineering Management. The Chinese University of Hong Kong, Hong Kong, China

• 2019.3-5, 2016.1-7

  Department of Industrial and Systems Engineering. University of Minnesota, MN, USA

• 2013.2-3

  Department of Decision Sciences and Information Management. KU Leuven, Leuven, Belgium

Research Interests

• Algorithm design and analysis for operations research/operations management problems with practical applications.
  • Business analytics and revenue management:
    • Assortment optimization, pricing optimization under discrete choice models.
    • Addressing challenges in realistic settings, including competitive, cooperative, robust, or data-driven environments.
  • Combinatorial optimization:
    • scheduling, knapsack, routing, particularly for problems with linear constraints.
  • Approximation algorithms and computational complexity.

Overall, my research pursuits aim to bridge the gap between theory and real-world applications, enabling practical solutions and advancements in the fields of operations research and operations management.

Projects

• 若干线性约束下的车间排序问题的算法研究，福建省自然科学基金青创项目， 2021-2024，Principal Investigator
• 线性或非线性约束下一些排序问题的复杂性和算法 (Complexity and algorithms of several scheduling problems under linear or nonlinear constraints), National Science Foundation for Young Scientists of China (No. 11801589), 2019-2021, Principal Investigator
• 线性约束下的组合优化问题研究 (Combinatorial optimization problems under linear constraints), NSFC, 2018-2022, Participator
• 凸二次约束二次规划问题的鲁棒灵敏度分析研究, NSFC, 2018-2022, Participator
• 组合优化问题的组合：问题、算法和复杂性(Combination of combinatorial optimization problems: Problems, algorithms and complexity), NSFC, 2014-2017, Participator
• Complexity results and exact algorithms for scheduling conflicting jobs on alternative resources, Bilateral Scientific Cooperation between Tsinghua University - K.U. Leuven, 2011-2013, Participator

Selected Awards

• 2021: 1st-prize, the 16th Young Teachers’ Teaching Skills Competition of Xiamen University
• 2016: 2nd-prize, Beijing ORSC Youth Outstanding Paper
• 2016: National Scholarship for Graduate Students (Best 5 out of the PhD candidates in the department),
• 2013-16: Postgraduate Scholarship, Macau SAR Government
• 2004, 06, 07: 2nd-prize, Macau Mathematical Olympiad
• 2001, 04, 07: Lotus Award, DSEJ, Government of Macau (1st in the graduating class)

Professional Services

Invited referees

• OR Spectrum
• Optimization Letter
• Algorithmica
• Theoretical Computer Science
• INFORMS Conference on Service Science (ICSS 2022)
• Journal of Computer and System Sciences
• Concurrency and Computation: Practice and Experience
• Computers and Operations Research
• Manufacturing & Service Operations Management (MSOM)
• INFORMS Journal on Optimization
• Journal of Combinatorial Optimization
• Journal of Global Optimization
• Journal of the Operations Research Society of China

Conference programme committee member

• The 20th Conference on Web and Internet Economics (WINE) 2024
• IJTCS-FAW 2024
• The 15th Annual International Conference on Combinatorial Optimization and Applications (COCOA 2021)
• The Annual Conference on Machine Learning and Optimization (MLO 2021, 2022, 2023)

Research Talks

• 2024.04: Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing.
  • Duopoly Assortment Competition under the Multinomial Logit Model: Simultaneous vs. Sequential
• 2023.10: Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing.
  • The Focal Multinomial Logit Model: Threshold Effects on Consumer Choice, Assortment, Pricing and Estimation
• 2022.07: The 1st ORSC Scheduling Youth Forum (Invited talk), Qingdao (Online).
  • Assortment and Pricing Optimization on the Focal Multinomial Logit Model
• 2022.07: The 6th ORSC Youth Forum (Invited talk), Tianjin (Online).
  • Competitive and Cooperative Assortment Games under Markov Chain Choice Model
• 2022.06: 2022 POMS International Conference in China}, Xi’an (Online).
  • Assortment and Pricing Optimization on the Focal Multinomial Logit Model
• 2021.11: MOS 2021, Operations Research Society of China, Qingdao.
  • Assortment Optimization and Games under Various Customer Choice Models
• 2021.04: Beijing University of Technology, College of Applied Sciences, Beijing.
  • Competitive and Cooperative Assortment Games under Markov Chain Choice Model
• 2021.04: MLO’2021, Tianjin.
  • A new combinatorial algorithm for separable convex resource allocation with nested bound constraints
• 2020.12: Beijing University of Technology, College of Applied Sciences, Beijing.
  • Assortment Optimization under Various Consumer Choice models & A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
• 2019.12: 13th International conference, COCOA 2020, Xiamen.
  • Some graph optimization problems with weights satisfying linear constraints & Two-machine flow shop scheduling problem under linear constraints
• 2019.11: Chinese Academy of Sciences, Shenzhen Institutes of Advanced Technology, Shenzhen.
  • Assortment Optimization under Several Consumer Choice Models
• 2019.10: Mathematical Challenges in Scheduling Theory Workshop, Sanya.
  • Two-machine Flow Shop Scheduling Problem under Linear Constraints
• 2019.06: 2019 POMS International Conference in China, Tianjin.
  • Assortment Optimization under a Single Transition Model
• 2019.03: Chinese Academy of Sciences, Academy of Mathematics and Systems Science, Beijing.
  • Assortment Optimization under Several Consumer Choice Models
• 2019.01: The Tenth POMS-HK International Conference, Hong Kong.
  • Assortment Optimization under a Single Transition Model
• 2018.07: 24th International conference, COCOON 2018, Qingdao.
  • Approximation Algorithms for a Two-phase Knapsack Problem
• 2018.06: Beijing University of Technology, Beijing Institute for Scientific and Engineering Computing, Beijing.
  • Approximation Algorithms for a Two-phase Knapsack Problem
• 2018.06: The Chinese University of Hong Kong, Department of Mathematics, Hong Kong.
  • Knapscak Problem: Connection to Computational Complexity and Some Recent Generalizations
• 2016.11: Beijing ORSC 2016 annual meeting, Beijing.
  • Scheduling under linear constraints (2nd-prize, Beijing ORSC youth outstanding paper)
• 2015.08: 21th International conference, COCOON 2015, Beijing.
  • Combinations of some shop scheduling problems and the shortest path problem
• 2014.07: Scheduling working group annual meeting, Rizhao.
  • The Combinations of Shop Scheduling and the Shortest Path Problem
• 2014.01: The East Asian core doctorial forum on Mathematics, Kyoto, Japan.
  • The Combinations of Shop Scheduling and the Shortest Path Problem
• 2013.06: 19th International conference, COCOON 2013, Hangzhou.
  • Combination of Two-machine Flow Shop Scheduling and Shortest Path Problems