Zhou Xu

Orcid: 0000-0003-1528-116X

Affiliations:
  • Hong Kong Polytechnic University, Logistics and Maritime Studies, Hong Kong


According to our database1, Zhou Xu authored at least 55 papers between 2003 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm.
Transp. Sci., 2024

Shipment Consolidation with Multiple Shipping Methods Under Nonlinear Cost Structures.
Manag. Sci., 2024

Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach.
INFORMS J. Comput., 2024

New exact and heuristic algorithms for general production and delivery integration.
Eur. J. Oper. Res., 2024

2023
Stable Matching for Crowdsourcing Last-Mile Delivery.
IEEE Trans. Intell. Transp. Syst., August, 2023

A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries.
INFORMS J. Comput., 2023

An Approximation Algorithm for <i>k</i>-Depot Split Delivery Vehicle Routing Problem.
INFORMS J. Comput., 2023

New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance.
Eur. J. Oper. Res., 2023

2022
A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension.
Comput. Oper. Res., 2022

Exact algorithms for the multiple depot vehicle scheduling problem with heterogeneous vehicles, split loads and toll-by-weight scheme.
Comput. Ind. Eng., 2022

2021
Integrated production and transportation scheduling with order-dependent inventory holding costs.
Comput. Oper. Res., 2021

2020
Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs.
INFORMS J. Comput., 2020

A new convergent hybrid learning algorithm for two-stage stochastic programs.
Eur. J. Oper. Res., 2020

2019
Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port.
Transp. Sci., 2019

2018
New Lower Bound and Exact Method for the Continuous Berth Allocation Problem.
Oper. Res., 2018

Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation.
Oper. Res., 2018

2017
An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem.
Eur. J. Oper. Res., 2017

2016
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation.
INFORMS J. Comput., 2016

Improved algorithms for joint optimization of facility locations and network connections.
Eur. J. Oper. Res., 2016

2015
Joint Planning of Fleet Deployment, Speed Optimization, and Cargo Allocation for Liner Shipping.
Transp. Sci., 2015

A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots.
INFORMS J. Comput., 2015

2014
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree.
Networks, 2014

2013
Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173].
Oper. Res. Lett., 2013

Metaheuristics for robust graph coloring.
J. Heuristics, 2013

Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree.
Eur. J. Oper. Res., 2013

2012
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem.
Eur. J. Oper. Res., 2012

The freight allocation problem with lane cost balancing constraint.
Eur. J. Oper. Res., 2012

Approximation results for a min-max location-routing problem.
Discret. Appl. Math., 2012

2011
An analysis of the extended Christofides heuristic for the k-depot TSP.
Oper. Res. Lett., 2011

Evaluating OR/MS Journals via PageRank.
Interfaces, 2011

A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

2010
Approximation hardness of min-max tree covers.
Oper. Res. Lett., 2010

A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem.
Proceedings of the Algorithm Theory, 2010

Balanced Student Partitioning to Promote Effective Learning: Applications in an International School.
Proceedings of the Knowledge Management and Acquisition for Smart Systems and Services, 2010

Approximation Algorithms for Min-Max Capacitated Path Covers.
Proceedings of the Theory of Computing 2010, 2010

2009
Searching optimal resequencing and feature assignment on an automated assembly line.
J. Oper. Res. Soc., 2009

Distinguishing citation quality for journal impact assessment.
Commun. ACM, 2009

Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time.
Proceedings of the Algorithms and Computation, 20th International Symposium, 2009

2008
The bidding selection and assignment problem with minimum quantity commitment.
J. Oper. Res. Soc., 2008

Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees.
Oper. Res., 2008

Random Move Tabu Search for Freight Proportion Allocation Problem.
Proceedings of the 20th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2008), 2008

2007
Journal-Ranking.com: An Online Interactive Journal Ranking System.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
A Transportation Problem with Minimum Quantity Commitment.
Transp. Sci., 2006

The one-commodity pickup and delivery travelling salesman problem on a path or a tree.
Networks, 2006

A critical-shaking neighborhood search for the yard allocation problem.
Eur. J. Oper. Res., 2006

TPBOSCourier: A Transportation Procurement System (for the Procurement of Courier Services).
Proceedings of the Proceedings, 2006

2005
k-Center problems with minimum coverage.
Theor. Comput. Sci., 2005

The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

2004
The Bottleneck Problem with Minimum Quantity Commitments.
Proceedings of the Algorithm Theory, 2004

Approximation Schemes for the Crane Scheduling Problem.
Proceedings of the Algorithm Theory, 2004

A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem.
Proceedings of the 16th Eureopean Conference on Artificial Intelligence, 2004

Solving the Crane Scheduling Problem Using Intelligent Search Schemes.
Proceedings of the Principles and Practice of Constraint Programming, 2004

On the Selection and Assignment with Minimum Quantity Commitments.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

Transshipment Through Crossdocks with Inventory and Time Windows.
Proceedings of the Computing and Combinatorics, 10th Annual International Conference, 2004

2003
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem.
Proceedings of the Genetic and Evolutionary Computation, 2003


  Loading...