default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhou Xu 0001
Person information
- affiliation: Hong Kong Polytechnic University, Logistics and Maritime Studies, Hong Kong
Other persons with the same name
- Zhou Xu — disambiguation page
- Zhou Xu 0002
![[0000-0003-4599-4419]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0003-4599-4419")
— National University of Defense Technology, College of Electronic Countermeasure, Hefei, China - Zhou Xu 0003 — Chongqing University, School of Big Data and Software Engineering, China (and 2 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j39]Xianyan Yang, Feng Li, Zhixue Liu, Zhou Xu:
New exact and heuristic algorithms for general production and delivery integration. Eur. J. Oper. Res. 316(2): 419-442 (2024)- [j38]Lindong Liu, Xiangtong Qi, Zhou Xu:
Stabilizing Grand Cooperation via Cost Adjustment: An Inverse Optimization Approach. INFORMS J. Comput. 36(2): 635-656 (2024) - [j37]Zhou Xu, Feng Li, Zhi-Long Chen:
Shipment Consolidation with Multiple Shipping Methods Under Nonlinear Cost Structures. Manag. Sci. 70(5): 2823-2841 (2024) - [j36]Shengnan Shu, Zhou Xu, Roberto Baldacci:
Incorporating Holding Costs in Continuous-Time Service Network Design: New Model, Relaxation, and Exact Algorithm. Transp. Sci. 58(2): 412-433 (2024) - 2023
- [j35]Feng Li, Shifu Xu, Zhou Xu:
New exact and approximation algorithms for integrated production and transportation scheduling with committed delivery due dates and order acceptance. Eur. J. Oper. Res. 306(1): 127-140 (2023) - [j34]Jiliu Li, Zhixing Luo, Roberto Baldacci, Hu Qin, Zhou Xu:
A New Exact Algorithm for Single-Commodity Vehicle Routing with Split Pickups and Deliveries. INFORMS J. Comput. 35(1): 31-49 (2023) - [j33]Xiaofan Lai, Liang Xu, Zhou Xu, Yang Du:
An Approximation Algorithm for k-Depot Split Delivery Vehicle Routing Problem. INFORMS J. Comput. 35(5): 1179-1194 (2023) - [j32]Nian Zhang, Zhixue Liu, Feng Li, Zhou Xu, Zhihao Chen:
Stable Matching for Crowdsourcing Last-Mile Delivery. IEEE Trans. Intell. Transp. Syst. 24(8): 8174-8187 (2023) - 2022
- [j31]Jiliu Li, Hu Qin, Huaxiao Shen, Xialiang Tong, Zhou Xu:
Exact algorithms for the multiple depot vehicle scheduling problem with heterogeneous vehicles, split loads and toll-by-weight scheme. Comput. Ind. Eng. 168: 108137 (2022) - [j30]Tiantian Wang, Hong Ma, Zhou Xu, Jun Xia:
A new dynamic shape adjustment and placement algorithm for 3D yard allocation problem with time dimension. Comput. Oper. Res. 138: 105585 (2022) - 2021
- [j29]Xianyan Yang, Zhixue Liu, Feng Li, Zhou Xu:
Integrated production and transportation scheduling with order-dependent inventory holding costs. Comput. Oper. Res. 136: 105477 (2021) - 2020
- [j28]Shaorui Zhou, Hui Zhang, Ning Shi, Zhou Xu, Fan Wang:
A new convergent hybrid learning algorithm for two-stage stochastic programs. Eur. J. Oper. Res. 283(1): 33-46 (2020) - [j27]Feng Li, Zhou Xu, Zhi-Long Chen:
Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs. INFORMS J. Comput. 32(4): 1012-1029 (2020)
2010 – 2019
- 2019
- [j26]Shuai Jia, Chung-Lun Li, Zhou Xu:
Managing Navigation Channel Traffic and Anchorage Area Utilization of a Container Port. Transp. Sci. 53(3): 728-745 (2019) - 2018
- [j25]Zhou Xu, Chung-Yee Lee:
New Lower Bound and Exact Method for the Continuous Berth Allocation Problem. Oper. Res. 66(3): 778-798 (2018) - [j24]Lindong Liu, Xiangtong Qi, Zhou Xu:
Simultaneous Penalization and Subsidization for Stabilizing Grand Cooperation. Oper. Res. 66(5): 1362-1375 (2018) - 2017
- [j23]Zhou Xu, Brian Rodrigues:
An extension of the Christofides heuristic for the generalized multiple depot multiple traveling salesmen problem. Eur. J. Oper. Res. 257(3): 735-745 (2017) - 2016
- [j22]Xiaofan Lai, Zhou Xu:
Improved algorithms for joint optimization of facility locations and network connections. Eur. J. Oper. Res. 250(3): 745-753 (2016) - [j21]Lindong Liu, Xiangtong Qi, Zhou Xu:
Computing Near-Optimal Stable Cost Allocations for Cooperative Games by Lagrangian Relaxation. INFORMS J. Comput. 28(4): 687-702 (2016) - 2015
- [j20]Zhou Xu, Brian Rodrigues:
A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots. INFORMS J. Comput. 27(4): 636-645 (2015) - [j19]Jun Xia, Kevin X. Li, Hong Ma, Zhou Xu:
Joint Planning of Fleet Deployment, Speed Optimization, and Cargo Allocation for Liner Shipping. Transp. Sci. 49(4): 922-938 (2015) - 2014
- [j18]Zhou Xu, Xiaofan Lai, Andrew Lim, Fan Wang:
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. Networks 63(2): 179-195 (2014) - 2013
- [j17]Liang Xu, Zhou Xu, Dongsheng Xu:
Exact and approximation algorithms for the min-max k-traveling salesmen problem on a tree. Eur. J. Oper. Res. 227(2): 284-292 (2013) - [j16]Fan Wang, Zhou Xu:
Metaheuristics for robust graph coloring. J. Heuristics 19(4): 529-548 (2013) - [j15]Zhou Xu, Qi Wen:
Corrigendum to "Approximation hardness of min-max tree covers" [Oper. Res. Lett. 38 (3) (2010) 169-173]. Oper. Res. Lett. 41(5): 563 (2013) - 2012
- [j14]Zhou Xu, Dongsheng Xu, Wenbin Zhu:
Approximation results for a min-max location-routing problem. Discret. Appl. Math. 160(3): 306-320 (2012) - [j13]Andrew Lim, Hu Qin, Zhou Xu:
The freight allocation problem with lane cost balancing constraint. Eur. J. Oper. Res. 217(1): 26-35 (2012) - [j12]Zhou Xu:
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem. Eur. J. Oper. Res. 218(2): 377-381 (2012) - 2011
- [j11]Zhou Xu, Brenda Cheang, Andrew Lim, Qi Wen:
Evaluating OR/MS Journals via PageRank. Interfaces 41(4): 375-388 (2011) - [j10]Zhou Xu, Liang Xu, Brian Rodrigues:
An analysis of the extended Christofides heuristic for the k-depot TSP. Oper. Res. Lett. 39(3): 218-223 (2011) - [c18]Zhou Xu, Xiaofan Lai:
A Fully Polynomial Approximation Scheme for a Knapsack Problem with a Minimum Filling Constraint. WADS 2011: 704-715 - 2010
- [j9]Zhou Xu, Qi Wen:
Approximation hardness of min-max tree covers. Oper. Res. Lett. 38(3): 169-173 (2010) - [c17]Zhou Xu, Liang Xu:
Approximation Algorithms for Min-Max Capacitated Path Covers. CATS 2010: 11-18 - [c16]Wenbin Zhu, Hu Qin, Andrew Lim, Zhou Xu:
Balanced Student Partitioning to Promote Effective Learning: Applications in an International School. PKAW 2010: 38-48 - [c15]Zhou Xu, Brian Rodrigues:
A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem. SWAT 2010: 127-138
2000 – 2009
- 2009
- [j8]Andrew Lim, Hong Ma, Qi Wen, Zhou Xu, Brenda Cheang:
Distinguishing citation quality for journal impact assessment. Commun. ACM 52(8): 111-116 (2009) - [j7]Andrew Lim, Zhou Xu:
Searching optimal resequencing and feature assignment on an automated assembly line. J. Oper. Res. Soc. 60(3): 361-371 (2009) - [c14]Zhou Xu, Liang Xu:
Approximation Algorithms for Min-Max Path Cover Problems with Service Handling Time. ISAAC 2009: 383-392 - 2008
- [j6]Andrew Lim, Brian Rodrigues, Zhou Xu:
Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees. Oper. Res. 56(3): 758-771 (2008) - [j5]Andrew Lim, Zhou Xu, Fan Wang:
The bidding selection and assignment problem with minimum quantity commitment. J. Oper. Res. Soc. 59(5): 693-702 (2008) - [c13]Andrew Lim, Hu Qin, Jing Xu, Zhou Xu:
Random Move Tabu Search for Freight Proportion Allocation Problem. ICTAI (2) 2008: 307-314 - 2007
- [c12]Andrew Lim, Hong Ma, Qi Wen, Zhou Xu, Brenda Cheang, Bernard C. Y. Tan, Wenbin Zhu:
Journal-Ranking.com: An Online Interactive Journal Ranking System. AAAI 2007: 1723-1729 - 2006
- [j4]Andrew Lim, Zhou Xu:
A critical-shaking neighborhood search for the yard allocation problem. Eur. J. Oper. Res. 174(2): 1247-1259 (2006) - [j3]Fan Wang, Andrew Lim, Zhou Xu:
The one-commodity pickup and delivery travelling salesman problem on a path or a tree. Networks 48(1): 24-35 (2006) - [j2]Andrew Lim, Fan Wang, Zhou Xu:
A Transportation Problem with Minimum Quantity Commitment. Transp. Sci. 40(1): 117-129 (2006) - [c11]Andrew Lim, Zhou Xu, Brenda Cheang, Wee-Kit Ho, Steve Au-yeung:
TPBOSCourier: A Transportation Procurement System (for the Procurement of Courier Services). AAAI 2006: 1712-1719 - 2005
- [j1]Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center problems with minimum coverage. Theor. Comput. Sci. 332(1-3): 1-17 (2005) - [c10]Andrew Lim, Zhou Xu:
Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line. ICTAI 2005: 491-498 - [c9]Andrew Lim, Fan Wang, Zhou Xu:
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. ISAAC 2005: 1061-1070 - 2004
- [c8]Andrew Lim, Fan Wang, Zhou Xu:
On the Selection and Assignment with Minimum Quantity Commitments. COCOON 2004: 102-111 - [c7]Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu:
Transshipment Through Crossdocks with Inventory and Time Windows. COCOON 2004: 122-131 - [c6]Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center Problems with Minimum Coverage. COCOON 2004: 349-359 - [c5]Andrew Lim, Brian Rodrigues, Zhou Xu:
Solving the Crane Scheduling Problem Using Intelligent Search Schemes. CP 2004: 747-751 - [c4]Andrew Lim, Zhou Xu:
A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem. ECAI 2004: 1049-1050 - [c3]Andrew Lim, Zhou Xu:
The Bottleneck Problem with Minimum Quantity Commitments. SWAT 2004: 285-297 - [c2]Andrew Lim, Brian Rodrigues, Zhou Xu:
Approximation Schemes for the Crane Scheduling Problem. SWAT 2004: 323-335 - 2003
- [c1]Andrew Lim, Zhou Xu:
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem. GECCO 2003: 1596-1597
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-11 22:26 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
