Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYi Zhu 0007
Person information
- affiliation: Hong Kong University of Science Technology, Department of IEEM, Hong Kong
Other persons with the same name
- Yi Zhu — disambiguation page
- Yi Zhu 0001
![[0000-0002-6482-6712]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-6482-6712")
— Amazon (and 1 more) - Yi Zhu 0002 — University of California, San Diego, USA
- Yi Zhu 0003 — Delft University of Technology, Netherlands
- Yi Zhu 0004 — Chinese Academy of Sciences, China
- Yi Zhu 0005 — Hawaii Pacific University, Honolulu, HI, USA (and 1 more)
- Yi Zhu 0006 — Yangzhou University, Jiangsu, China (and 1 more)
- Yi Zhu 0008 — Nanjing University of Aeronautics and Astronautics, College of Information Science and Technology, China
- Yi Zhu 0009 — Tianjin University, Tianjin Key Laboratory of Cognitive Computing and Application, College of Intelligence and Computing, China
- Yi Zhu 0010 — Tsinghua Unversity, Yau Mathematical Sciences Center, Beijing, China (and 1 more)
- Yi Zhu 0011 — University of Québec, Multisensory Signal Analysis and Enhancement Lab, MuSAE, National Institute of Scientific Research, INRS, Canada (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[j6]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Heuristics for a bidding problem. Comput. Oper. Res. 33: 2179-2188 (2006)- [j5]Yi Zhu, Andrew Lim:
Crane scheduling with non-crossing constraint. J. Oper. Res. Soc. 57(12): 1464-1471 (2006) - [j4]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Carrier assignment models in transportation procurement. J. Oper. Res. Soc. 57(12): 1472-1481 (2006) - 2005
- [j3]Andrew Lim, Brian Rodrigues, Yi Zhu:
Airport Gate Scheduling with Time Windows. Artif. Intell. Rev. 24(1): 5-31 (2005) - [j2]H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
The over-constrained airport gate assignment problem. Comput. Oper. Res. 32: 1867-1880 (2005) - [c8]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem. HICSS 2005 - [c7]Andrew Lim, Yi Zhu, Q. Lou, Brian Rodrigues:
Heuristic methods for graph coloring problems. SAC 2005: 933-939 - 2004
- [j1]H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
New heuristics for over-constrained flight to gate assignments. J. Oper. Res. Soc. 55(7): 760-768 (2004) - [c6]H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
Aircraft and Gate Scheduling Optimization at Airports. HICSS 2004 - [c5]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Heuristics for a Brokering Set Packing Problem. AI&M 2004 - [c4]Yi Zhu, Andrew Lim:
Crane Scheduling with Spatial Constraints: Mathematical Models and Solving Approaches. AI&M 2004 - 2003
- [c3]Yi Zhu, Andrew Lim, Brian Rodrigues:
Aircraft and Gate Scheduling with Time Windows. ICTAI 2003: 189-193 - 2002
- [c2]Andrew Lim, Brian Rodrigues, Fei Xiao, Yi Zhu:
Crane Scheduling Using Tabu Search. ICTAI 2002: 146-153 - 2001
- [c1]Chen Qun, Andrew Lim, Yi Zhu:
Index and Data Allocation in Mobile Broadcast. DEXA 2001: 785-794
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-06-20 20:44 CEST 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:
