An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem. - Zhixing Luo; Brenda Cheang; Andrew Lim 001; Wenbin Zhu (Eur. J. Oper. Res., 2013)

Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost. - Zhixing Luo; Hu Qin; Wenbin Zhu; Andrew Lim 001 (CoRR, 2014)

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. - Zhixing Luo; Hu Qin; Andrew Lim 001 (Eur. J. Oper. Res., 2014)

An Efficient Forest-Based Tabu Search Algorithm for the Split-delivery Vehicle Routing Problem. - Zizhen Zhang; Huang He; Zhixing Luo; Hu Qin; Songshan Guo (AAAI, 2015)

On service consistency in multi-period vehicle routing. - Zhixing Luo; Hu Qin; Chan Hou Che; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

Two exact algorithms for the traveling umpire problem. - Li Xue; Zhixing Luo; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

A fast implementation for the 2D/3D box placement problem. - Wenbin Zhu; Zhixing Luo; Andrew Lim 001; Wee-Chong Oon (Comput. Optim. Appl., 2016)

Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost. - Zhixing Luo; Hu Qin; Wenbin Zhu; Andrew Lim 001 (Transp. Sci., 2017)

A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. - Tian Liu; Zhixing Luo; Hu Qin; Andrew Lim 001 (Eur. J. Oper. Res., 2018)

A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation. - Zhixing Luo; Mengyang Liu; Andrew Lim 001 (Transp. Sci., 2019)

Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction. - Zhenzhen Zhang; Zhixing Luo; Hu Qin; Andrew Lim 001 (Transp. Sci., 2019)

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. - Lijun Wei; Zhixing Luo; Roberto Baldacci; Andrew Lim 001 (INFORMS J. Comput., 2020)

Learning to Pack: A Data-Driven Tree Search Algorithm for Large-Scale 3D Bin Packing Problem. - Qianwen Zhu; Xihan Li 001; Zihan Zhang; Zhixing Luo; Xialiang Tong; Mingxuan Yuan; Jia Zeng (CIKM, 2021)

Multiperiod Dispatching and Routing for On-Time Delivery in a Dynamic and Stochastic Environment. - Sheng Liu 006; Zhixing Luo (CoRR, 2021)

The Electric Vehicle Routing Problem with Nonlinear Charging Functions. - Yijing Liang; Said Dabia; Zhixing Luo (CoRR, 2021)

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. - Zhixing Luo; Hu Qin; T. C. E. Cheng; Qinghua Wu 002; Andrew Lim 001 (INFORMS J. Comput., 2021)

An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting. - Chongshou Li; Brenda Cheang; Zhixing Luo; Andrew Lim 001 (ACM Trans. Knowl. Discov. Data, 2021)

A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy. - Zhenzhen Zhang; Zhixing Luo; Roberto Baldacci; Andrew Lim 001 (Transp. Sci., 2021)

A hybrid adaptive large neighborhood search and tabu search algorithm for the electric vehicle relocation problem. - Lei Cai; Xin Wang; Zhixing Luo; Yijing Liang (Comput. Ind. Eng., 2022)

Physical internet enabled two-tier city logistics solution in the new retail era. - Hao Luo 008; Yilun Wang; Zhixing Luo (Ind. Manag. Data Syst., 2022)

A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries. - Jiliu Li; Zhixing Luo; Roberto Baldacci; Hu Qin; Zhou Xu 001 (INFORMS J. Comput., 2023)

On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand. - Sheng Liu 006; Zhixing Luo (Manuf. Serv. Oper. Manag., 2023)

Integrated optimisation of loading schedules and delivery routes. - Yijing Liang; Xin Wang; Zhixing Luo; Dezhi Zhang (Int. J. Prod. Res., 2023)

Data-driven robust flexible personnel scheduling. - Zilu Wang; Zhixing Luo; Huaxiao Shen (Comput. Oper. Res., 2025)