Xu Zhou

Zhou Xu

Information about the author Zhou Xu will soon be added to the site.
Found 12 papers in total
Joint Planning of Fleet Deployment, Speed Optimization, and Cargo Allocation for Liner Shipping
2015
In this paper, we study a comprehensive model that addresses fleet deployment, speed...
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation
2016
For a cost‐sharing cooperative game with an empty core, we study the problem of...
Exact and approximation algorithms for the min–max k‐traveling salesmen problem on a tree
2013
Given k identical salesmen, where k ⩾2 is a constant independent of the input size,...
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
2012
The symmetric quadratic knapsack problem (SQKP), which has several applications in...
The freight allocation problem with lane cost balancing constraint
2012
We consider a problem faced by a buying office for one of the largest retail...
Ship routing problem with berthing time clash avoidance constraints
2011
We consider a ship routing problem in which multiple vessels have to perform pickups...
Evaluating OR/MS Journals via PageRank
2011
Scholars, practitioners, and students in operations research and management science...
An analysis of the extended Christofides heuristic for the k‐depot TSP
2011
We study an extension of the classical traveling salesman problem (TSP) to a situation...
An m-parallel crane scheduling problem with a non-crossing constraint
2007
In this paper, we study a m -parallel machine scheduling problem with a non-crossing...
A transportation problem with minimum quantity commitment
2006
We study a transportation problem with the minimum quantity commitment (MQC), which is...
Transshipment through crossdocks with inventory and time windows
2005
A major challenge in making supply meet demand is to coordinate transshipments across...
The bottleneck problem with minimum quantity commitments
2006
Given an edge-distance graph of a set of suppliers and clients, the bottleneck problem...
Papers per page: