default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRaymond K. Cheung
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
[j16]Dongsheng Xu, Cai Wen Zhang, Zhaowei Miao, Raymond K. Cheung:
A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals. Comput. Oper. Res. 51: 1-10 (2014)- [j15]Haiqing Song, Raymond K. Cheung, Haiyan Wang:
An arc-exchange decomposition method for multistage dynamic networks with random arc capacities. Eur. J. Oper. Res. 233(3): 474-487 (2014) - [j14]Daniel Y. Mo
, Mitchell M. Tseng, Raymond K. Cheung:
Design of inventory pools in spare part support operation systems. Int. J. Syst. Sci. 45(6): 1296-1305 (2014) - 2011
- [j13]Ning Shi, Raymond K. Cheung, He Xu, Kin Keung Lai:
An adaptive routing strategy for freight transportation networks. J. Oper. Res. Soc. 62(4): 799-805 (2011)
2000 – 2009
- 2009
- [j12]Daniel Y. Mo, Raymond K. Cheung, Allen W. Lee, G. K. Law:
Flow Diversion Strategies for Routing in Integrated Automatic Shipment Handling Systems. IEEE Trans Autom. Sci. Eng. 6(2): 377-384 (2009) - 2008
- [j11]Haiqing Song, Vernon Ning Hsu, Raymond K. Cheung:
Distribution Coordination Between Suppliers and Customers with a Consolidation Center. Oper. Res. 56(5): 1264-1277 (2008) - 2007
- [j10]Raymond K. Cheung, Dongsheng Xu, Yongpei Guan:
A Solution Method for a Two-dispatch Delivery Problem with Stochastic Customers. J. Math. Model. Algorithms 6(1): 87-107 (2007) - [j9]Ning Shi, Raymond K. Cheung, Haiqing Song:
On stochastic programs over trees with partially dependent arc capacities. Networks 50(2): 157-163 (2007) - [j8]Dongsheng Xu, Ning Shi, Raymond K. Cheung:
Heavy traffic analysis of a single vehicle loop in an automated storage and retrieval system. OR Spectr. 29(3): 489-512 (2007) - 2006
- [c1]Raymond K. Cheung, Allen W. Lee, Daniel Y. Mo:
Flow Diversion Approaches for Shipment Routing in Automatic Shipment Handling Systems. ICRA 2006: 695-700 - 2005
- [j7]Raymond K. Cheung, Darren D. Hang, Ning Shi:
A labeling method for dynamic driver-task assignment with uncertain task durations. Oper. Res. Lett. 33(4): 411-420 (2005) - 2004
- [j6]Yongpei Guan, Raymond K. Cheung:
The berth allocation problem: models and solution methods. OR Spectr. 26(1): 75-92 (2004) - 2002
- [j5]Yongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li:
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Oper. Res. Lett. 30(5): 343-350 (2002) - [j4]Raymond K. Cheung, Chung-Lun Li, Wuqin Lin:
Interblock Crane Deployment in Container Terminals. Transp. Sci. 36(1): 79-93 (2002) - 2000
- [j3]Raymond K. Cheung, B. Muralidharan:
Dynamic Routing for Priority Shipments in LTL Service Networks. Transp. Sci. 34(1): 86-98 (2000)
1990 – 1999
- 1999
- [j2]Raymond K. Cheung, B. Muralidharan:
Impact of dynamic decision making on hub‐and‐spoke freight transportationnetworks. Ann. Oper. Res. 87: 49-71 (1999) - 1998
- [j1]Raymond K. Cheung, Chuen-Yih Chen:
A Two-Stage Stochastic Network Model and Solution Methods for the Dynamic Empty Container Allocation Problem. Transp. Sci. 32(2): 142-162 (1998)
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-09 12:47 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:
