Wafer Packing for Full Mask Exposure Fabrication. - Ching-Ting Wu; Andrew Lim 001; David Hung-Chang Du (ICCAD, 1991)

Performance driven placement with global routing for macro cells. - Andrew Lim 001; Yeow Meng Chee; Ching-Ting Wu (Great Lakes Symposium on VLSI, 1992)

A Complex Approach to the Security of Statistical Databases Subject to Off-line Sum Queries. - Yeow Meng Chee; Andrew Lim 001 (SEC, 1992)

An Effective Timing-Driven Placement Algorithm For Macro Cells. - Ching-Ting Wu; Andrew Lim 001; David H. C. Du (VLSI Design, 1992)

The Algorithmic Complexity of Colour Switching. - Yeow Meng Chee; Andrew Lim 001 (Inf. Process. Lett., 1992)

Performance Oriented Rectilinear Steiner Trees. - Andrew Lim 001; Siu-Wing Cheng; Ching-Ting Wu (DAC, 1993)

Optimal Rectilinear Steiner Tree for Extremal Point Sets. - Siu-Wing Cheng; Andrew Lim 001; Ching-Ting Wu (ISAAC, 1993)

Single Jog Minimum Area Joining of Compacted Cells. - Andrew Lim 001; Yeow Meng Chee; Siu-Wing Cheng (Inf. Process. Lett., 1993)

Optimal Joining of Compacted Cells. - Andrew Lim 001; Siu-Wing Cheng; Sartaj Sahni (IEEE Trans. Computers, 1993)

On the circuit implementation problem. - Wing Ning Li; Andrew Lim 001; Prathima Agrawal; Sartaj Sahni (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1993)

Segmented Winner Trees. - Andrew Lim 001; Sartaj Sahni (J. Inf. Process. Cybern., 1994)

The role of long and short paths in circuit performance optimization. - Siu-Wing Cheng; Hsi-Chuan Chen; David Hung-Chang Du; Andrew Lim 001 (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1994)

A fast algorithm to test planar topological routability. - Andrew Lim 001; Sartaj K. Sahni; Venkat Thanvantri (VLSI Design, 1995)

Conceptual level design for assembly analysis using state transitional approach. - Wynne Hsu; Andrew Lim 001; C. S. George Lee (ICRA, 1996)

Minimum Area Joining of k Compacted Cells. - Andrew Lim 001 (Inf. Process. Lett., 1996)

Planar topological routing. - Andrew Lim 001; Venkat Thanvantri; Sartaj Sahni (IEEE Trans. Comput. Aided Des. Integr. Circuits Syst., 1997)

The berth planning problem. - Andrew Lim 001 (Oper. Res. Lett., 1998)

A computer-aided product redesign system for robotic assembly. - Wynne Hsu; C. S. G. Lee; Andrew Lim 001 (Robotica, 1998)

Ant Colony Optimization for the Ship Berthing Problem. - Chia Jim Tong; Hoong Chuin Lau; Andrew Lim 001 (ASIAN, 1999)

Word Segmentation and Recognition for Web Document Framework. - Chi-Hung Chi; Chen Ding 004; Andrew Lim 001 (CIKM, 1999)

A New GA Approach for the Vehicle Routing Problem. - Ang Juay Chin; Wee-Kit Ho; Andrew Lim 001 (ICTAI, 1999)

An Effective Ship Berthing Algorithm. - Andrew Lim 001 (IJCAI, 1999)

Solving a Supply Chain Optimization Problem Collaboratively. - Hoong Chuin Lau; Andrew Lim 001; Qi Zhang Liu (AAAI/IAAI, 2000)

A Campus-Wide University Examination Timetabling Application. - Andrew Lim 001; Ang Juay Chin; Wee-Kit Ho; Wee-Chong Oon (AAAI/IAAI, 2000)

A New Algorithm for Page Access Sequencing in Join Processing. - Andrew Lim 001; Wee-Chong Oon; Chi-Hung Chi (ADBIS-DASFAA, 2000)

Dynamically Transcoding Data Quality for Faster Web Access. - Chi-Huing Chi; Xiang Li; Andrew Lim 001 (HPCN Europe, 2000)

Local search algorithm for the compacted cells area problem. - Dennis Joshua Chia; Andrew Lim 001 (ICTAI, 2000)

Heuristics for the exam scheduling problem. - Zhaohui Fu; Andrew Lim 001 (ICTAI, 2000)

Combining various algorithms to solve the ship berthing problem. - Kai Song Goh; Andrew Lim 001 (ICTAI, 2000)

Algorithms for Solving the Ship Berthing Problem. - Kai Song Goh; Andrew Lim 001 (PRICAI, 2000)

Page Access Sequencing in Join Processing with Limited Buffer Space. - Chen Qun; Andrew Lim 001; Wee-Chong Oon (DEXA, 2001)

Index and Data Allocation in Mobile Broadcast. - Chen Qun; Andrew Lim 001; Yi Zhu 007 (DEXA, 2001)

A Hybrid-Based Framework for Constraint Satisfaction Optimization Problems. - Wee-Kit Ho; Andrew Lim 001 (ICIS, 2001)

Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method. - Wee-Kit Ho; Andrew Lim 001; Wee-Chong Oon (ICTAI, 2001)

A New Method For The Three Dimensional Container Packing Problem. - Andrew Lim 001; Wang Ying (IJCAI, 2001)

Online Judge. - Andy Kurnia; Andrew Lim 001; Brenda Cheang (Comput. Educ., 2001)

Page access scheduling in join processing. - Andrew Lim 001; Jennifer Lai-Pheng Kwan; Wee-Chong Oon (Data Knowl. Eng., 2001)

A Hybrid Search Algorithm for the Vehicle Routing Problem with Time Windows. - Wee-Kit Ho; Juay Chin Ang; Andrew Lim 001 (Int. J. Artif. Intell. Tools, 2001)

The Yard Allocation Problem. - Ping Chen; Zhaohui Fu; Andrew Lim 001 (AAAI/IAAI, 2002)

UTTSExam: A Campus-Wide University Exam-Timetabling System. - Andrew Lim 001; Juay Chin Ang; Wee-Kit Ho; Wee-Chong Oon (AAAI/IAAI, 2002)

UTTSExam: A University Examination Timetable Scheduler. - Andrew Lim 001; Juay Chin Ang; Wee-Kit Ho; Wee-Chong Oon (AAAI/IAAI, 2002)

Multi-Player Game Approach to Solving Multi-Entity Problems. - Wee-Chong Oon; Andrew Lim 001 (AAAI/IAAI, 2002)

Over-Constrained Resource-Constrained Scheduling Problems with Prioritized Activities. - Andrew Lim 001; Brian Rodrigues; Ramesh Thangarajo; Fei Xiao 001 (FSKD, 2002)

Using Genetic Algorithms To Solve The Yard Allocation Problem. - Ping Chen; Zhaohui Fu; Andrew Lim 001 (GECCO, 2002)

Crane Scheduling Using Tabu Search. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001; Yi Zhu 007 (ICTAI, 2002)

Adjusted Network Flow for the Shelf-Space Allocation Problem. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001; Xingwen Zhang (ICTAI, 2002)

Multi-Player Game Approach to Scheduling Problems. - Wee-Chong Oon; Andrew Lim 001 (ISPAN, 2002)

Local search with annealing-like restarts to solve the vehicle routing problem with time windows. - Haibing Li; Andrew Lim 001 (SAC, 2002)

Practice Abstracts. - Donald L. Keefer; Javier Faulin; Alberto Bayo; Andrew Lim 001; Juay Chin Ang; Wee-Kit Ho; Wee-Chong Oon (Interfaces, 2002)

A matching-based algorithm for page access sequencing in join processing. - Andrew Lim 001; Wee-Chong Oon; Chi-Hung Chi (J. Syst. Softw., 2002)

A New Hybrid Genetic Algorithm for the Robust Graph Coloring Problem. - Ying Kong; Fan Wang 003; Andrew Lim 001; Songshan Guo (Australian Conference on Artificial Intelligence, 2003)

Shortest path problem with cache dependent path lengths. - Zhaohui Fu; Andy Kurnia; Andrew Lim 001; Brian Rodrigues (IEEE Congress on Evolutionary Computation, 2003)

Resource constraints machine scheduling: a genetic algorithm approach. - Yanzhi Li; Fan Wang 003; Andrew Lim 001 (IEEE Congress on Evolutionary Computation, 2003)

Using an evolutionary algorithm for bandwidth minimization. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001 (IEEE Congress on Evolutionary Computation, 2003)

Towards definitive benchmarking of algorithm performance. - Andrew Lim 001; Wee-Chong Oon; Wenbin Zhu (ECIS, 2003)

The General Yard Allocation Problem. - Ping Chen; Zhaohui Fu; Andrew Lim 001; Brian Rodrigues (GECCO, 2003)

Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem. - Gaofeng Huang; Andrew Lim 001 (GECCO, 2003)

Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001 (GECCO, 2003)

A Fixed-Length Subset Genetic Algorithm for the p-Median Problem. - Andrew Lim 001; Zhou Xu 001 (GECCO, 2003)

Two-Dimensional acking For Irregular Shaped Objects. - Ping Chen; Zhaohui Fu; Andrew Lim 001; Brian Rodrigues (HICSS, 2003)

Transportation Bid Analysis Optimization with Shipper Input. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues (ICTAI, 2003)

Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem. - Gaofeng Huang; Andrew Lim 001 (ICTAI, 2003)

Aircraft and Gate Scheduling with Time Windows. - Yi Zhu 007; Andrew Lim 001; Brian Rodrigues (ICTAI, 2003)

A New Node Centroid Algorithm for Bandwidth Minimization. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001 (IJCAI, 2003)

A Hybrid AI Approach for Nurse Rostering Problem. - Haibing Li; Andrew Lim 001; Brian Rodrigues (SAC, 2003)

Manpower Scheduling with Time Windows. - Andrew Lim 001; Brian Rodrigues; Lei Song (SAC, 2003)

D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data. - Chen Qun; Andrew Lim 001; Kian Win Ong (SIGMOD Conference, 2003)

Sexual Selection for Genetic Algorithms. - Kai Song Goh; Andrew Lim 001; Brian Rodrigues (Artif. Intell. Rev., 2003)

On automated grading of programming assignments in an academic institution. - Brenda Cheang; Andy Kurnia; Andrew Lim 001; Wee-Chong Oon (Comput. Educ., 2003)

Nurse rostering problems - a bibliographic survey. - Brenda Cheang; Haibing Li; Andrew Lim 001; Brian Rodrigues (Eur. J. Oper. Res., 2003)

Local search with annealing-like restarts to solve the VRPTW. - Haibing Li; Andrew Lim 001 (Eur. J. Oper. Res., 2003)

A Metaheuristic for the Pickup and Delivery Problem with Time Windows. - Haibing Li; Andrew Lim 001 (Int. J. Artif. Intell. Tools, 2003)

A New Neighborhood Based on Improvement Graph for Robust Graph Coloring Problem. - Songshan Guo; Ying Kong; Andrew Lim 001; Fan Wang 003 (Australian Conference on Artificial Intelligence, 2004)

Transshipment Through Crossdocks with Inventory and Time Windows. - Andrew Lim 001; Zhaowei Miao; Brian Rodrigues; Zhou Xu 001 (COCOON, 2004)

On the Selection and Assignment with Minimum Quantity Commitments. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (COCOON, 2004)

Solving the Crane Scheduling Problem Using Intelligent Search Schemes. - Andrew Lim 001; Brian Rodrigues; Zhou Xu 001 (CP, 2004)

An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem. - Gaofeng Huang; Andrew Lim 001 (ECAI, 2004)

A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem. - Andrew Lim 001; Zhou Xu 001 (ECAI, 2004)

Flexible Demand Assignment Problem. - Fan Wang 003; Andrew Lim 001; Hong Chen (ECAI, 2004)

Aircraft and Gate Scheduling Optimization at Airports. - H. Ding; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (HICSS, 2004)

A Centroid-Based Approach to Solve the Bandwidth Minimization Problem. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001 (HICSS, 2004)

MetaIP - A New Approach to Combinatorial Optimization: Case Studies. - Yanzhi Li; Andrew Lim 001 (ICTAI, 2004)

Meta-Heuristics for Robust Graph Coloring Problem. - Andrew Lim 001; Fan Wang 003 (ICTAI, 2004)

A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. - Andrew Lim 001; Fan Wang 003 (ICTAI, 2004)

Improved GRASP with Tabu Search for Vehicle Routing with Both Time Window and Limited Number of Vehicles. - Zhiye Li; Songshan Guo; Fan Wang 003; Andrew Lim 001 (IEA/AIE, 2004)

Heuristics for a Brokering Set Packing Problem. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (AI&M, 2004)

A Simple Yet Effective Framework for Optimization Problems. - Gaofeng Huang; Andrew Lim 001 (AI&M, 2004)

Crane Scheduling with Spatial Constraints: Mathematical Models and Solving Approaches. - Yi Zhu 007; Andrew Lim 001 (AI&M, 2004)

Approximation Schemes for the Crane Scheduling Problem. - Andrew Lim 001; Brian Rodrigues; Zhou Xu 001 (SWAT, 2004)

The Bottleneck Problem with Minimum Quantity Commitments. - Andrew Lim 001; Zhou Xu 001 (SWAT, 2004)

A Hybrid Framework for Over-Constrained Generalized. - Andrew Lim 001; Brian Rodrigues; Ramesh Thangarajo; Fei Xiao 001 (Artif. Intell. Rev., 2004)

Minimizing total flow time in single machine environment with release time: an experimental analysis. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Shanhu Yu (Comput. Ind. Eng., 2004)

The Two-Dimensional Packing Problem for Irregular Objects. - Ping Chen; Zhaohui Fu; Andrew Lim 001; Brian Rodrigues (Int. J. Artif. Intell. Tools, 2004)

A genetic algorithm for machine scheduling problem under shared resource constraints. - Yanzhi Li; Fan Wang 003; Andrew Lim 001 (Int. J. Comput. Appl. Technol., 2004)

New heuristics for over-constrained flight to gate assignments. - H. Ding; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (J. Oper. Res. Soc., 2004)

Crossdocking - JIT scheduling with time windows. - Yanzhi Li; Andrew Lim 001; Brian Rodrigues (J. Oper. Res. Soc., 2004)

Manpower allocation with time windows. - Andrew Lim 001; Brian Rodrigues; L. Song (J. Oper. Res. Soc., 2004)

Metaheuristics with Local Search Techniques for Retail Shelf-Space Optimization. - Andrew Lim 001; Brian Rodrigues; Xingwen Zhang (Manag. Sci., 2004)

Port yard storage optimization. - Ping Chen; Zhaohui Fu; Andrew Lim 001; Brian Rodrigues (IEEE Trans Autom. Sci. Eng., 2004)

A Multi-exchange Heuristic for a Production Location Problem. - Yunsong Guo; Yanzhi Li; Andrew Lim 001; Brian Rodrigues (Australian Conference on Artificial Intelligence, 2005)

A Lagrangian Relaxation Based Heuristic for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem. - Yanzhi Li; Andrew Lim 001; Hong Ma (Australian Conference on Artificial Intelligence, 2005)

A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions. - Andrew Lim 001; Jiqing Tang (Australian Conference on Artificial Intelligence, 2005)

A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (HICSS, 2005)

Robust Graph Coloring for Uncertain Supply Chain Management. - Andrew Lim 001; Fan Wang 003 (HICSS, 2005)

A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles. - Andrew Lim 001; Xingwen Zhang (HICSS, 2005)

A Very Large-Scale Neighborhood Search Approach to Capacitated Warehouse Routing Problem. - Yue Geng; Yanzhi Li; Andrew Lim 001 (ICTAI, 2005)

Robust Airport Gate Assignment. - Andrew Lim 001; Fan Wang 003 (ICTAI, 2005)

The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (ISAAC, 2005)

The shortest route cut and fill problem in linear topological structure. - Songshan Guo; Weixing Li; Andrew Lim 001; Fan Wang 003 (SAC, 2005)

The container loading problem. - Andrew Lim 001; Xingwen Zhang (SAC, 2005)

Heuristic methods for graph coloring problems. - Andrew Lim 001; Yi Zhu 007; Q. Lou; Brian Rodrigues (SAC, 2005)

A tabu search algorithm for the safe transportation of hazardous materials. - L. Zhang; Songshan Guo; Yunsong Zhu; Andrew Lim 001 (SAC, 2005)

Airport Gate Scheduling with Time Windows. - Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (Artif. Intell. Rev., 2005)

3-D Container Packing Heuristics. - Andrew Lim 001; Brian Rodrigues; Y. Yang (Appl. Intell., 2005)

The over-constrained airport gate assignment problem. - H. Ding; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (Comput. Oper. Res., 2005)

A Note on the Optimal EOQ for Announced Price Increases in the Infinite Horizon. - Andrew Lim 001; Brian Rodrigues (Oper. Res., 2005)

Tabu search embedded simulated annealing for the shortest route cut and fill problem. - Andrew Lim 001; Brian Rodrigues; J. Zhang (J. Oper. Res. Soc., 2005)

Multi-depot vehicle routing problem: a one-stage approach. - Andrew Lim 001; Fan Wang 003 (IEEE Trans Autom. Sci. Eng., 2005)

k-Center problems with minimum coverage. - Andrew Lim 001; Brian Rodrigues; Fan Wang 003; Zhou Xu 001 (Theor. Comput. Sci., 2005)

TPBOSCourier: A Transportation Procurement System (for the Procurement of Courier Services). - Andrew Lim 001; Zhou Xu 001; Brenda Cheang; Wee-Kit Ho; Steve Au-yeung (AAAI, 2006)

Truck Dock Assignment Problem with Time Windows and Capacity Constraint in Transshipment Network Through Crossdocks. - Andrew Lim 001; Hong Ma; Zhaowei Miao (ICCSA (3), 2006)

A Hybrid Genetic Algorithm for Solving the Length-Balanced Two Arc-Disjoint Shortest Paths Problem. - Yanzhi Li; Andrew Lim 001; Hong Ma (IEA/AIE, 2006)

Reducing Transportation Costs in Distribution Networks. - Xi Li; Andrew Lim 001; Zhaowei Miao; Brian Rodrigues (IEA/AIE, 2006)

A Fast and Effective Insertion Algorithm for Multi-depot Vehicle Routing Problem with Fixed Distribution of Vehicles and a New Simulated Annealing Approach. - Andrew Lim 001; Wenbin Zhu (IEA/AIE, 2006)

A Robust RFID-Based Method for Precise Indoor Positioning. - Andrew Lim 001; Kaicheng Zhang (IEA/AIE, 2006)

An Efficient Shortest Path Computation System for Real Road Networks. - Zhenyu Wang; Oscar Che; Lijuan Chen; Andrew Lim 001 (IEA/AIE, 2006)

Tabu Search for Generalized Minimum Spanning Tree Problem. - Zhenyu Wang; Chan Che; Andrew Lim 001 (PRICAI, 2006)

Ant colony optimization with hill climbing for the bandwidth minimization problem. - Andrew Lim 001; Jing Lin; Brian Rodrigues; Fei Xiao 001 (Appl. Soft Comput., 2006)

Multiple crossdocks with inventory and time windows. - Ping Chen; Yunsong Guo; Andrew Lim 001; Brian Rodrigues (Comput. Oper. Res., 2006)

Heuristics for a bidding problem. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (Comput. Oper. Res., 2006)

Indexing graph-structured XML data for efficient structural join operation. - Qun Chen; Andrew Lim 001; Kian Win Ong; Jiqing Tang (Data Knowl. Eng., 2006)

Indexing XML documents for XPath query processing in external memory. - Qun Chen; Andrew Lim 001; Kian Win Ong; Jiqing Tang (Data Knowl. Eng., 2006)

A hybrid genetic algorithm for the Three-Index Assignment Problem. - Gaofeng Huang; Andrew Lim 001 (Eur. J. Oper. Res., 2006)

Heuristics for matrix bandwidth reduction. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001 (Eur. J. Oper. Res., 2006)

A simulated annealing and hill-climbing algorithm for the traveling tournament problem. - Andrew Lim 001; Brian Rodrigues; X. Zhang (Eur. J. Oper. Res., 2006)

Scheduling sports competitions at multiple venues - Revisited. - Andrew Lim 001; Brian Rodrigues; X. Zhang (Eur. J. Oper. Res., 2006)

A critical-shaking neighborhood search for the yard allocation problem. - Andrew Lim 001; Zhou Xu 001 (Eur. J. Oper. Res., 2006)

Using a Lagrangian Heuristic for a Combinatorial Auction Problem. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Jiqing Tang (Int. J. Artif. Intell. Tools, 2006)

Carrier assignment models in transportation procurement. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Yi Zhu 007 (J. Oper. Res. Soc., 2006)

Crane scheduling with non-crossing constraint. - Yi Zhu 007; Andrew Lim 001 (J. Oper. Res. Soc., 2006)

The one-commodity pickup and delivery travelling salesman problem on a path or a tree. - Fan Wang 003; Andrew Lim 001; Zhou Xu 001 (Networks, 2006)

Two-machine flow shop problems with a single server. - Andrew Lim 001; Brian Rodrigues; Caixia Wang (J. Sched., 2006)

A Transportation Problem with Minimum Quantity Commitment. - Andrew Lim 001; Fan Wang 003; Zhou Xu 001 (Transp. Sci., 2006)

Journal-Ranking.com: An Online Interactive Journal Ranking System. - Andrew Lim 001; Hong Ma; Qi Wen 003; Zhou Xu 001; Brenda Cheang; Bernard C. Y. Tan; Wenbin Zhu (AAAI, 2007)

Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem. - Andrew Lim 001; Jing Lin; Fei Xiao 001 (Appl. Intell., 2007)

A local search using solution fragments for the 2-machine bicriteria scheduling problem. - Gaofeng Huang; Andrew Lim 001; Brian Rodrigues (Comput. Optim. Appl., 2007)

A stochastic beam search for the berth allocation problem. - Fan Wang 003; Andrew Lim 001 (Decis. Support Syst., 2007)

Minimizing the makespan for Unrelated Parallel Machines. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Liang Yang (Int. J. Artif. Intell. Tools, 2007)

A Fast Algorithm for Bandwidth Minimization. - Andrew Lim 001; Brian Rodrigues; Fei Xiao 001 (Int. J. Artif. Intell. Tools, 2007)

A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows. - Andrew Lim 001; Xingwen Zhang (INFORMS J. Comput., 2007)

Port space allocation with a time dimension. - Zhaohui Fu; Yanzhi Li; Andrew Lim 001; Brian Rodrigues (J. Oper. Res. Soc., 2007)

Machine scheduling performance with maintenance and failure. - Yunsong Guo; Andrew Lim 001; Brian Rodrigues; Shanhu Yu (Math. Comput. Model., 2007)

A Vehicle Routing System to Solve a Periodic Vehicle Routing Problem for a Food Chain in Hong Kong. - Jianfeng Zhu; Wenbin Zhu; Chan Hou Che; Andrew Lim 001 (AAAI, 2008)

Random Move Tabu Search for Freight Proportion Allocation Problem. - Andrew Lim 001; Hu Qin; Jing Xu; Zhou Xu 001 (ICTAI (2), 2008)

Enabling structural summaries for efficient update and workload adaptation. - Qun Chen; Andrew Lim 001; Kian Win Ong (Data Knowl. Eng., 2008)

Tariff concessions in production sourcing. - Yunsong Guo; Yanzhi Li; Andrew Lim 001; Brian Rodrigues (Eur. J. Oper. Res., 2008)

Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees. - Andrew Lim 001; Brian Rodrigues; Zhou Xu 001 (Oper. Res., 2008)

The bidding selection and assignment problem with minimum quantity commitment. - Andrew Lim 001; Zhou Xu 001; Fan Wang 003 (J. Oper. Res. Soc., 2008)

Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem. - Fan Wang 003; Andrew Lim 001 (IEEE Trans Autom. Sci. Eng., 2008)

Balancing Workload in Project Assignment. - Zhirong Liang; Songshan Guo; Yanzhi Li; Andrew Lim 001 (Australasian Conference on Artificial Intelligence, 2009)

Using AI to Solve Inspection Scheduling Problem for a Buying Office. - Xianhao Zhou; Songshan Guo; Chan Hou Che; Brenda Cheang; Andrew Lim 001; Hubert Kreuter; Janet Chow (IAAI, 2009)

Distinguishing citation quality for journal impact assessment. - Andrew Lim 001; Hong Ma; Qi Wen 003; Zhou Xu 001; Brenda Cheang (Commun. ACM, 2009)

Truck dock assignment problem with operational time constraint within crossdocks. - Zhaowei Miao; Andrew Lim 001; Hong Ma (Eur. J. Oper. Res., 2009)

Searching optimal resequencing and feature assignment on an automated assembly line. - Andrew Lim 001; Zhou Xu 001 (J. Oper. Res. Soc., 2009)

Note - Pricing and Inventory Control for a Perishable Product. - Yanzhi Li; Andrew Lim 001; Brian Rodrigues (Manuf. Serv. Oper. Manag., 2009)

The Tree Representation of Feasible Solutions for the TSP with Pickup and Delivery and LIFO Loading. - Dejian Tu; Songshan Guo; Hu Qin; Wee-Chong Oon; Andrew Lim 001 (AAAI, 2010)

An Investigation of IDA* Algorithms for the Container Relocation Problem. - Huidong Zhang; Songshan Guo; Wenbin Zhu; Andrew Lim 001; Brenda Cheang (IEA/AIE (1), 2010)

Branch and Bound Algorithm for a Single Vehicle Routing Problem with Toll-by-Weight Scheme. - Zizhen Zhang; Hu Qin; Andrew Lim 001; Songshan Guo (IEA/AIE (3), 2010)

A p-Robust Capacitated Network Design Model with Facility Disruptions. - Zuli Liu; Songshan Guo; Lawrence V. Snyder; Andrew Lim 001; Peng Peng (Heinz Nixdorf Symposium, 2010)

Balanced Student Partitioning to Promote Effective Learning: Applications in an International School. - Wenbin Zhu; Hu Qin; Andrew Lim 001; Zhou Xu 001 (PKAW, 2010)

Two Natural Heuristics for 3D Packing with Practical Loading Constraints. - Lei Wang; Songshan Guo; Shi Chen; Wenbin Zhu; Andrew Lim 001 (PRICAI, 2010)

Load balancing in project assignment. - Zhirong Liang; Yanzhi Li; Andrew Lim 001; Songshan Guo (Comput. Oper. Res., 2010)

A memetic algorithm for solving multiperiod vehicle routing problem with profit. - Chan Hou Che; Zizhen Zhang; Andrew Lim 001 (GECCO (Companion), 2011)

A genetic algorithm for the freight consolidation problem with one-dimensional container loading. - Zizhen Zhang; Hu Qin; Andrew Lim 001 (GECCO, 2011)

A Heuristic for the Multiple Container Loading Cost Minimization Problem. - Chan Hou Che; Weili Huang; Andrew Lim 001; Wenbin Zhu (IEA/AIE (2), 2011)

A Greedy Heuristic for Airline Crew Rostering: Unique Challenges in a Large Airline in China. - Qiao Chen; Andrew Lim 001; Wenbin Zhu (IEA/AIE (2), 2011)

An Algorithm for the Freight Allocation Problem with All-Units Quantity-Based Discount. - Xiang Gao; Andrew Lim 001; Wee-Chong Oon; Hu Qin (IEA/AIE (2), 2011)

Multiple Pickup and Delivery TSP with LIFO and Distance Constraints: A VNS Approach. - Xiang Gao; Andrew Lim 001; Hu Qin; Wenbin Zhu (IEA/AIE (2), 2011)

A Skyline-Based Heuristic for the 2D Rectangular Strip Packing Problem. - Lijun Wei; Andrew Lim 001; Wenbin Zhu (IEA/AIE (2), 2011)

Optimal Algorithms for Two-Dimensional Box Placement Problems. - Wenbin Zhu; Wee-Chong Oon; Yujian Weng; Andrew Lim 001 (IEA/AIE (2), 2011)

Space Defragmentation Heuristic for 2D and 3D Bin Packing Problems. - Zhaoyi Zhang; Songshan Guo; Wenbin Zhu; Wee-Chong Oon; Andrew Lim 001 (IJCAI, 2011)

New concepts for activity float in resource-constrained project management. - Andrew Lim 001; Hong Ma; Brian Rodrigues; Sun Teck Tan; Fei Xiao 001 (Comput. Oper. Res., 2011)

The multiple container loading cost minimization problem. - Chan Hou Che; Weili Huang; Andrew Lim 001; Wenbin Zhu (Eur. J. Oper. Res., 2011)

The tree representation for the pickup and delivery traveling salesman problem with LIFO loading. - Yongquan Li; Andrew Lim 001; Wee-Chong Oon; Hu Qin; Dejian Tu (Eur. J. Oper. Res., 2011)

A skyline heuristic for the 2D rectangular packing and strip packing problems. - Lijun Wei; Wee-Chong Oon; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2011)

Evaluating OR/MS Journals via PageRank. - Zhou Xu 001; Brenda Cheang; Andrew Lim 001; Qi Wen 003 (Interfaces, 2011)

The six elements to block-building approaches for the single container loading problem. - Wenbin Zhu; Wee-Chong Oon; Andrew Lim 001; Yujian Weng (Appl. Intell., 2012)

A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. - Wenbin Zhu; Hu Qin; Andrew Lim 001; Lei Wang (Comput. Oper. Res., 2012)

Arboricity: An acyclic hypergraph decomposition problem motivated by database theory. - Yeow Meng Chee; Lijun Ji; Andrew Lim 001; Anthony K. H. Tung (Discret. Appl. Math., 2012)

Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. - Brenda Cheang; Xiang Gao; Andrew Lim 001; Hu Qin; Wenbin Zhu (Eur. J. Oper. Res., 2012)

The freight allocation problem with lane cost balancing constraint. - Andrew Lim 001; Hu Qin; Zhou Xu 001 (Eur. J. Oper. Res., 2012)

A reference length approach for the 3D strip packing problem. - Lijun Wei; Wee-Chong Oon; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach. - Zizhen Zhang; Hu Qin; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

A prototype column generation strategy for the multiple container loading problem. - Wenbin Zhu; Weili Huang; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem. - Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

Space defragmentation for packing problems. - Wenbin Zhu; Zhaoyi Zhang; Wee-Chong Oon; Andrew Lim 001 (Eur. J. Oper. Res., 2012)

An iterated construction approach with dynamic prioritization for solving the container loading problems. - Andrew Lim 001; Hong Ma; Jing Xu; Xingwen Zhang (Expert Syst. Appl., 2012)

Example-based learning particle swarm optimization for continuous optimization. - Han Huang 002; Hu Qin; Zhifeng Hao; Andrew Lim 001 (Inf. Sci., 2012)

Iterative Deepening A* Algorithms for the Container Relocation Problem. - Wenbin Zhu; Hu Qin; Andrew Lim 001; Huidong Zhang (IEEE Trans Autom. Sci. Eng., 2012)

A Morphology-Based Border Noise Removal Method for Camera-Captured Label Images. - Mengyang Liu; Chongshou Li; Wenbin Zhu; Andrew Lim 001 (CBDAR, 2013)

The Two-Dimensional Vector Packing Problem with Courier Cost Structure. - Qian Hu; Andrew Lim 001; Wenbin Zhu (IEA/AIE, 2013)

A Greedy Look-Ahead Heuristic for the Container Relocation Problem. - Bo Jin 002; Andrew Lim 001; Wenbin Zhu (IEA/AIE, 2013)

A Bidirectional Building Approach for the 2D Guillotine Knapsack Packing Problem. - Lijun Wei; Andrew Lim 001; Wenbin Zhu (IEA/AIE, 2013)

A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with TimeWindows and Job-Teaming Constraints. - Yilin Cai; Zizhen Zhang; Songshan Guo; Hu Qin; Andrew Lim 001 (IJCAI, 2013)

Shanghai Stock Exchange Composite Index Forecasting Based on Microblogging. - Yibo Chen; Tao Yan; Andrew Lim 001; Wenbin Zhu (ICDM (Workshops), 2013)

An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem. - Zhixing Luo; Brenda Cheang; Andrew Lim 001; Wenbin Zhu (Eur. J. Oper. Res., 2013)

A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. - Lijun Wei; Wee-Chong Oon; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2013)

A memetic algorithm for the multiperiod vehicle routing problem with profit. - Zizhen Zhang; Oscar Che; Brenda Cheang; Andrew Lim 001; Hu Qin (Eur. J. Oper. Res., 2013)

An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints. - Lijun Wei; Zhenzhen Zhang; Andrew Lim 001 (ICNC, 2014)

A Branch-and-Bound Algorithm for the Talent Scheduling Problem. - Xiaocong Liang; Zizhen Zhang; Hu Qin; Songshan Guo; Andrew Lim 001 (IEA/AIE (1), 2014)

The Stowage Stack Minimization Problem with Zero Rehandle Constraint. - Ning Wang; Zizhen Zhang; Andrew Lim 001 (IEA/AIE (2), 2014)

The Multi-period Profit Collection Vehicle Routing Problem with Time Windows. - Yubin Xie; Zizhen Zhang; Hu Qin; Songshan Guo; Andrew Lim 001 (IEA/AIE (2), 2014)

A memetic algorithm for the capacitated m-ring-star problem. - Zizhen Zhang; Hu Qin; Andrew Lim 001 (Appl. Intell., 2014)

Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost. - Zhixing Luo; Hu Qin; Wenbin Zhu; Andrew Lim 001 (CoRR, 2014)

A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem. - Hu Qin; Zizhen Zhang; Yubin Xie; Andrew Lim 001 (CoRR, 2014)

An iterative three-component heuristic for the team orienteering problem with time windows. - Qian Hu; Andrew Lim 001 (Eur. J. Oper. Res., 2014)

Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. - Zhixing Luo; Hu Qin; Andrew Lim 001 (Eur. J. Oper. Res., 2014)

The freight consolidation and containerization problem. - Hu Qin; Zizhen Zhang; Zhuxuan Qi; Andrew Lim 001 (Eur. J. Oper. Res., 2014)

A block-based layer building approach for the 2D guillotine strip packing problem. - Lijun Wei; Tian Tian 003; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2014)

A multidimensional approach to evaluating management journals: Refining pagerank via the differentiation of citation types and identifying the roles that management journals play. - Brenda Cheang; Samuel Kai-Wah Chu; Chongshou Li; Andrew Lim 001 (J. Assoc. Inf. Sci. Technol., 2014)

An evolutionary algorithm based on constraint set partitioning for nurse rostering problems. - Han Huang 002; Weijia Lin; Zhiyong Lin; Zhifeng Hao; Andrew Lim 001 (Neural Comput. Appl., 2014)

An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. - Zhou Xu 001; Xiaofan Lai; Andrew Lim 001; Fan Wang 003 (Networks, 2014)

OR/MS journals evaluation based on a refined PageRank method: an updated and more comprehensive review. - Brenda Cheang; Samuel Kai-Wah Chu; Chongshou Li; Andrew Lim 001 (Scientometrics, 2014)

A tabu search algorithm for the multi-period inspector scheduling problem. - Hu Qin; Wei Ming; Zizhen Zhang; Yubin Xie; Andrew Lim 001 (Comput. Oper. Res., 2015)

Solving the container relocation problem by an improved greedy look-ahead heuristic. - Bo Jin 002; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

Identifying future defaulters: A hierarchical Bayesian method. - Fan Liu; Zhongsheng Hua; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

On service consistency in multi-period vehicle routing. - Zhixing Luo; Hu Qin; Chan Hou Che; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

A bidirectional building approach for the 2D constrained guillotine knapsack packing problem. - Lijun Wei; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem. - Lijun Wei; Wenbin Zhu; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. - Lijun Wei; Zhenzhen Zhang; Defu Zhang; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

Two exact algorithms for the traveling umpire problem. - Li Xue; Zhixing Luo; Andrew Lim 001 (Eur. J. Oper. Res., 2015)

Identifying patterns and structural influences in the scientific communication of business knowledge. - Brenda Cheang; Chongshou Li; Andrew Lim 001; Zhenzhen Zhang (Scientometrics, 2015)

A fast implementation for the 2D/3D box placement problem. - Wenbin Zhu; Zhixing Luo; Andrew Lim 001; Wee-Chong Oon (Comput. Optim. Appl., 2016)

An enhanced branch-and-bound algorithm for the talent scheduling problem. - Hu Qin; Zizhen Zhang; Andrew Lim 001; Xiaocong Liang (Eur. J. Oper. Res., 2016)

The multiple container loading problem with preference. - Tian Tian 003; Wenbin Zhu; Andrew Lim 001; Lijun Wei (Eur. J. Oper. Res., 2016)

Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. - Roberto Baldacci; Alessandro Hill; Edna Ayako Hoshino; Andrew Lim 001 (Eur. J. Oper. Res., 2017)

A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. - Qian Hu; Wenbin Zhu; Hu Qin; Andrew Lim 001 (Eur. J. Oper. Res., 2017)

A feasibility-based heuristic for the container pre-marshalling problem. - Ning Wang; Bo Jin 002; Zizhen Zhang; Andrew Lim 001 (Eur. J. Oper. Res., 2017)

Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals. - Andrew Lim 001; Zhenzhen Zhang; Hu Qin (Transp. Sci., 2017)

Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost. - Zhixing Luo; Hu Qin; Wenbin Zhu; Andrew Lim 001 (Transp. Sci., 2017)

The Single Polybag Loading Problem. - Yuxin Che; Ying Liu 068; Qiang Gao; Andrew Lim 001; Qian Hu (Electron. Notes Discret. Math., 2018)

A greedy aggregation-decomposition method for intermittent demand forecasting in fashion retailing. - Chongshou Li; Andrew Lim 001 (Eur. J. Oper. Res., 2018)

A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. - Tian Liu; Zhixing Luo; Hu Qin; Andrew Lim 001 (Eur. J. Oper. Res., 2018)

A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine. - Ting Wang 024; Roberto Baldacci; Andrew Lim 001; Qian Hu (Eur. J. Oper. Res., 2018)

A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem. - Lijun Wei; Qian Hu; Andrew Lim 001; Qiang Liu 031 (Eur. J. Oper. Res., 2018)

Efficient Approximation Algorithms for Adaptive Seed Minimization. - Jing Tang 004; Keke Huang; Xiaokui Xiao; Laks V. S. Lakshmanan; Xueyan Tang; Aixin Sun; Andrew Lim 001 (SIGMOD Conference, 2019)

Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. - Zhenzhen Zhang; Brenda Cheang; Chongshou Li; Andrew Lim 001 (Comput. Oper. Res., 2019)

Why Are the ARIMA and SARIMA not Sufficient. - Shixiong Wang; Chongshou Li; Andrew Lim 001 (CoRR, 2019)

Online Non-stationary Time Series Analysis and Processing. - Shixiong Wang; Chongshou Li; Andrew Lim 001 (CoRR, 2019)

Learning Improvement Heuristics for Solving the Travelling Salesman Problem. - Yaoxin Wu; Wen Song; Zhiguang Cao; Jie Zhang 002; Andrew Lim 001 (CoRR, 2019)

Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems. - Wen Song; Zhiguang Cao; Jie Zhang 002; Andrew Lim 001 (CoRR, 2019)

Textual Sentiment of Chinese Microblog Toward the Stock Market. - Ning Wang; Shanhui Ke; Yibo Chen; Tao Yan; Andrew Lim 001 (Int. J. Inf. Technol. Decis. Mak., 2019)

Optimal joint estimation and identification theorem to linear Gaussian system with unknown inputs. - Shixiong Wang; Chongshou Li; Andrew Lim 001 (Signal Process., 2019)

A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation. - Zhixing Luo; Mengyang Liu; Andrew Lim 001 (Transp. Sci., 2019)

Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction. - Zhenzhen Zhang; Zhixing Luo; Hu Qin; Andrew Lim 001 (Transp. Sci., 2019)

On Isometry Robustness of Deep 3D Point Cloud Models Under Adversarial Attacks. - Yue Zhao; Yuwei Wu 002; Caihua Chen; Andrew Lim 001 (CVPR, 2020)

Efficient Approximation Algorithms for Adaptive Target Profit Maximization. - Keke Huang; Jing Tang 004; Xiaokui Xiao; Aixin Sun; Andrew Lim 001 (ICDE, 2020)

Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene. - Xinke Li; Chongshou Li; Zekun Tong; Andrew Lim 001; Junsong Yuan 001; Yuwei Wu 002; Jing Tang 004; Raymond Huang (ACM Multimedia, 2020)

Digraph Inception Convolutional Networks. - Zekun Tong; Yuxuan Liang; Changsheng Sun; Xinke Li; David S. Rosenblum; Andrew Lim 001 (NeurIPS, 2020)

An integrated route, temperature and humidity planning problem for the distribution of perishable products. - Yijing Liang; Fan Liu; Andrew Lim 001; Dezhi Zhang (Comput. Ind. Eng., 2020)

Directed Graph Convolutional Network. - Zekun Tong; Yuxuan Liang; Changsheng Sun; David S. Rosenblum; Andrew Lim 001 (CoRR, 2020)

A branch-and-price algorithm for the two-dimensional vector packing problem. - Lijun Wei; Minghui Lai; Andrew Lim 001; Qian Hu (Eur. J. Oper. Res., 2020)

A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. - Lijun Wei; Zhixing Luo; Roberto Baldacci; Andrew Lim 001 (INFORMS J. Comput., 2020)

Optimal pricing decisions for an omni-channel supply chain with retail service. - Yuqing Jiang; Liping Liu; Andrew Lim 001 (Int. Trans. Oper. Res., 2020)

Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. - Roberto Baldacci; Andrew Lim 001; Emiliano Traversi; Roberto Wolfler Calvo (Transp. Sci., 2020)

Efficient approximation algorithms for adaptive influence maximization. - Keke Huang; Jing Tang 004; Kai Han 003; Xiaokui Xiao; Wei Chen 013; Aixin Sun; Xueyan Tang; Andrew Lim 001 (VLDB J., 2020)

PointBA: Towards Backdoor Attacks in 3D Point Cloud. - Xinke Li; Zhirui Chen; Yue Zhao; Zekun Tong; Yabang Zhao; Andrew Lim 001; Joey Tianyi Zhou (ICCV, 2021)

Reproducibility Companion Paper: Campus3D: A Photogrammetry Point Cloud Benchmark for Outdoor Scene Hierarchical Understanding. - Yuqing Liao; Xinke Li; Zekun Tong; Yabang Zhao; Andrew Lim 001; Zhenzhong Kuang; Cise Midoglu (ACM Multimedia, 2021)

Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives. - Yuming Huang; Jing Tang 004; Qianhao Cong; Andrew Lim 001; Jianliang Xu (SIGMOD Conference, 2021)

Lower bounds and heuristics for the unit-capacity resource constrained project scheduling problem with transfer times. - Ying Liu 068; Jing Zhou; Andrew Lim 001; Qian Hu (Comput. Ind. Eng., 2021)

Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing. - Yuxin Che; Kanxin Hu; Zhenzhen Zhang; Andrew Lim 001 (Comput. Oper. Res., 2021)

A hybrid algorithm for time-dependent vehicle routing problem with time windows. - Binbin Pan; Zhenzhen Zhang; Andrew Lim 001 (Comput. Oper. Res., 2021)

Multi-trip time-dependent vehicle routing problem with time windows. - Binbin Pan; Zhenzhen Zhang; Andrew Lim 001 (Eur. J. Oper. Res., 2021)

An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability. - Defeng Sun; Lixin Tang; Roberto Baldacci; Andrew Lim 001 (Eur. J. Oper. Res., 2021)

A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. - Zhixing Luo; Hu Qin; T. C. E. Cheng; Qinghua Wu 002; Andrew Lim 001 (INFORMS J. Comput., 2021)

Robust Data-Driven Vehicle Routing with Time Windows. - Yu Zhang 073; Zhenzhen Zhang; Andrew Lim 001; Melvyn Sim (Oper. Res., 2021)

Accurate Tracking, Collision Detection, and Optimal Scheduling of Airport Ground Support Equipment. - Shixiong Wang; Yuxin Che; Huangjie Zhao; Andrew Lim 001 (IEEE Internet Things J., 2021)

Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. - Zhongming Wu; Chongshou Li; Min Li; Andrew Lim 001 (J. Glob. Optim., 2021)

Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. - Jing Tang 004; Xueyan Tang; Andrew Lim 001; Kai Han 003; Chongshou Li; Junsong Yuan 001 (Proc. ACM Meas. Anal. Comput. Syst., 2021)

A Model for Non-Stationary Time Series and its Applications in Filtering and Anomaly Detection. - Shixiong Wang; Chongshou Li; Andrew Lim 001 (IEEE Trans. Instrum. Meas., 2021)

Denoising, Outlier/Dropout Correction, and Sensor Selection in Range-Based Positioning. - Shixiong Wang; Zhongming Wu; Andrew Lim 001 (IEEE Trans. Instrum. Meas., 2021)

An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting. - Chongshou Li; Brenda Cheang; Zhixing Luo; Andrew Lim 001 (ACM Trans. Knowl. Discov. Data, 2021)

A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy. - Zhenzhen Zhang; Zhixing Luo; Roberto Baldacci; Andrew Lim 001 (Transp. Sci., 2021)

Robust State Estimation for Linear Systems Under Distributional Uncertainty. - Shixiong Wang; Zhongming Wu; Andrew Lim 001 (IEEE Trans. Signal Process., 2021)

A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips. - Zhihao Luo; Ruixue Gu; Mark Poon; Zhong Liu 002; Andrew Lim 001 (Comput. Oper. Res., 2022)

Learning variable ordering heuristics for solving Constraint Satisfaction Problems. - Wen Song; Zhiguang Cao; Jie Zhang 002; Chi Xu; Andrew Lim 001 (Eng. Appl. Artif. Intell., 2022)

An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs. - Ting Wang 024; Qian Hu; Andrew Lim 001 (Eur. J. Oper. Res., 2022)

Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem. - Jingwen Li; Yining Ma 001; Ruize Gao; Zhiguang Cao; Andrew Lim 001; Wen Song; Jie Zhang 002 (IEEE Trans. Cybern., 2022)

Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learning. - Jingwen Li; Liang Xin; Zhiguang Cao; Andrew Lim 001; Wen Song; Jie Zhang 002 (IEEE Trans. Intell. Transp. Syst., 2022)

ROPHS: Determine Real-Time Status of a Multi-Carriage Logistics Train at Airport. - Shixiong Wang; Chongshou Li; Andrew Lim 001 (IEEE Trans. Intell. Transp. Syst., 2022)

Learning Improvement Heuristics for Solving Routing Problems. - Yaoxin Wu; Wen Song; Zhiguang Cao; Jie Zhang 002; Andrew Lim 001 (IEEE Trans. Neural Networks Learn. Syst., 2022)

A tree search heuristic for the resource constrained project scheduling problem with transfer times. - Ying Liu 068; Jing Zhou; Andrew Lim 001; Qian Hu (Eur. J. Oper. Res., 2023)

2-hop+ Sampling: Efficient and Effective Influence Estimation. - Yuqing Zhu 006; Jing Tang 004; Xueyan Tang; Sibo Wang 001; Andrew Lim 001 (IEEE Trans. Knowl. Data Eng., 2023)