 | 2009 |
|---|
| 151 |       | Zhirong Liang,
Songshan Guo,
Yanzhi Li,
Andrew Lim:
Balancing Workload in Project Assignment.
Australasian Conference on Artificial Intelligence 2009: 91-100 |
| 150 | | Andrew Lim,
Hong Ma,
Qi Wen,
Zhou Xu,
Brenda Cheang:
Distinguishing citation quality for journal impact assessment.
Commun. ACM 52(8): 111-116 (2009) |
| 149 | | Zhaowei Miao,
Andrew Lim,
Hong Ma:
Truck dock assignment problem with operational time constraint within crossdocks.
European Journal of Operational Research 192(1): 105-115 (2009) |
| 148 | | Yanzhi Li,
Andrew Lim,
Brian Rodrigues:
Note - Pricing and Inventory Control for a Perishable Product.
Manufacturing & Service Operations Management 11(3): 538-542 (2009) |
| 2008 |
|---|
| 147 |  | Jianfeng Zhu,
Wenbin Zhu,
Chan Hou Che,
Andrew Lim:
A Vehicle Routing System to Solve a Periodic Vehicle Routing Problem for a Food Chain in Hong Kong.
AAAI 2008: 1763-1768 |
| 146 | | Andrew Lim,
Hu Qin,
Jing Xu,
Zhou Xu:
Random Move Tabu Search for Freight Proportion Allocation Problem.
ICTAI (2) 2008: 307-314 |
| 145 | | Qun Chen,
Andrew Lim,
Kian Win Ong:
Enabling structural summaries for efficient update and workload adaptation.
Data Knowl. Eng. 64(3): 558-579 (2008) |
| 144 | | Yunsong Guo,
Yanzhi Li,
Andrew Lim,
Brian Rodrigues:
Tariff concessions in production sourcing.
European Journal of Operational Research 187(2): 543-555 (2008) |
| 143 | | Fan Wang,
Andrew Lim:
Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem.
IEEE T. Automation Science and Engineering 5(2): 289-297 (2008) |
| 142 | | Andrew Lim,
Brian Rodrigues,
Zhou Xu:
Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees.
Operations Research 56(3): 758-771 (2008) |
| 2007 |
|---|
| 141 | | Andrew Lim,
Hong Ma,
Qi Wen,
Zhou Xu,
Brenda Cheang,
Bernard Tan,
Wenbin Zhu:
Journal-Ranking.com: An Online Interactive Journal Ranking System.
AAAI 2007: 1723-1729 |
| 140 | | Andrew Lim,
Jing Lin,
Fei Xiao:
Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem.
Appl. Intell. 26(3): 175-182 (2007) |
| 139 | | Fan Wang,
Andrew Lim:
A stochastic beam search for the berth allocation problem.
Decision Support Systems 42(4): 2186-2196 (2007) |
| 138 | | Andrew Lim,
Xingwen Zhang:
A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows.
INFORMS Journal on Computing 19(3): 443-457 (2007) |
| 137 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues,
Liang Yang:
Minimizing the makespan for Unrelated Parallel Machines.
International Journal on Artificial Intelligence Tools 16(3): 399-415 (2007) |
| 136 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao:
A Fast Algorithm for Bandwidth Minimization.
International Journal on Artificial Intelligence Tools 16(3): 537-544 (2007) |
| 2006 |
|---|
| 135 | | Andrew Lim,
Zhou Xu,
Brenda Cheang,
Wee-Kit Ho,
Steve Au-yeung:
TPBOSCourier: A Transportation Procurement System (for the Procurement of Courier Services).
AAAI 2006 |
| 134 | | Andrew Lim,
Hong Ma,
Zhaowei Miao:
Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks.
ICCSA (3) 2006: 688-697 |
| 133 | | Xi Li,
Andrew Lim,
Zhaowei Miao,
Brian Rodrigues:
Reducing Transportation Costs in Distribution Networks.
IEA/AIE 2006: 1138-1148 |
| 132 | | Andrew Lim,
Kaicheng Zhang:
A Robust RFID-Based Method for Precise Indoor Positioning.
IEA/AIE 2006: 1189-1199 |
| 131 | | Andrew Lim,
Hong Ma,
Zhaowei Miao:
Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks.
IEA/AIE 2006: 262-271 |
| 130 | | Yanzhi Li,
Andrew Lim,
Hong Ma:
A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem.
IEA/AIE 2006: 272-281 |
| 129 | | Andrew Lim,
Wenbin Zhu:
A Fast and Effective Insertion Algorithm for Multi-depot Vehicle Routing Problem with Fixed Distribution of Vehicles and a New Simulated Annealing Approach.
IEA/AIE 2006: 282-291 |
| 128 | | Zhenyu Wang,
Oscar Che,
Lijuan Chen,
Andrew Lim:
An Efficient Shortest Path Computation System for Real Road Networks.
IEA/AIE 2006: 711-720 |
| 127 | | Zhenyu Wang,
Chan Che,
Andrew Lim:
Tabu Search for Generalized Minimum Spanning Tree Problem.
PRICAI 2006: 918-922 |
| 126 | | Andrew Lim,
Jing Lin,
Brian Rodrigues,
Fei Xiao:
Ant colony optimization with hill climbing for the bandwidth minimization problem.
Appl. Soft Comput. 6(2): 180-188 (2006) |
| 125 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues,
Yi Zhu:
Heuristics for a bidding problem.
Computers & OR 33: 2179-2188 (2006) |
| 124 | | Ping Chen,
Yunsong Guo,
Andrew Lim,
Brian Rodrigues:
Multiple crossdocks with inventory and time windows.
Computers & OR 33: 43-63 (2006) |
| 123 | | Qun Chen,
Andrew Lim,
Kian Win Ong,
Jiqing Tang:
Indexing graph-structured XML data for efficient structural join operation.
Data Knowl. Eng. 58(2): 159-179 (2006) |
| 122 | | Qun Chen,
Andrew Lim,
Kian Win Ong,
Jiqing Tang:
Indexing XML documents for XPath query processing in external memory.
Data Knowl. Eng. 59(3): 681-699 (2006) |
| 121 | | Gaofeng Huang,
Andrew Lim:
A hybrid genetic algorithm for the Three-Index Assignment Problem.
European Journal of Operational Research 172(1): 249-257 (2006) |
| 120 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao:
Heuristics for matrix bandwidth reduction.
European Journal of Operational Research 174(1): 69-91 (2006) |
| 119 | | Andrew Lim,
Zhou Xu:
A critical-shaking neighborhood search for the yard allocation problem.
European Journal of Operational Research 174(2): 1247-1259 (2006) |
| 118 | | Andrew Lim,
Brian Rodrigues,
X. Zhang:
A simulated annealing and hill-climbing algorithm for the traveling tournament problem.
European Journal of Operational Research 174(3): 1459-1478 (2006) |
| 117 | | Andrew Lim,
Brian Rodrigues,
X. Zhang:
Scheduling sports competitions at multiple venues - Revisited.
European Journal of Operational Research 175(1): 171-186 (2006) |
| 116 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues,
Jiqing Tang:
Using a Lagrangian Heuristic for a Combinatorial Auction Problem.
International Journal on Artificial Intelligence Tools 15(3): 481-489 (2006) |
| 115 | | Andrew Lim,
Brian Rodrigues,
Caixia Wang:
Two-machine flow shop problems with a single server.
J. Scheduling 9(6): 515-543 (2006) |
| 114 | | Fan Wang,
Andrew Lim,
Zhou Xu:
The one-commodity pickup and delivery travelling salesman problem on a path or a tree.
Networks 48(1): 24-35 (2006) |
| 113 | | Andrew Lim,
Fan Wang,
Zhou Xu:
A Transportation Problem with Minimum Quantity Commitment.
Transportation Science 40(1): 117-129 (2006) |
| 2005 |
|---|
| 112 | | Yanzhi Li,
Andrew Lim,
Hong Ma:
A Lagrangian Relaxation Based Heuristic for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem.
Australian Conference on Artificial Intelligence 2005: 1323-1326 |
| 111 | | Andrew Lim,
Jiqing Tang:
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions.
Australian Conference on Artificial Intelligence 2005: 736-745 |
| 110 | | Yunsong Guo,
Yanzhi Li,
Andrew Lim,
Brian Rodrigues:
A Multi-exchange Heuristic for a Production Location Problem.
Australian Conference on Artificial Intelligence 2005: 871-874 |
| 109 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues,
Yi Zhu:
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem.
HICSS 2005 |
| 108 | | Andrew Lim,
Xingwen Zhang:
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles.
HICSS 2005 |
| 107 | | Andrew Lim,
Fan Wang:
Robust Graph Coloring for Uncertain Supply Chain Management.
HICSS 2005 |
| 106 | | Andrew Lim,
Zhou Xu:
Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line.
ICTAI 2005: 491-498 |
| 105 | | Yue Geng,
Yanzhi Li,
Andrew Lim:
A Very Large-Scale Neighborhood Search Approach to Capacitated Warehouse Routing Problem.
ICTAI 2005: 58-65 |
| 104 | | Andrew Lim,
Fan Wang:
Robust Airport Gate Assignment.
ICTAI 2005: 74-81 |
| 103 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues,
Jiqing Tang:
Using a Lagrangian Heuristic for a Combinatorial Auction Problem.
ICTAI 2005: 99-103 |
| 102 | | Andrew Lim,
Fan Wang,
Zhou Xu:
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree.
ISAAC 2005: 1061-1070 |
| 101 | | Songshan Guo,
Weixing Li,
Andrew Lim,
Fan Wang:
The shortest route cut and fill problem in linear topological structure.
SAC 2005: 409-410 |
| 100 | | Andrew Lim,
Xingwen Zhang:
The container loading problem.
SAC 2005: 913-917 |
| 99 | | Andrew Lim,
Yi Zhu,
Q. Lou,
Brian Rodrigues:
Heuristic methods for graph coloring problems.
SAC 2005: 933-939 |
| 98 | | L. Zhang,
Songshan Guo,
Yunsong Zhu,
Andrew Lim:
A tabu search algorithm for the safe transportation of hazardous materials.
SAC 2005: 940-946 |
| 97 | | Andrew Lim,
Brian Rodrigues,
Y. Yang:
3-D Container Packing Heuristics.
Appl. Intell. 22(2): 125-134 (2005) |
| 96 | | Andrew Lim,
Brian Rodrigues,
Yi Zhu:
Airport Gate Scheduling with Time Windows.
Artif. Intell. Rev. 24(1): 5-31 (2005) |
| 95 | | H. Ding,
Andrew Lim,
Brian Rodrigues,
Yi Zhu:
The over-constrained airport gate assignment problem.
Computers & OR 32: 1867-1880 (2005) |
| 94 | | Andrew Lim,
Brian Rodrigues:
A Note on the Optimal EOQ for Announced Price Increases in the Infinite Horizon.
Operations Research 53(4): 731-732 (2005) |
| 93 | | Andrew Lim,
Brian Rodrigues,
Fan Wang,
Zhou Xu:
k-Center problems with minimum coverage.
Theor. Comput. Sci. 332(1-3): 1-17 (2005) |
| 2004 |
|---|
| 92 | | Gaofeng Huang,
Andrew Lim:
A Simple Yet Effective Framework for Optimization Problems.
AMAI 2004 |
| 91 | | Yi Zhu,
Andrew Lim:
Crane Scheduling with Spatial Constraints: Mathematical Models and Solving Approaches.
AMAI 2004 |
| 90 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues,
Yi Zhu:
Heuristics for a Brokering Set Packing Problem.
AMAI 2004 |
| 89 | | Songshan Guo,
Ying Kong,
Andrew Lim,
Fan Wang:
A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem.
Australian Conference on Artificial Intelligence 2004: 636-645 |
| 88 | | Andrew Lim,
Fan Wang,
Zhou Xu:
On the Selection and Assignment with Minimum Quantity Commitments.
COCOON 2004: 102-111 |
| 87 | | Andrew Lim,
Zhaowei Miao,
Brian Rodrigues,
Zhou Xu:
Transshipment Through Crossdocks with Inventory and Time Windows.
COCOON 2004: 122-131 |
| 86 | | Andrew Lim,
Brian Rodrigues,
Fan Wang,
Zhou Xu:
k-Center Problems with Minimum Coverage.
COCOON 2004: 349-359 |
| 85 | | Andrew Lim,
Brian Rodrigues,
Zhou Xu:
Solving the Crane Scheduling Problem Using Intelligent Search Schemes.
CP 2004: 747-751 |
| 84 | | Andrew Lim,
Zhou Xu:
A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem.
ECAI 2004: 1049-1050 |
| 83 | | Gaofeng Huang,
Andrew Lim:
An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem.
ECAI 2004: 191-195 |
| 82 | | Fan Wang,
Andrew Lim,
Hong Chen:
Flexible Demand Assignment Problem.
ECAI 2004: 698-704 |
| 81 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao:
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem.
HICSS 2004 |
| 80 | | H. Ding,
Andrew Lim,
Brian Rodrigues,
Yi Zhu:
Aircraft and Gate Scheduling Optimization at Airports.
HICSS 2004 |
| 79 | | Andrew Lim,
Fan Wang:
Meta-Heuristics for Robust Graph Coloring Problem.
ICTAI 2004: 514-518 |
| 78 | | Yanzhi Li,
Andrew Lim:
MetaIP - A New Approach to Combinatorial Optimization: Case Studies.
ICTAI 2004: 56-62 |
| 77 | | Andrew Lim,
Fan Wang:
A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW.
ICTAI 2004: 704-708 |
| 76 | | Zhiye Li,
Songshan Guo,
Fan Wang,
Andrew Lim:
Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles.
IEA/AIE 2004: 552-561 |
| 75 | | Andrew Lim,
Zhou Xu:
The Bottleneck Problem with Minimum Quantity Commitments.
SWAT 2004: 285-297 |
| 74 | | Andrew Lim,
Brian Rodrigues,
Zhou Xu:
Approximation Schemes for the Crane Scheduling Problem.
SWAT 2004: 323-335 |
| 73 | | Andrew Lim,
Brian Rodrigues,
Ramesh Thangarajo,
Fei Xiao:
A Hybrid Framework for Over-Constrained Generalized.
Artif. Intell. Rev. 22(3): 211-243 (2004) |
| 72 | | Yanzhi Li,
Fan Wang,
Andrew Lim:
A genetic algorithm for machine scheduling problem under shared resource constraints.
IJCAT 19(2): 77-83 (2004) |
| 71 | | Ping Chen,
Zhaohui Fu,
Andrew Lim,
Brian Rodrigues:
The Two-Dimensional Packing Problem for Irregular Objects.
International Journal on Artificial Intelligence Tools 13(3): 429-448 (2004) |
| 2003 |
|---|
| 70 | | Ying Kong,
Fan Wang,
Andrew Lim,
Songshan Guo:
A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem.
Australian Conference on Artificial Intelligence 2003: 125-136 |
| 69 | | Andrew Lim,
Wee-Chong Oon,
Wenbin Zhu:
Towards definitive benchmarking of algorithm performance.
ECIS 2003 |
| 68 | | Gaofeng Huang,
Andrew Lim:
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem.
GECCO 2003: 1053-1064 |
| 67 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao:
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem.
GECCO 2003: 1594-1595 |
| 66 | | Andrew Lim,
Zhou Xu:
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem.
GECCO 2003: 1596-1597 |
| 65 | | Ping Chen,
Zhaohui Fu,
Andrew Lim,
Brian Rodrigues:
The General Yard Allocation Problem.
GECCO 2003: 1986-1997 |
| 64 | | Ping Chen,
Zhaohui Fu,
Andrew Lim,
Brian Rodrigues:
Two-Dimensional acking For Irregular Shaped Objects.
HICSS 2003: 86 |
| 63 | | Yi Zhu,
Andrew Lim,
Brian Rodrigues:
Aircraft and Gate Scheduling with Time Windows.
ICTAI 2003: 189-193 |
| 62 | | Gaofeng Huang,
Andrew Lim:
Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem.
ICTAI 2003: 194- |
| 61 | | Yunsong Guo,
Andrew Lim,
Brian Rodrigues:
Transportation Bid Analysis Optimization with Shipper Input.
ICTAI 2003: 290- |
| 60 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao:
Using an evolutionary algorithm for bandwidth minimization.
IEEE Congress on Evolutionary Computation (1) 2003: 678-683 |
| 59 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao:
A New Node Centroid Algorithm for Bandwidth Minimization.
IJCAI 2003: 1544-1545 |
| 58 | | Haibing Li,
Andrew Lim,
Brian Rodrigues:
A Hybrid AI Approach for Nurse Rostering Problem.
SAC 2003: 730-735 |
| 57 | | Andrew Lim,
Brian Rodrigues,
Lei Song:
Manpower Scheduling with Time Windows.
SAC 2003: 741-746 |
| 56 | | Chen Qun,
Andrew Lim,
Kian Win Ong:
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data.
SIGMOD Conference 2003: 134-144 |
| 55 | | Kai Song Goh,
Andrew Lim,
Brian Rodrigues:
Sexual Selection for Genetic Algorithms.
Artif. Intell. Rev. 19(2): 123-152 (2003) |
| 54 | | 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) |
| 53 | | Haibing Li,
Andrew Lim:
Local search with annealing-like restarts to solve the VRPTW.
European Journal of Operational Research 150(1): 115-127 (2003) |
| 52 | | Brenda Cheang,
H. Li,
Andrew Lim,
Brian Rodrigues:
Nurse rostering problems - a bibliographic survey.
European Journal of Operational Research 151(3): 447-460 (2003) |
| 51 | | Haibing Li,
Andrew Lim:
A Metaheuristic for the Pickup and Delivery Problem with Time Windows.
International Journal on Artificial Intelligence Tools 12(2): 173-186 (2003) |
| 2002 |
|---|
| 50 | | Andrew Lim,
Juay Chin Ang,
Wee-Kit Ho,
Wee-Chong Oon:
UTTSExam: A University Examination Timetable Scheduler.
AAAI/IAAI 2002: 1004-1005 |
| 49 | | Ping Chen,
Zhaohui Fu,
Andrew Lim:
The Yard Allocation Problem.
AAAI/IAAI 2002: 3-8 |
| 48 | | Andrew Lim,
Juay Chin Ang,
Wee-Kit Ho,
Wee-Chong Oon:
UTTSExam: A Campus-Wide University Exam-Timetabling System.
AAAI/IAAI 2002: 838-844 |
| 47 | | Wee-Chong Oon,
Andrew Lim:
Multi-Player Game Approach to Solving Multi-Entity Problems.
AAAI/IAAI 2002: 961-962 |
| 46 | | Andrew Lim,
Brian Rodrigues,
Ramesh Thangarajo,
Fei Xiao:
Over-Constrained Resource-Constrained Scheduling Problems with Prioritized Activities.
FSKD 2002: 672-676 |
| 45 | | Ping Chen,
Zhaohui Fu,
Andrew Lim:
Using Genetic Algorithms To Solve The Yard Allocation Problem.
GECCO 2002: 1049-1056 |
| 44 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao,
Yi Zhu:
Crane Scheduling Using Tabu Search.
ICTAI 2002: 146-153 |
| 43 | | Andrew Lim,
Brian Rodrigues,
Fei Xiao,
Xingwen Zhang:
Adjusted Network Flow for the Shelf-Space Allocation Problem.
ICTAI 2002: 224- |
| 42 | | Wee-Chong Oon,
Andrew Lim:
Multi-Player Game Approach to Scheduling Problems.
ISPAN 2002: 205- |
| 41 | | Haibing Li,
Andrew Lim:
Local search with annealing-like restarts to solve the vehicle routing problem with time windows.
SAC 2002: 560-565 |
| 40 | | 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) |
| 2001 |
|---|
| 39 | | Chen Qun,
Andrew Lim,
Wee-Chong Oon:
Page Access Sequencing in Join Processing with Limited Buffer Space.
DEXA 2001: 380-389 |
| 38 | | Chen Qun,
Andrew Lim,
Yi Zhu:
Index and Data Allocation in Mobile Broadcast.
DEXA 2001: 785-794 |
| 37 | | Wee-Kit Ho,
Andrew Lim:
A Hybrid-Based Framework for Constraint Satisfaction Optimization Problems.
ICIS 2001: 65-76 |
| 36 | | Haibing Li,
Andrew Lim:
A Metaheuristic for the Pickup and Delivery Problem with Time Windows.
ICTAI 2001: 160- |
| 35 | | Wee-Kit Ho,
Andrew Lim,
Wee-Chong Oon:
Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method.
ICTAI 2001: 359-366 |
| 34 | | Andrew Lim,
Wang Ying:
A New Method For The Three Dimensional Container Packing Problem.
IJCAI 2001: 342-350 |
| 33 | | Andy Kurnia,
Andrew Lim,
Brenda Cheang:
Online Judge.
Computers & Education 36(4): 299-315 (2001) |
| 32 | | Andrew Lim,
Jennifer Lai-Pheng Kwan,
Wee-Chong Oon:
Page access scheduling in join processing.
Data Knowl. Eng. 37(3): 267-284 (2001) |
| 31 | | Wee-Kit Ho,
Juay Chin Ang,
Andrew Lim:
A Hybrid Search Algorithm for the Vehicle Routing Problem with Time Windows.
International Journal on Artificial Intelligence Tools 10(3): 431-449 (2001) |
| 2000 |
|---|
| 30 | | Andrew Lim,
Ang Juay Chin,
Wee-Kit Ho,
Wee-Chong Oon:
A Campus-Wide University Examination Timetabling Application.
AAAI/IAAI 2000: 1020-1015 |
| 29 | | Hoong Chuin Lau,
Andrew Lim,
Qi Zhang Liu:
Solving a Supply Chain Optimization Problem Collaboratively.
AAAI/IAAI 2000: 780-785 |
| 28 | | Andrew Lim,
Wee-Chong Oon,
Chi-Hung Chi:
A New Algorithm for Page Access Sequencing in Join Processing.
ADBIS-DASFAA 2000: 128-141 |
| 27 | | Chi Chi-Huing,
Li Xiang,
Andrew Lim:
Dynamically Transcoding Data Quality for Faster Web Access.
HPCN Europe 2000: 527-530 |
| 26 | | Zhaohui Fu,
Andrew Lim:
Heuristics for the exam scheduling problem.
ICTAI 2000: 172-175 |
| 25 | | Dennis Joshua Chia,
Andrew Lim:
Local search algorithm for the compacted cells area problem.
ICTAI 2000: 294-297 |
| 24 | | Kai Song Goh,
Andrew Lim:
Combining various algorithms to solve the ship berthing problem.
ICTAI 2000: 370- |
| 23 | | Kai Song Goh,
Andrew Lim:
Algorithms for Solving the Ship Berthing Problem.
PRICAI 2000: 797 |
| 1999 |
|---|
| 22 | | Chia Jim Tong,
Hoong Chuin Lau,
Andrew Lim:
Ant Colony Optimization for the Ship Berthing Problem.
ASIAN 1999: 359-370 |
| 21 | | Andrew Lim,
Jennifer Lai-Pheng Kwan,
Wee-Chong Oon:
Page Access Scheduling in Join Processing.
CIKM 1999: 276-283 |
| 20 | | Chi-Hung Chi,
Chen Ding,
Andrew Lim:
Word Segmentation and Recognition for Web Document Framework.
CIKM 1999: 458-465 |
| 19 | | Ang Juay Chin,
Wee-Kit Ho,
Andrew Lim:
A New GA Approach for the Vehicle Routing Problem.
ICTAI 1999: 307-310 |
| 18 | | Andrew Lim:
An Effective Ship Berthing Algorithm.
IJCAI 1999: 594-599 |
| 1998 |
|---|
| 17 | | Andrew Lim:
The berth planning problem.
Oper. Res. Lett. 22(2-3): 105-110 (1998) |
| 1997 |
|---|
| 16 | | Andrew Lim,
Venkat Thanvantri,
Sartaj Sahni:
Planar topological routing.
IEEE Trans. on CAD of Integrated Circuits and Systems 16(6): 651-656 (1997) |
| 1996 |
|---|
| 15 | | Andrew Lim:
Minimum Area Joining of k Compacted Cells.
Inf. Process. Lett. 58(6): 265-269 (1996) |
| 1995 |
|---|
| 14 | | Andrew Lim,
Sartaj K. Sahni,
Venkat Thanvantri:
A fast algorithm to test planar topological routability.
VLSI Design 1995: 8-12 |
| 1994 |
|---|
| 13 | | Andrew Lim,
Sartaj Sahni:
Segmented Winner Trees.
Elektronische Informationsverarbeitung und Kybernetik 30(1): 29-43 (1994) |
| 12 | | Siu-Wing Cheng,
Hsi-Chuan Chen,
David Hung-Chang Du,
Andrew Lim:
The role of long and short paths in circuit performance optimization.
IEEE Trans. on CAD of Integrated Circuits and Systems 13(7): 857-864 (1994) |
| 1993 |
|---|
| 11 | | Andrew Lim,
Siu-Wing Cheng,
Ching-Ting Wu:
Performance Oriented Rectilinear Steiner Trees.
DAC 1993: 171-176 |
| 10 | | Siu-Wing Cheng,
Andrew Lim,
Ching-Ting Wu:
Optimal Rectilinear Steiner Tree for Extremal Point Sets.
ISAAC 1993: 523-532 |
| 9 | | Andrew Lim,
Siu-Wing Cheng,
Sartaj Sahni:
Optimal Joining of Compacted Cells.
IEEE Trans. Computers 42(5): 597-607 (1993) |
| 8 | | Wing Ning Li,
Andrew Lim,
Prathima Agrawal,
Sartaj Sahni:
On the circuit implementation problem.
IEEE Trans. on CAD of Integrated Circuits and Systems 12(8): 1147-1156 (1993) |
| 7 | | Andrew Lim,
Yeow Meng Chee,
Siu-Wing Cheng:
Single Jog Minimum Area Joining of Compacted Cells.
Inf. Process. Lett. 47(4): 167-172 (1993) |
| 1992 |
|---|
| 6 | | Andrew Lim,
Sartaj Sahni:
Segmented winner trees.
ACM Southeast Regional Conference 1992: 157-164 |
| 5 | | Wing Ning Li,
Andrew Lim,
Prathima Agrawal,
Sartaj Sahni:
On the Circuit Implementation Problem.
DAC 1992: 478-483 |
| 4 | | Siu-Wing Cheng,
Hsi-Chuan Chen,
David Hung-Chang Du,
Andrew Lim:
The Role of Long and Short Paths in Circuit Performance Optimization.
DAC 1992: 543-548 |
| 3 | | Yeow Meng Chee,
Andrew Lim:
A Complex Approach to the Security of Statistical Databases Subject to Off-line Sum Queries.
SEC 1992: 373-384 |
| 2 | | Yeow Meng Chee,
Andrew Lim:
The Algorithmic Complexity of Colour Switching.
Inf. Process. Lett. 43(2): 63-68 (1992) |
| 1991 |
|---|
| 1 | | Ching-Ting Wu,
Andrew Lim,
David Hung-Chang Du:
Wafer Packing for Full Mask Exposure Fabrication.
ICCAD 1991: 52-55 |
