A Fixed-Length Subset Genetic Algorithm for the p-Median Problem. - Andrew Lim 001; Zhou Xu 001 (GECCO, 2003)

Transshipment Through Crossdocks with Inventory and Time Windows. - Andrew Lim 001; Zhaowei Miao; Brian Rodrigues; Zhou Xu 001 (COCOON, 2004)

On the Selection and Assignment with Minimum Quantity Commitments. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (COCOON, 2004)

Solving the Crane Scheduling Problem Using Intelligent Search Schemes. - Andrew Lim 001; Brian Rodrigues; Zhou Xu 001 (CP, 2004)

A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem. - Andrew Lim 001; Zhou Xu 001 (ECAI, 2004)

Approximation Schemes for the Crane Scheduling Problem. - Andrew Lim 001; Brian Rodrigues; Zhou Xu 001 (SWAT, 2004)

The Bottleneck Problem with Minimum Quantity Commitments. - Andrew Lim 001; Zhou Xu 001 (SWAT, 2004)

The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (ISAAC, 2005)

k-Center problems with minimum coverage. - Andrew Lim 001; Brian Rodrigues; Fan Wang 003; Zhou Xu 001 (Theor. Comput. Sci., 2005)

TPBOSCourier: A Transportation Procurement System (for the Procurement of Courier Services). - Andrew Lim 001; Zhou Xu 001; Brenda Cheang; Wee-Kit Ho; Steve Au-yeung (AAAI, 2006)

A critical-shaking neighborhood search for the yard allocation problem. - Andrew Lim 001; Zhou Xu 001 (Eur. J. Oper. Res., 2006)

The one-commodity pickup and delivery travelling salesman problem on a path or a tree. - Fan Wang 003; Andrew Lim 001; Zhou Xu 001 (Networks, 2006)

A Transportation Problem with Minimum Quantity Commitment. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (Transp. Sci., 2006)

Journal-Ranking.com: An Online Interactive Journal Ranking System. - Andrew Lim 001; Hong Ma; Qi Wen 003; Zhou Xu 001; Brenda Cheang; Bernard C. Y. Tan; Wenbin Zhu (AAAI, 2007)

Random Move Tabu Search for Freight Proportion Allocation Problem. - Andrew Lim 001; Hu Qin; Jing Xu; Zhou Xu 001 (ICTAI (2), 2008)

Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees. - Andrew Lim 001; Brian Rodrigues; Zhou Xu 001 (Oper. Res., 2008)

The bidding selection and assignment problem with minimum quantity commitment. - Andrew Lim 001; Zhou Xu 001; Fan Wang 003 (J. Oper. Res. Soc., 2008)

Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time. - Zhou Xu 001; Liang Xu (ISAAC, 2009)

Distinguishing citation quality for journal impact assessment. - Andrew Lim 001; Hong Ma; Qi Wen 003; Zhou Xu 001; Brenda Cheang (Commun. ACM, 2009)

Searching optimal resequencing and feature assignment on an automated assembly line. - Andrew Lim 001; Zhou Xu 001 (J. Oper. Res. Soc., 2009)

Approximation Algorithms for Min-Max Capacitated Path Covers. - Zhou Xu 001; Liang Xu (CATS, 2010)

Balanced Student Partitioning to Promote Effective Learning: Applications in an International School. - Wenbin Zhu; Hu Qin; Andrew Lim 001; Zhou Xu 001 (PKAW, 2010)

A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem. - Zhou Xu 001; Brian Rodrigues (SWAT, 2010)

Approximation hardness of min-max tree covers. - Zhou Xu 001; Qi Wen 003 (Oper. Res. Lett., 2010)

A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. - Zhou Xu 001; Xiaofan Lai (WADS, 2011)

Evaluating OR/MS Journals via PageRank. - Zhou Xu 001; Brenda Cheang; Andrew Lim 001; Qi Wen 003 (Interfaces, 2011)

An analysis of the extended Christofides heuristic for the k-depot TSP. - Zhou Xu 001; Liang Xu; Brian Rodrigues (Oper. Res. Lett., 2011)

Approximation results for a min-max location-routing problem. - Zhou Xu 001; Dongsheng Xu; Wenbin Zhu (Discret. Appl. Math., 2012)

The freight allocation problem with lane cost balancing constraint. - Andrew Lim 001; Hu Qin; Zhou Xu 001 (Eur. J. Oper. Res., 2012)

A strongly polynomial FPTAS for the symmetric quadratic knapsack problem. - Zhou Xu 001 (Eur. J. Oper. Res., 2012)

Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree. - Liang Xu; Zhou Xu 001; Dongsheng Xu (Eur. J. Oper. Res., 2013)

Metaheuristics for robust graph coloring. - Fan Wang 003; Zhou Xu 001 (J. Heuristics, 2013)

Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173]. - Zhou Xu 001; Qi Wen 003 (Oper. Res. Lett., 2013)

An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. - Zhou Xu 001; Xiaofan Lai; Andrew Lim 001; Fan Wang 003 (Networks, 2014)

A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots. - Zhou Xu 001; Brian Rodrigues (INFORMS J. Comput., 2015)

Joint Planning of Fleet Deployment, Speed Optimization, and Cargo Allocation for Liner Shipping. - Jun Xia; Kevin X. Li; Hong Ma; Zhou Xu 001 (Transp. Sci., 2015)

Improved algorithms for joint optimization of facility locations and network connections. - Xiaofan Lai; Zhou Xu 001 (Eur. J. Oper. Res., 2016)

Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation. - Lindong Liu 001; Xiangtong Qi; Zhou Xu 001 (INFORMS J. Comput., 2016)

An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem. - Zhou Xu 001; Brian Rodrigues (Eur. J. Oper. Res., 2017)

Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation. - Lindong Liu 001; Xiangtong Qi; Zhou Xu 001 (Oper. Res., 2018)

New Lower Bound and Exact Method for the Continuous Berth Allocation Problem. - Zhou Xu 001; Chung-Yee Lee (Oper. Res., 2018)

Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port. - Shuai Jia; Chung-Lun Li; Zhou Xu 001 (Transp. Sci., 2019)

A new convergent hybrid learning algorithm for two-stage stochastic programs. - Shaorui Zhou; Hui Zhang; Ning Shi; Zhou Xu 001; Fan Wang 003 (Eur. J. Oper. Res., 2020)

Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs. - Feng Li 024; Zhou Xu 001; Zhi-Long Chen (INFORMS J. Comput., 2020)

Integrated production and transportation scheduling with order-dependent inventory holding costs. - Xianyan Yang; Zhixue Liu; Feng Li 024; Zhou Xu 001 (Comput. Oper. Res., 2021)

Exact algorithms for the multiple depot vehicle scheduling problem with heterogeneous vehicles, split loads and toll-by-weight scheme. - Jiliu Li; Hu Qin; Huaxiao Shen; Xialiang Tong; Zhou Xu 001 (Comput. Ind. Eng., 2022)

A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension. - Tiantian Wang 006; Hong Ma; Zhou Xu 001; Jun Xia (Comput. Oper. Res., 2022)

New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance. - Feng Li 024; Shifu Xu; Zhou Xu 001 (Eur. J. Oper. Res., 2023)

An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem. - Xiaofan Lai; Liang Xu; Zhou Xu 001; Yang Du (INFORMS J. Comput., 2023)

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)

Stable Matching for Crowdsourcing Last-Mile Delivery. - Nian Zhang; Zhixue Liu; Feng Li 024; Zhou Xu 001; Zhihao Chen (IEEE Trans. Intell. Transp. Syst., 2023)

New exact and heuristic algorithms for general production and delivery integration. - Xianyan Yang; Feng Li 024; Zhixue Liu; Zhou Xu 001 (Eur. J. Oper. Res., 2024)

Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach. - Lindong Liu 001; Xiangtong Qi; Zhou Xu 001 (INFORMS J. Comput., 2024)

Shipment Consolidation with Multiple Shipping Methods Under Nonlinear Cost Structures. - Zhou Xu 001; Feng Li 024; Zhi-Long Chen (Manag. Sci., 2024)

Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm. - Shengnan Shu; Zhou Xu 001; Roberto Baldacci (Transp. Sci., 2024)

A Simultaneous Column-and-Row Generation Solution Method for Liner Shipping Network Design. - Jun Xia; Zhou Xu 001; Roberto Baldacci (Oper. Res., 2025)

The Stack Loading Problem With Load-Bearing Limit. - Xinbo Zhang; Minming Li; Zhou Xu 001; Yingchao Zhao 001 (IEEE Trans Autom. Sci. Eng., 2025)