default search action
Wee-Chong Oon
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j12]Wenbin Zhu, Zhixing Luo
, Andrew Lim
A fast implementation for the 2D/3D box placement problem. Comput. Optim. Appl. 63(2): 585-612 (2016) - 2013
- [j11]Lijun Wei
A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. Eur. J. Oper. Res. 224(1): 110-121 (2013) - 2012
- [j10]Wenbin Zhu, Wee-Chong Oon, Andrew Lim
The six elements to block-building approaches for the single container loading problem. Appl. Intell. 37(3): 431-445 (2012) - [j9]Lijun Wei
A reference length approach for the 3D strip packing problem. Eur. J. Oper. Res. 220(1): 37-47 (2012) - [j8]Wenbin Zhu, Zhaoyi Zhang, Wee-Chong Oon, Andrew Lim
Space defragmentation for packing problems. Eur. J. Oper. Res. 222(3): 452-463 (2012) - 2011
- [j7]Yongquan Li, Andrew Lim
The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. Eur. J. Oper. Res. 212(3): 482-496 (2011) - [j6]Lijun Wei
A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur. J. Oper. Res. 215(2): 337-346 (2011) - [j5]Yibo Chen, Wee-Chong Oon, Wenbin Zhu:
Ricochet Robots is Solved. J. Int. Comput. Games Assoc. 34(4): 223-226 (2011) - [c17]Wenbin Zhu, Wee-Chong Oon, Yujian Weng, Andrew Lim
Optimal Algorithms for Two-Dimensional Box Placement Problems. IEA/AIE (2) 2011: 246-255 - [c16]Xiang Gao, Andrew Lim
An Algorithm for the Freight Allocation Problem with All-Units Quantity-Based Discount. IEA/AIE (2) 2011: 256-265 - [c15]Zhaoyi Zhang, Songshan Guo, Wenbin Zhu, Wee-Chong Oon, Andrew Lim
Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems. IJCAI 2011: 699-704 - 2010
- [c14]Dejian Tu, Songshan Guo, Hu Qin, Wee-Chong Oon, Andrew Lim:
The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading. AAAI 2010: 191-196
2000 – 2009
- 2007
- [c13]Wee-Chong Oon, Martin Henz:
M2ICAL Analyses HC-Gammon. AAAI 2007: 621-626 - [c12]Wee-Chong Oon, Martin Henz
M2ICAL: A Tool for Analyzing Imperfect Comparison Algorithms. ICTAI (1) 2007: 28-35 - 2003
- [j4]Brenda Cheang
On automated grading of programming assignments in an academic institution. Comput. Educ. 41(2): 121-131 (2003) - [c11]Wee-Chong Oon, Yew Jin Lim:
An investigation on piece differential information in co-evolution on games using Kalah. IEEE Congress on Evolutionary Computation 2003: 1632-1638 - [c10]Andrew Lim, Wee-Chong Oon, Wenbin Zhu:
Towards definitive benchmarking of algorithm performance. ECIS 2003: 1112-1129 - 2002
- [j3]Donald L. Keefer, Javier Faulin, Alberto Bayo, Andrew Lim
Practice Abstracts. Interfaces 32(6): 41-44 (2002) - [j2]Andrew Lim
A matching-based algorithm for page access sequencing in join processing. J. Syst. Softw. 60(1): 11-19 (2002) - [c9]Andrew Lim, Juay Chin Ang, Wee-Kit Ho, Wee-Chong Oon:
UTTSExam: A Campus-Wide University Exam-Timetabling System. AAAI/IAAI 2002: 838-844 - [c8]Wee-Chong Oon, Andrew Lim:
Multi-Player Game Approach to Solving Multi-Entity Problems. AAAI/IAAI 2002: 961-962 - [c7]Andrew Lim, Juay Chin Ang, Wee-Kit Ho, Wee-Chong Oon:
UTTSExam: A University Examination Timetable Scheduler. AAAI/IAAI 2002: 1004-1005 - [c6]Wee-Chong Oon, Andrew Lim
Multi-Player Game Approach to Scheduling Problems. ISPAN 2002: 205- - 2001
- [j1]Andrew Lim
Page access scheduling in join processing. Data Knowl. Eng. 37(3): 267-284 (2001) - [c5]Chen Qun, Andrew Lim, Wee-Chong Oon:
Page Access Sequencing in Join Processing with Limited Buffer Space. DEXA 2001: 380-389 - [c4]Wee-Kit Ho, Andrew Lim
Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method. ICTAI 2001: 359-366 - 2000
- [c3]Andrew Lim, Ang Juay Chin, Wee-Kit Ho, Wee-Chong Oon:
A Campus-Wide University Examination Timetabling Application. AAAI/IAAI 2000: 1020-1015 - [c2]Andrew Lim
A New Algorithm for Page Access Sequencing in Join Processing. ADBIS-DASFAA 2000: 128-141
1990 – 1999
- 1999
- [c1]Andrew Lim
Page Access Scheduling in Join Processing. CIKM 1999: 276-283
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-04-24 23:15 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: