default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDZhixing Luo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j19]Zilu Wang
, Zhixing Luo, Huaxiao Shen:
Data-driven robust flexible personnel scheduling. Comput. Oper. Res. 176: 106935 (2025)- 2023
- [j18]Yijing Liang, Xin Wang, Zhixing Luo, Dezhi Zhang:
Integrated optimisation of loading schedules and delivery routes. Int. J. Prod. Res. 61(16): 5354-5371 (2023) - [j17]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) - [j16]Sheng Liu, Zhixing Luo:
On-Demand Delivery from Stores: Dynamic Dispatching and Routing with Random Demand. Manuf. Serv. Oper. Manag. 25(2): 595-612 (2023) - 2022
- [j15]Lei Cai, Xin Wang, Zhixing Luo, Yijing Liang:
A hybrid adaptive large neighborhood search and tabu search algorithm for the electric vehicle relocation problem. Comput. Ind. Eng. 167: 108005 (2022) - [j14]Hao Luo, Yilun Wang, Zhixing Luo:
Physical internet enabled two-tier city logistics solution in the new retail era. Ind. Manag. Data Syst. 122(6): 1453-1479 (2022) - 2021
- [j13]Zhixing Luo, Hu Qin, T. C. E. Cheng, Qinghua Wu, Andrew Lim:
A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. INFORMS J. Comput. 33(2): 452-476 (2021) - [j12]Chongshou Li, Brenda Cheang, Zhixing Luo, Andrew Lim:
An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting. ACM Trans. Knowl. Discov. Data 15(2): 19:1-19:32 (2021) - [j11]Zhenzhen Zhang, Zhixing Luo, Roberto Baldacci, Andrew Lim:
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy. Transp. Sci. 55(1): 160-178 (2021) - [c2]Qianwen Zhu, Xihan Li, Zihan Zhang, Zhixing Luo, Xialiang Tong, Mingxuan Yuan, Jia Zeng:
Learning to Pack: A Data-Driven Tree Search Algorithm for Large-Scale 3D Bin Packing Problem. CIKM 2021: 4393-4402 - [i4]Sheng Liu, Zhixing Luo:
Multiperiod Dispatching and Routing for On-Time Delivery in a Dynamic and Stochastic Environment. CoRR abs/2107.13058 (2021) - [i3]Yijing Liang, Said Dabia, Zhixing Luo:
The Electric Vehicle Routing Problem with Nonlinear Charging Functions. CoRR abs/2108.01273 (2021) - 2020
- [j10]Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim:
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. INFORMS J. Comput. 32(2): 428-443 (2020) - [i2]Chongshou Li, Brenda Cheang, Zhixing Luo, Andrew Lim:
An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting. CoRR abs/2009.10619 (2020)
2010 – 2019
- 2019
- [j9]Zhixing Luo, Mengyang Liu, Andrew Lim:
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation. Transp. Sci. 53(1): 113-130 (2019) - [j8]Zhenzhen Zhang, Zhixing Luo, Hu Qin, Andrew Lim:
Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction. Transp. Sci. 53(2): 427-441 (2019) - 2018
- [j7]Tian Liu, Zhixing Luo, Hu Qin, Andrew Lim:
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. Eur. J. Oper. Res. 266(2): 487-497 (2018) - 2017
- [j6]Zhixing Luo, Hu Qin, Wenbin Zhu, Andrew Lim:
Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost. Transp. Sci. 51(2): 668-687 (2017) - 2016
- [j5]Wenbin Zhu, Zhixing Luo, Andrew Lim, Wee-Chong Oon:
A fast implementation for the 2D/3D box placement problem. Comput. Optim. Appl. 63(2): 585-612 (2016) - 2015
- [j4]Zhixing Luo, Hu Qin, Chan Hou Che, Andrew Lim:
On service consistency in multi-period vehicle routing. Eur. J. Oper. Res. 243(3): 731-744 (2015) - [j3]Li Xue, Zhixing Luo, Andrew Lim:
Two exact algorithms for the traveling umpire problem. Eur. J. Oper. Res. 243(3): 932-943 (2015) - [c1]Zizhen Zhang, Huang He, Zhixing Luo, Hu Qin, Songshan Guo:
An Efficient Forest-Based Tabu Search Algorithm for the Split-delivery Vehicle Routing Problem. AAAI 2015: 3432-3438 - 2014
- [j2]Zhixing Luo, Hu Qin, Andrew Lim:
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur. J. Oper. Res. 234(1): 49-60 (2014) - [i1]Zhixing Luo, Hu Qin, Wenbin Zhu, Andrew Lim:
Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost. CoRR abs/1401.6483 (2014) - 2013
- [j1]Zhixing Luo, Brenda Cheang, Andrew Lim, Wenbin Zhu:
An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem. Eur. J. Oper. Res. 229(3): 673-682 (2013)
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 2025-01-27 00:46 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:
