- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j9 |      | Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim: A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. European Journal of Operational Research 224(1): 110-121 (2013) |
| 2012 | ||
| j8 | | Wenbin Zhu, Wee-Chong Oon, Andrew Lim, Yujian Weng: The six elements to block-building approaches for the single container loading problem. Appl. Intell. 37(3): 431-445 (2012) |
| j7 | | Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim: A reference length approach for the 3D strip packing problem. European Journal of Operational Research 220(1): 37-47 (2012) |
| j6 | | Wenbin Zhu, Zhaoyi Zhang, Wee-Chong Oon, Andrew Lim: Space defragmentation for packing problems. European Journal of Operational Research 222(3): 452-463 (2012) |
| 2011 | ||
| j5 | | Yongquan Li, Andrew Lim, Wee-Chong Oon, Hu Qin, Dejian Tu: The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. European Journal of Operational Research 212(3): 482-496 (2011) |
| j4 | | Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim: A skyline heuristic for the 2D rectangular packing and strip packing problems. European Journal of Operational Research 215(2): 337-346 (2011) |
| c16 | | Wenbin Zhu, Wee-Chong Oon, Yujian Weng, Andrew Lim: Optimal Algorithms for Two-Dimensional Box Placement Problems. IEA/AIE (2) 2011: 246-255 |
| c15 | | Xiang Gao, Andrew Lim, Wee-Chong Oon, Hu Qin: An Algorithm for the Freight Allocation Problem with All-Units Quantity-Based Discount. IEA/AIE (2) 2011: 256-265 |
| c14 | | 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 | ||
| c13 | | 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 |
| 2007 | ||
| c12 | | |
| c11 | | Wee-Chong Oon, Martin Henz: M2ICAL: A Tool for Analyzing Imperfect Comparison Algorithms. ICTAI (1) 2007: 28-35 |
| 2003 | ||
| j3 | | Brenda Cheang, Andy Kurnia, Andrew Lim, Wee-Chong Oon: On automated grading of programming assignments in an academic institution. Computers & Education 41(2): 121-131 (2003) |
| c10 | | Andrew Lim, Wee-Chong Oon, Wenbin Zhu: Towards definitive benchmarking of algorithm performance. ECIS 2003: 1112-1129 |
| 2002 | ||
| j2 | | Andrew Lim, Wee-Chong Oon, Chi-Hung Chi: A matching-based algorithm for page access sequencing in join processing. Journal of Systems and Software 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 | | |
| 2001 | ||
| j1 | | Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon: 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, Wee-Chong Oon: 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, Wee-Chong Oon, Chi-Hung Chi: A New Algorithm for Page Access Sequencing in Join Processing. ADBIS-DASFAA 2000: 128-141 |
| 1999 | ||
| c1 | | Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon: Page Access Scheduling in Join Processing. CIKM 1999: 276-283 |
Data released under the ODC-BY 1.0 license — See also our legal information page