default search action
Andrew Lim 0001
Person information
- affiliation (since 2016): National University of Singapore, Department of Industrial Systems Engineering and Management, Singapore
- affiliation (2009-2016): City University of Hong Kong, Department of Management Sciences, Hong Kong
- affiliation: Nanjing University, School of Management and Engineering, China
- affiliation (PhD 1992): University of Minnesota, Department of Computer Science, Minneapolis, MN, USA
Other persons with the same name
- Andrew Lim — disambiguation page
- Andrew Lim 0002 — University of Toronto, Institute of Biomaterials and Biomedical Engineering, ON, Canada
- Andrew Lim 0003 — Stanford University, CA, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j157]Ying Liu, Jing Zhou, Andrew Lim, Qian Hu:
A tree search heuristic for the resource constrained project scheduling problem with transfer times. Eur. J. Oper. Res. 304(3): 939-951 (2023) - [j156]Yuqing Zhu, Jing Tang, Xueyan Tang, Sibo Wang, Andrew Lim:
2-hop+ Sampling: Efficient and Effective Influence Estimation. IEEE Trans. Knowl. Data Eng. 35(2): 1088-1103 (2023) - 2022
- [j155]Zhihao Luo, Ruixue Gu, Mark Poon, Zhong Liu, Andrew Lim:
A last-mile drone-assisted one-to-one pickup and delivery problem with multi-visit drone trips. Comput. Oper. Res. 148: 106015 (2022) - [j154]Wen Song, Zhiguang Cao, Jie Zhang, Chi Xu, Andrew Lim:
Learning variable ordering heuristics for solving Constraint Satisfaction Problems. Eng. Appl. Artif. Intell. 109: 104603 (2022) - [j153]Ting Wang, Qian Hu, Andrew Lim:
An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs. Eur. J. Oper. Res. 300(1): 20-34 (2022) - [j152]Jingwen Li, Yining Ma, Ruize Gao, Zhiguang Cao, Andrew Lim, Wen Song, Jie Zhang:
Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem. IEEE Trans. Cybern. 52(12): 13572-13585 (2022) - [j151]Jingwen Li, Liang Xin, Zhiguang Cao, Andrew Lim, Wen Song, Jie Zhang:
Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learning. IEEE Trans. Intell. Transp. Syst. 23(3): 2306-2315 (2022) - [j150]Shixiong Wang, Chongshou Li, Andrew Lim:
ROPHS: Determine Real-Time Status of a Multi-Carriage Logistics Train at Airport. IEEE Trans. Intell. Transp. Syst. 23(7): 6347-6356 (2022) - [j149]Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim:
Learning Improvement Heuristics for Solving Routing Problems. IEEE Trans. Neural Networks Learn. Syst. 33(9): 5057-5069 (2022) - 2021
- [j148]Ying Liu, Jing Zhou, Andrew Lim, Qian Hu:
Lower bounds and heuristics for the unit-capacity resource constrained project scheduling problem with transfer times. Comput. Ind. Eng. 161: 107605 (2021) - [j147]Binbin Pan, Zhenzhen Zhang, Andrew Lim:
A hybrid algorithm for time-dependent vehicle routing problem with time windows. Comput. Oper. Res. 128: 105193 (2021) - [j146]Yuxin Che, Kanxin Hu, Zhenzhen Zhang, Andrew Lim:
Machine scheduling with orientation selection and two-dimensional packing for additive manufacturing. Comput. Oper. Res. 130: 105245 (2021) - [j145]Binbin Pan, Zhenzhen Zhang, Andrew Lim:
Multi-trip time-dependent vehicle routing problem with time windows. Eur. J. Oper. Res. 291(1): 218-231 (2021) - [j144]Defeng Sun, Lixin Tang, Roberto Baldacci, Andrew Lim:
An exact algorithm for the unidirectional quay crane scheduling problem with vessel stability. Eur. J. Oper. Res. 291(1): 271-283 (2021) - [j143]Zhixing Luo, Hu Qin, T. C. E. Cheng, Qinghua Wu, Andrew Lim:
A Branch-and-Price-and-Cut Algorithm for the Cable-Routing Problem in Solar Power Plants. INFORMS J. Comput. 33(2): 452-476 (2021) - [j142]Yu Zhang, Zhenzhen Zhang, Andrew Lim, Melvyn Sim:
Robust Data-Driven Vehicle Routing with Time Windows. Oper. Res. 69(2): 469-485 (2021) - [j141]Shixiong Wang, Yuxin Che, Huangjie Zhao, Andrew Lim:
Accurate Tracking, Collision Detection, and Optimal Scheduling of Airport Ground Support Equipment. IEEE Internet Things J. 8(1): 572-584 (2021) - [j140]Zhongming Wu, Chongshou Li, Min Li, Andrew Lim:
Inertial proximal gradient methods with Bregman regularization for a class of nonconvex optimization problems. J. Glob. Optim. 79(3): 617-644 (2021) - [j139]Jing Tang, Xueyan Tang, Andrew Lim, Kai Han, Chongshou Li, Junsong Yuan:
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. Proc. ACM Meas. Anal. Comput. Syst. 5(1): 08:1-08:22 (2021) - [j138]Shixiong Wang, Chongshou Li, Andrew Lim:
A Model for Non-Stationary Time Series and its Applications in Filtering and Anomaly Detection. IEEE Trans. Instrum. Meas. 70: 1-11 (2021) - [j137]Shixiong Wang, Zhongming Wu, Andrew Lim:
Denoising, Outlier/Dropout Correction, and Sensor Selection in Range-Based Positioning. IEEE Trans. Instrum. Meas. 70: 1-13 (2021) - [j136]Chongshou Li, Brenda Cheang, Zhixing Luo, Andrew Lim:
An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting. ACM Trans. Knowl. Discov. Data 15(2): 19:1-19:32 (2021) - [j135]Zhenzhen Zhang, Zhixing Luo, Roberto Baldacci, Andrew Lim:
A Benders Decomposition Approach for the Multivehicle Production Routing Problem with Order-up-to-Level Policy. Transp. Sci. 55(1): 160-178 (2021) - [j134]Shixiong Wang, Zhongming Wu, Andrew Lim:
Robust State Estimation for Linear Systems Under Distributional Uncertainty. IEEE Trans. Signal Process. 69: 5963-5978 (2021) - [c140]Xinke Li, Zhirui Chen, Yue Zhao, Zekun Tong, Yabang Zhao, Andrew Lim, Joey Tianyi Zhou:
PointBA: Towards Backdoor Attacks in 3D Point Cloud. ICCV 2021: 16472-16481 - [c139]Yuqing Liao, Xinke Li, Zekun Tong, Yabang Zhao, Andrew Lim, Zhenzhong Kuang, Cise Midoglu:
Reproducibility Companion Paper: Campus3D: A Photogrammetry Point Cloud Benchmark for Outdoor Scene Hierarchical Understanding. ACM Multimedia 2021: 3610-3614 - [c138]Jing Tang, Xueyan Tang, Andrew Lim, Kai Han, Chongshou Li, Junsong Yuan:
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. SIGMETRICS (Abstracts) 2021: 63-64 - [c137]Yuming Huang, Jing Tang, Qianhao Cong, Andrew Lim, Jianliang Xu:
Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives. SIGMOD Conference 2021: 790-803 - [i19]Yuming Huang, Jing Tang, Qianhao Cong, Andrew Lim, Jianliang Xu:
Do the Rich Get Richer? Fairness Analysis for Blockchain Incentives. CoRR abs/2103.14713 (2021) - [i18]Xinke Li, Zhirui Chen, Yue Zhao, Zekun Tong, Yabang Zhao, Andrew Lim, Joey Tianyi Zhou:
PointBA: Towards Backdoor Attacks in 3D Point Cloud. CoRR abs/2103.16074 (2021) - [i17]Jingwen Li, Yining Ma, Ruize Gao, Zhiguang Cao, Andrew Lim, Wen Song, Jie Zhang:
Deep Reinforcement Learning for Solving the Heterogeneous Capacitated Vehicle Routing Problem. CoRR abs/2110.02629 (2021) - [i16]Jingwen Li, Liang Xin, Zhiguang Cao, Andrew Lim, Wen Song, Jie Zhang:
Heterogeneous Attentions for Solving Pickup and Delivery Problem via Deep Reinforcement Learning. CoRR abs/2110.02634 (2021) - 2020
- [j133]Yijing Liang, Fan Liu, Andrew Lim, Dezhi Zhang:
An integrated route, temperature and humidity planning problem for the distribution of perishable products. Comput. Ind. Eng. 147: 106623 (2020) - [j132]Lijun Wei, Minghui Lai, Andrew Lim, Qian Hu:
A branch-and-price algorithm for the two-dimensional vector packing problem. Eur. J. Oper. Res. 281(1): 25-35 (2020) - [j131]Lijun Wei, Zhixing Luo, Roberto Baldacci, Andrew Lim:
A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems. INFORMS J. Comput. 32(2): 428-443 (2020) - [j130]Yuqing Jiang, Liping Liu, Andrew Lim:
Optimal pricing decisions for an omni-channel supply chain with retail service. Int. Trans. Oper. Res. 27(6): 2927-2948 (2020) - [j129]Roberto Baldacci, Andrew Lim, Emiliano Traversi, Roberto Wolfler Calvo:
Optimal Solution of Vehicle Routing Problems with Fractional Objective Function. Transp. Sci. 54(2): 434-452 (2020) - [j128]Keke Huang, Jing Tang, Kai Han, Xiaokui Xiao, Wei Chen, Aixin Sun, Xueyan Tang, Andrew Lim:
Efficient approximation algorithms for adaptive influence maximization. VLDB J. 29(6): 1385-1406 (2020) - [c136]Yue Zhao, Yuwei Wu, Caihua Chen, Andrew Lim:
On Isometry Robustness of Deep 3D Point Cloud Models Under Adversarial Attacks. CVPR 2020: 1198-1207 - [c135]Keke Huang, Jing Tang, Xiaokui Xiao, Aixin Sun, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Target Profit Maximization. ICDE 2020: 649-660 - [c134]Xinke Li, Chongshou Li, Zekun Tong, Andrew Lim, Junsong Yuan, Yuwei Wu, Jing Tang, Raymond Huang:
Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene. ACM Multimedia 2020: 238-246 - [c133]Zekun Tong, Yuxuan Liang, Changsheng Sun, Xinke Li, David S. Rosenblum, Andrew Lim:
Digraph Inception Convolutional Networks. NeurIPS 2020 - [i15]Yue Zhao, Yuwei Wu, Caihua Chen, Andrew Lim:
On Isometry Robustness of Deep 3D Point Cloud Models under Adversarial Attacks. CoRR abs/2002.12222 (2020) - [i14]Keke Huang, Jing Tang, Kai Han, Xiaokui Xiao, Wei Chen, Aixin Sun, Xueyan Tang, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Influence Maximization. CoRR abs/2004.06469 (2020) - [i13]Zekun Tong, Yuxuan Liang, Changsheng Sun, David S. Rosenblum, Andrew Lim:
Directed Graph Convolutional Network. CoRR abs/2004.13970 (2020) - [i12]Xinke Li, Chongshou Li, Zekun Tong, Andrew Lim, Junsong Yuan, Yuwei Wu, Jing Tang, Raymond Huang:
Campus3D: A Photogrammetry Point Cloud Benchmark for Hierarchical Understanding of Outdoor Scene. CoRR abs/2008.04968 (2020) - [i11]Jing Tang, Xueyan Tang, Andrew Lim, Kai Han, Chongshou Li, Junsong Yuan:
Revisiting Modified Greedy Algorithm for Monotone Submodular Maximization with a Knapsack Constraint. CoRR abs/2008.05391 (2020) - [i10]Chongshou Li, Brenda Cheang, Zhixing Luo, Andrew Lim:
An Exponential Factorization Machine with Percentage Error Minimization to Retail Sales Forecasting. CoRR abs/2009.10619 (2020)
2010 – 2019
- 2019
- [j127]Zhenzhen Zhang, Brenda Cheang, Chongshou Li, Andrew Lim:
Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. Comput. Oper. Res. 103: 81-96 (2019) - [j126]Ning Wang, Shanhui Ke, Yibo Chen, Tao Yan, Andrew Lim:
Textual Sentiment of Chinese Microblog Toward the Stock Market. Int. J. Inf. Technol. Decis. Mak. 18(2): 649-671 (2019) - [j125]Shixiong Wang, Chongshou Li, Andrew Lim:
Optimal joint estimation and identification theorem to linear Gaussian system with unknown inputs. Signal Process. 161: 268-288 (2019) - [j124]Zhixing Luo, Mengyang Liu, Andrew Lim:
A Two-Phase Branch-and-Price-and-Cut for a Dial-a-Ride Problem in Patient Transportation. Transp. Sci. 53(1): 113-130 (2019) - [j123]Zhenzhen Zhang, Zhixing Luo, Hu Qin, Andrew Lim:
Exact Algorithms for the Vehicle Routing Problem with Time Windows and Combinatorial Auction. Transp. Sci. 53(2): 427-441 (2019) - [c132]Jing Tang, Keke Huang, Xiaokui Xiao, Laks V. S. Lakshmanan, Xueyan Tang, Aixin Sun, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Seed Minimization. SIGMOD Conference 2019: 1096-1113 - [i9]Shixiong Wang, Chongshou Li, Andrew Lim:
Why Are the ARIMA and SARIMA not Sufficient. CoRR abs/1904.07632 (2019) - [i8]Shixiong Wang, Chongshou Li, Andrew Lim:
Online Non-stationary Time Series Analysis and Processing. CoRR abs/1904.09245 (2019) - [i7]Jing Tang, Keke Huang, Xiaokui Xiao, Laks V. S. Lakshmanan, Xueyan Tang, Aixin Sun, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Seed Minimization. CoRR abs/1907.09668 (2019) - [i6]Keke Huang, Jing Tang, Xiaokui Xiao, Aixin Sun, Andrew Lim:
Efficient Approximation Algorithms for Adaptive Target Profit Maximization. CoRR abs/1910.13073 (2019) - [i5]Yaoxin Wu, Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim:
Learning Improvement Heuristics for Solving the Travelling Salesman Problem. CoRR abs/1912.05784 (2019) - [i4]Wen Song, Zhiguang Cao, Jie Zhang, Andrew Lim:
Learning Variable Ordering Heuristics for Solving Constraint Satisfaction Problems. CoRR abs/1912.10762 (2019) - 2018
- [j122]Yuxin Che, Ying Liu, Qiang Gao, Andrew Lim, Qian Hu:
The Single Polybag Loading Problem. Electron. Notes Discret. Math. 69: 69-76 (2018) - [j121]Tian Liu, Zhixing Luo, Hu Qin, Andrew Lim:
A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints. Eur. J. Oper. Res. 266(2): 487-497 (2018) - [j120]Chongshou Li, Andrew Lim:
A greedy aggregation-decomposition method for intermittent demand forecasting in fashion retailing. Eur. J. Oper. Res. 269(3): 860-869 (2018) - [j119]Lijun Wei, Qian Hu, Andrew Lim, Qiang Liu:
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem. Eur. J. Oper. Res. 270(2): 448-474 (2018) - [j118]Ting Wang, Roberto Baldacci, Andrew Lim, Qian Hu:
A branch-and-price algorithm for scheduling of deteriorating jobs and flexible periodic maintenance on a single machine. Eur. J. Oper. Res. 271(3): 826-838 (2018) - 2017
- [j117]Ning Wang, Bo Jin, Zizhen Zhang, Andrew Lim:
A feasibility-based heuristic for the container pre-marshalling problem. Eur. J. Oper. Res. 256(1): 90-101 (2017) - [j116]Qian Hu, Wenbin Zhu, Hu Qin, Andrew Lim:
A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function. Eur. J. Oper. Res. 260(1): 70-80 (2017) - [j115]Roberto Baldacci, Alessandro Hill, Edna Ayako Hoshino, Andrew Lim:
Pricing strategies for capacitated ring-star problems based on dynamic programming algorithms. Eur. J. Oper. Res. 262(3): 879-893 (2017) - [j114]Zhixing Luo, Hu Qin, Wenbin Zhu, Andrew Lim:
Branch and Price and Cut for the Split-Delivery Vehicle Routing Problem with Time Windows and Linear Weight-Related Cost. Transp. Sci. 51(2): 668-687 (2017) - [j113]Andrew Lim, Zhenzhen Zhang, Hu Qin:
Pickup and Delivery Service with Manpower Planning in Hong Kong Public Hospitals. Transp. Sci. 51(2): 688-705 (2017) - 2016
- [j112]Wenbin Zhu, Zhixing Luo, Andrew Lim, Wee-Chong Oon:
A fast implementation for the 2D/3D box placement problem. Comput. Optim. Appl. 63(2): 585-612 (2016) - [j111]Tian Tian, Wenbin Zhu, Andrew Lim, Lijun Wei:
The multiple container loading problem with preference. Eur. J. Oper. Res. 248(1): 84-94 (2016) - [j110]Hu Qin, Zizhen Zhang, Andrew Lim, Xiaocong Liang:
An enhanced branch-and-bound algorithm for the talent scheduling problem. Eur. J. Oper. Res. 250(2): 412-426 (2016) - 2015
- [j109]Hu Qin, Wei Ming, Zizhen Zhang, Yubin Xie, Andrew Lim:
A tabu search algorithm for the multi-period inspector scheduling problem. Comput. Oper. Res. 59: 78-93 (2015) - [j108]Bo Jin, Wenbin Zhu, Andrew Lim:
Solving the container relocation problem by an improved greedy look-ahead heuristic. Eur. J. Oper. Res. 240(3): 837-847 (2015) - [j107]Lijun Wei, Wenbin Zhu, Andrew Lim:
A goal-driven prototype column generation strategy for the multiple container loading cost minimization problem. Eur. J. Oper. Res. 241(1): 39-49 (2015) - [j106]Fan Liu, Zhongsheng Hua, Andrew Lim:
Identifying future defaulters: A hierarchical Bayesian method. Eur. J. Oper. Res. 241(1): 202-211 (2015) - [j105]Lijun Wei, Andrew Lim:
A bidirectional building approach for the 2D constrained guillotine knapsack packing problem. Eur. J. Oper. Res. 242(1): 63-71 (2015) - [j104]Zhixing Luo, Hu Qin, Chan Hou Che, Andrew Lim:
On service consistency in multi-period vehicle routing. Eur. J. Oper. Res. 243(3): 731-744 (2015) - [j103]Lijun Wei, Zhenzhen Zhang, Defu Zhang, Andrew Lim:
A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints. Eur. J. Oper. Res. 243(3): 798-814 (2015) - [j102]Li Xue, Zhixing Luo, Andrew Lim:
Two exact algorithms for the traveling umpire problem. Eur. J. Oper. Res. 243(3): 932-943 (2015) - [j101]Brenda Cheang, Chongshou Li, Andrew Lim, Zhenzhen Zhang:
Identifying patterns and structural influences in the scientific communication of business knowledge. Scientometrics 103(1): 159-189 (2015) - 2014
- [j100]Zizhen Zhang, Hu Qin, Andrew Lim:
A memetic algorithm for the capacitated m-ring-star problem. Appl. Intell. 40(2): 305-321 (2014) - [j99]Qian Hu, Andrew Lim:
An iterative three-component heuristic for the team orienteering problem with time windows. Eur. J. Oper. Res. 232(2): 276-286 (2014) - [j98]Hu Qin, Zizhen Zhang, Zhuxuan Qi, Andrew Lim:
The freight consolidation and containerization problem. Eur. J. Oper. Res. 234(1): 37-48 (2014) - [j97]Zhixing Luo, Hu Qin, Andrew Lim:
Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints. Eur. J. Oper. Res. 234(1): 49-60 (2014) - [j96]Lijun Wei, Tian Tian, Wenbin Zhu, Andrew Lim:
A block-based layer building approach for the 2D guillotine strip packing problem. Eur. J. Oper. Res. 239(1): 58-69 (2014) - [j95]Brenda Cheang, Samuel Kai-Wah Chu, Chongshou Li, Andrew Lim:
A multidimensional approach to evaluating management journals: Refining pagerank via the differentiation of citation types and identifying the roles that management journals play. J. Assoc. Inf. Sci. Technol. 65(12): 2581-2591 (2014) - [j94]Han Huang, Weijia Lin, Zhiyong Lin, Zhifeng Hao, Andrew Lim:
An evolutionary algorithm based on constraint set partitioning for nurse rostering problems. Neural Comput. Appl. 25(3-4): 703-715 (2014) - [j93]Zhou Xu, Xiaofan Lai, Andrew Lim, Fan Wang:
An improved approximation algorithm for the capacitated TSP with pickup and delivery on a tree. Networks 63(2): 179-195 (2014) - [j92]Brenda Cheang, Samuel Kai-Wah Chu, Chongshou Li, Andrew Lim:
OR/MS journals evaluation based on a refined PageRank method: an updated and more comprehensive review. Scientometrics 100(2): 339-361 (2014) - [c131]Lijun Wei, Zhenzhen Zhang, Andrew Lim:
An evolutionary local search for the capacitated vehicle routing problem minimizing fuel consumption under three-dimensional loading constraints. ICNC 2014: 203-208 - [c130]Xiaocong Liang, Zizhen Zhang, Hu Qin, Songshan Guo, Andrew Lim:
A Branch-and-Bound Algorithm for the Talent Scheduling Problem. IEA/AIE (1) 2014: 208-217 - [c129]Ning Wang, Zizhen Zhang, Andrew Lim:
The Stowage Stack Minimization Problem with Zero Rehandle Constraint. IEA/AIE (2) 2014: 456-465 - [c128]Yubin Xie, Zizhen Zhang, Hu Qin, Songshan Guo, Andrew Lim:
The Multi-period Profit Collection Vehicle Routing Problem with Time Windows. IEA/AIE (2) 2014: 466-475 - [i3]Zizhen Zhang, Hu Qin, Xiaocong Liang, Andrew Lim:
An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem. CoRR abs/1401.5869 (2014) - [i2]Zhixing Luo, Hu Qin, Wenbin Zhu, Andrew Lim:
Branch-and-price-and-cut for the Split-collection Vehicle Routing Problem with Time Windows and Linear Weight-related Cost. CoRR abs/1401.6483 (2014) - [i1]Hu Qin, Zizhen Zhang, Yubin Xie, Andrew Lim:
A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem. CoRR abs/1409.5166 (2014) - 2013
- [j91]Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim:
A goal-driven approach to the 2D bin packing and variable-sized bin packing problems. Eur. J. Oper. Res. 224(1): 110-121 (2013) - [j90]Zizhen Zhang, Oscar Che, Brenda Cheang, Andrew Lim, Hu Qin:
A memetic algorithm for the multiperiod vehicle routing problem with profit. Eur. J. Oper. Res. 229(3): 573-584 (2013) - [j89]Zhixing Luo, Brenda Cheang, Andrew Lim, Wenbin Zhu:
An adaptive ejection pool with toggle-rule diversification approach for the capacitated team orienteering problem. Eur. J. Oper. Res. 229(3): 673-682 (2013) - [c127]Mengyang Liu, Chongshou Li, Wenbin Zhu, Andrew Lim:
A Morphology-Based Border Noise Removal Method for Camera-Captured Label Images. CBDAR 2013: 126-138 - [c126]Bo Jin, Andrew Lim, Wenbin Zhu:
A Greedy Look-Ahead Heuristic for the Container Relocation Problem. IEA/AIE 2013: 181-190 - [c125]Qian Hu, Andrew Lim, Wenbin Zhu:
The Two-Dimensional Vector Packing Problem with Courier Cost Structure. IEA/AIE 2013: 212-221 - [c124]Lijun Wei, Andrew Lim, Wenbin Zhu:
A Bidirectional Building Approach for the 2D Guillotine Knapsack Packing Problem. IEA/AIE 2013: 232-241 - [c123]Yilin Cai, Zizhen Zhang, Songshan Guo, Hu Qin, Andrew Lim:
A Tree-Based Tabu Search Algorithm for the Manpower Allocation Problem with TimeWindows and Job-Teaming Constraints. IJCAI 2013: 496-502 - [c122]Yibo Chen, Tao Yan, Andrew Lim, Wenbin Zhu:
Shanghai Stock Exchange Composite Index Forecasting Based on Microblogging. ICDM (Workshops) 2013: 16-30 - 2012
- [j88]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) - [j87]Wenbin Zhu, Hu Qin, Andrew Lim, Lei Wang:
A two-stage tabu search algorithm with enhanced packing heuristics for the 3L-CVRP and M3L-CVRP. Comput. Oper. Res. 39(9): 2178-2195 (2012) - [j86]Yeow Meng Chee, Lijun Ji, Andrew Lim, Anthony K. H. Tung:
Arboricity: An acyclic hypergraph decomposition problem motivated by database theory. Discret. Appl. Math. 160(1-2): 100-107 (2012) - [j85]Andrew Lim, Hu Qin, Zhou Xu:
The freight allocation problem with lane cost balancing constraint. Eur. J. Oper. Res. 217(1): 26-35 (2012) - [j84]Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim:
A reference length approach for the 3D strip packing problem. Eur. J. Oper. Res. 220(1): 37-47 (2012) - [j83]Zizhen Zhang, Hu Qin, Wenbin Zhu, Andrew Lim:
The single vehicle routing problem with toll-by-weight scheme: A branch-and-bound approach. Eur. J. Oper. Res. 220(2): 295-304 (2012) - [j82]Wenbin Zhu, Andrew Lim:
A new iterative-doubling Greedy-Lookahead algorithm for the single container loading problem. Eur. J. Oper. Res. 222(3): 408-417 (2012) - [j81]Wenbin Zhu, Zhaoyi Zhang, Wee-Chong Oon, Andrew Lim:
Space defragmentation for packing problems. Eur. J. Oper. Res. 222(3): 452-463 (2012) - [j80]Wenbin Zhu, Weili Huang, Andrew Lim:
A prototype column generation strategy for the multiple container loading problem. Eur. J. Oper. Res. 223(1): 27-39 (2012) - [j79]Brenda Cheang, Xiang Gao, Andrew Lim, Hu Qin, Wenbin Zhu:
Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints. Eur. J. Oper. Res. 223(1): 60-75 (2012) - [j78]Andrew Lim, Hong Ma, Jing Xu, Xingwen Zhang:
An iterated construction approach with dynamic prioritization for solving the container loading problems. Expert Syst. Appl. 39(4): 4292-4305 (2012) - [j77]Han Huang, Hu Qin, Zhifeng Hao, Andrew Lim:
Example-based learning particle swarm optimization for continuous optimization. Inf. Sci. 182(1): 125-138 (2012) - [j76]Wenbin Zhu, Hu Qin, Andrew Lim, Huidong Zhang:
Iterative Deepening A* Algorithms for the Container Relocation Problem. IEEE Trans Autom. Sci. Eng. 9(4): 710-722 (2012) - 2011
- [j75]Andrew Lim, Hong Ma, Brian Rodrigues, Sun Teck Tan, Fei Xiao:
New concepts for activity float in resource-constrained project management. Comput. Oper. Res. 38(6): 917-930 (2011) - [j74]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. Eur. J. Oper. Res. 212(3): 482-496 (2011) - [j73]Chan Hou Che, Weili Huang, Andrew Lim, Wenbin Zhu:
The multiple container loading cost minimization problem. Eur. J. Oper. Res. 214(3): 501-511 (2011) - [j72]Lijun Wei, Wee-Chong Oon, Wenbin Zhu, Andrew Lim:
A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur. J. Oper. Res. 215(2): 337-346 (2011) - [j71]Zhou Xu, Brenda Cheang, Andrew Lim, Qi Wen:
Evaluating OR/MS Journals via PageRank. Interfaces 41(4): 375-388 (2011) - [c121]Chan Hou Che, Zizhen Zhang, Andrew Lim:
A memetic algorithm for solving multiperiod vehicle routing problem with profit. GECCO (Companion) 2011: 45-46 - [c120]Zizhen Zhang, Hu Qin, Andrew Lim:
A genetic algorithm for the freight consolidation problem with one-dimensional container loading. GECCO 2011: 1707-1714 - [c119]Xiang Gao, Andrew Lim, Hu Qin, Wenbin Zhu:
Multiple Pickup and Delivery TSP with LIFO and Distance Constraints: A VNS Approach. IEA/AIE (2) 2011: 193-202 - [c118]Qiao Chen, Andrew Lim, Wenbin Zhu:
A Greedy Heuristic for Airline Crew Rostering: Unique Challenges in a Large Airline in China. IEA/AIE (2) 2011: 237-245 - [c117]Wenbin Zhu, Wee-Chong Oon, Yujian Weng, Andrew Lim:
Optimal Algorithms for Two-Dimensional Box Placement Problems. IEA/AIE (2) 2011: 246-255 - [c116]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 - [c115]Chan Hou Che, Weili Huang, Andrew Lim, Wenbin Zhu:
A Heuristic for the Multiple Container Loading Cost Minimization Problem. IEA/AIE (2) 2011: 276-285 - [c114]Lijun Wei, Andrew Lim, Wenbin Zhu:
A Skyline-Based Heuristic for the 2D Rectangular Strip Packing Problem. IEA/AIE (2) 2011: 286-295 - [c113]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
- [j70]Zhirong Liang, Yanzhi Li, Andrew Lim, Songshan Guo:
Load balancing in project assignment. Comput. Oper. Res. 37(12): 2248-2256 (2010) - [c112]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 - [c111]Huidong Zhang, Songshan Guo, Wenbin Zhu, Andrew Lim, Brenda Cheang:
An Investigation of IDA* Algorithms for the Container Relocation Problem. IEA/AIE (1) 2010: 31-40 - [c110]Zizhen Zhang, Hu Qin, Andrew Lim, Songshan Guo:
Branch and Bound Algorithm for a Single Vehicle Routing Problem with Toll-by-Weight Scheme. IEA/AIE (3) 2010: 179-188 - [c109]Zuli Liu, Songshan Guo, Lawrence V. Snyder, Andrew Lim, Peng Peng:
A p-Robust Capacitated Network Design Model with Facility Disruptions. Heinz Nixdorf Symposium 2010: 269-280 - [c108]Wenbin Zhu, Hu Qin, Andrew Lim, Zhou Xu:
Balanced Student Partitioning to Promote Effective Learning: Applications in an International School. PKAW 2010: 38-48 - [c107]Lei Wang, Songshan Guo, Shi Chen, Wenbin Zhu, Andrew Lim:
Two Natural Heuristics for 3D Packing with Practical Loading Constraints. PRICAI 2010: 256-267
2000 – 2009
- 2009
- [j69]Andrew Lim, Hong Ma, Qi Wen, Zhou Xu, Brenda Cheang:
Distinguishing citation quality for journal impact assessment. Commun. ACM 52(8): 111-116 (2009) - [j68]Zhaowei Miao, Andrew Lim, Hong Ma:
Truck dock assignment problem with operational time constraint within crossdocks. Eur. J. Oper. Res. 192(1): 105-115 (2009) - [j67]Andrew Lim, Zhou Xu:
Searching optimal resequencing and feature assignment on an automated assembly line. J. Oper. Res. Soc. 60(3): 361-371 (2009) - [j66]Yanzhi Li, Andrew Lim, Brian Rodrigues:
Note - Pricing and Inventory Control for a Perishable Product. Manuf. Serv. Oper. Manag. 11(3): 538-542 (2009) - [c106]Zhirong Liang, Songshan Guo, Yanzhi Li, Andrew Lim:
Balancing Workload in Project Assignment. Australasian Conference on Artificial Intelligence 2009: 91-100 - [c105]Xianhao Zhou, Songshan Guo, Chan Hou Che, Brenda Cheang, Andrew Lim, Hubert Kreuter, Janet Chow:
Using AI to Solve Inspection Scheduling Problem for a Buying Office. IAAI 2009 - 2008
- [j65]Qun Chen, Andrew Lim, Kian Win Ong:
Enabling structural summaries for efficient update and workload adaptation. Data Knowl. Eng. 64(3): 558-579 (2008) - [j64]Yunsong Guo, Yanzhi Li, Andrew Lim, Brian Rodrigues:
Tariff concessions in production sourcing. Eur. J. Oper. Res. 187(2): 543-555 (2008) - [j63]Andrew Lim, Brian Rodrigues, Zhou Xu:
Transportation Procurement with Seasonally Varying Shipper Demand and Volume Guarantees. Oper. Res. 56(3): 758-771 (2008) - [j62]Andrew Lim, Zhou Xu, Fan Wang:
The bidding selection and assignment problem with minimum quantity commitment. J. Oper. Res. Soc. 59(5): 693-702 (2008) - [j61]Fan Wang, Andrew Lim:
Effective Neighborhood Operators for Solving the Flexible Demand Assignment Problem. IEEE Trans Autom. Sci. Eng. 5(2): 289-297 (2008) - [c104]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 - [c103]Andrew Lim, Hu Qin, Jing Xu, Zhou Xu:
Random Move Tabu Search for Freight Proportion Allocation Problem. ICTAI (2) 2008: 307-314 - 2007
- [j60]Andrew Lim, Jing Lin, Fei Xiao:
Particle Swarm Optimization and Hill Climbing for the bandwidth minimization problem. Appl. Intell. 26(3): 175-182 (2007) - [j59]Gaofeng Huang, Andrew Lim, Brian Rodrigues:
A local search using solution fragments for the 2-machine bicriteria scheduling problem. Comput. Optim. Appl. 37(2): 219-229 (2007) - [j58]Fan Wang, Andrew Lim:
A stochastic beam search for the berth allocation problem. Decis. Support Syst. 42(4): 2186-2196 (2007) - [j57]Yunsong Guo, Andrew Lim, Brian Rodrigues, Liang Yang:
Minimizing the makespan for Unrelated Parallel Machines. Int. J. Artif. Intell. Tools 16(3): 399-415 (2007) - [j56]Andrew Lim, Brian Rodrigues, Fei Xiao:
A Fast Algorithm for Bandwidth Minimization. Int. J. Artif. Intell. Tools 16(3): 537-544 (2007) - [j55]Andrew Lim, Xingwen Zhang:
A Two-Stage Heuristic with Ejection Pools and Generalized Ejection Chains for the Vehicle Routing Problem with Time Windows. INFORMS J. Comput. 19(3): 443-457 (2007) - [j54]Zhaohui Fu, Yanzhi Li, Andrew Lim, Brian Rodrigues:
Port space allocation with a time dimension. J. Oper. Res. Soc. 58(6): 797-807 (2007) - [j53]Yunsong Guo, Andrew Lim, Brian Rodrigues, Shanhu Yu:
Machine scheduling performance with maintenance and failure. Math. Comput. Model. 45(9-10): 1067-1080 (2007) - [c102]Andrew Lim, Hong Ma, Qi Wen, Zhou Xu, Brenda Cheang, Bernard C. Y. Tan, Wenbin Zhu:
Journal-Ranking.com: An Online Interactive Journal Ranking System. AAAI 2007: 1723-1729 - 2006
- [j52]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) - [j51]Ping Chen, Yunsong Guo, Andrew Lim, Brian Rodrigues:
Multiple crossdocks with inventory and time windows. Comput. Oper. Res. 33: 43-63 (2006) - [j50]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Heuristics for a bidding problem. Comput. Oper. Res. 33: 2179-2188 (2006) - [j49]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) - [j48]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) - [j47]Gaofeng Huang, Andrew Lim:
A hybrid genetic algorithm for the Three-Index Assignment Problem. Eur. J. Oper. Res. 172(1): 249-257 (2006) - [j46]Andrew Lim, Brian Rodrigues, Fei Xiao:
Heuristics for matrix bandwidth reduction. Eur. J. Oper. Res. 174(1): 69-91 (2006) - [j45]Andrew Lim, Zhou Xu:
A critical-shaking neighborhood search for the yard allocation problem. Eur. J. Oper. Res. 174(2): 1247-1259 (2006) - [j44]Andrew Lim, Brian Rodrigues, X. Zhang:
A simulated annealing and hill-climbing algorithm for the traveling tournament problem. Eur. J. Oper. Res. 174(3): 1459-1478 (2006) - [j43]Andrew Lim, Brian Rodrigues, X. Zhang:
Scheduling sports competitions at multiple venues - Revisited. Eur. J. Oper. Res. 175(1): 171-186 (2006) - [j42]Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing Tang:
Using a Lagrangian Heuristic for a Combinatorial Auction Problem. Int. J. Artif. Intell. Tools 15(3): 481-489 (2006) - [j41]Yi Zhu, Andrew Lim:
Crane scheduling with non-crossing constraint. J. Oper. Res. Soc. 57(12): 1464-1471 (2006) - [j40]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Carrier assignment models in transportation procurement. J. Oper. Res. Soc. 57(12): 1472-1481 (2006) - [j39]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) - [j38]Andrew Lim, Brian Rodrigues, Caixia Wang:
Two-machine flow shop problems with a single server. J. Sched. 9(6): 515-543 (2006) - [j37]Andrew Lim, Fan Wang, Zhou Xu:
A Transportation Problem with Minimum Quantity Commitment. Transp. Sci. 40(1): 117-129 (2006) - [c101]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: 1712-1719 - [c100]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 - [c99]Andrew Lim, Hong Ma, Zhaowei Miao:
Truck Dock Assignment Problem with Operational Time Constraint Within Crossdocks. IEA/AIE 2006: 262-271 - [c98]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 - [c97]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 - [c96]Zhenyu Wang, Oscar Che, Lijuan Chen, Andrew Lim:
An Efficient Shortest Path Computation System for Real Road Networks. IEA/AIE 2006: 711-720 - [c95]Xi Li, Andrew Lim, Zhaowei Miao, Brian Rodrigues:
Reducing Transportation Costs in Distribution Networks. IEA/AIE 2006: 1138-1148 - [c94]Andrew Lim, Kaicheng Zhang:
A Robust RFID-Based Method for Precise Indoor Positioning. IEA/AIE 2006: 1189-1199 - [c93]Zhenyu Wang, Chan Che, Andrew Lim:
Tabu Search for Generalized Minimum Spanning Tree Problem. PRICAI 2006: 918-922 - 2005
- [j36]Andrew Lim, Brian Rodrigues, Yi Zhu:
Airport Gate Scheduling with Time Windows. Artif. Intell. Rev. 24(1): 5-31 (2005) - [j35]Andrew Lim, Brian Rodrigues, Y. Yang:
3-D Container Packing Heuristics. Appl. Intell. 22(2): 125-134 (2005) - [j34]H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
The over-constrained airport gate assignment problem. Comput. Oper. Res. 32: 1867-1880 (2005) - [j33]Andrew Lim, Brian Rodrigues:
A Note on the Optimal EOQ for Announced Price Increases in the Infinite Horizon. Oper. Res. 53(4): 731-732 (2005) - [j32]Andrew Lim, Brian Rodrigues, J. Zhang:
Tabu search embedded simulated annealing for the shortest route cut and fill problem. J. Oper. Res. Soc. 56(7): 816-824 (2005) - [j31]Andrew Lim, Fan Wang:
Multi-depot vehicle routing problem: a one-stage approach. IEEE Trans Autom. Sci. Eng. 2(4): 397-402 (2005) - [j30]Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center problems with minimum coverage. Theor. Comput. Sci. 332(1-3): 1-17 (2005) - [c92]Andrew Lim, Jiqing Tang:
A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions. Australian Conference on Artificial Intelligence 2005: 736-745 - [c91]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 - [c90]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 - [c89]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem. HICSS 2005 - [c88]Andrew Lim, Fan Wang:
Robust Graph Coloring for Uncertain Supply Chain Management. HICSS 2005 - [c87]Andrew Lim, Xingwen Zhang:
A Two-Stage Heuristic for the Vehicle Routing Problem with Time Windows and a Limited Number of Vehicles. HICSS 2005 - [c86]Yue Geng, Yanzhi Li, Andrew Lim:
A Very Large-Scale Neighborhood Search Approach to Capacitated Warehouse Routing Problem. ICTAI 2005: 58-65 - [c85]Andrew Lim, Fan Wang:
Robust Airport Gate Assignment. ICTAI 2005: 74-81 - [c84]Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing Tang:
Using a Lagrangian Heuristic for a Combinatorial Auction Problem. ICTAI 2005: 99-103 - [c83]Andrew Lim, Zhou Xu:
Searching Optimal Resequencing and Feature Assignment on an Automated Assembly Line. ICTAI 2005: 491-498 - [c82]Andrew Lim, Fan Wang, Zhou Xu:
The Capacitated Traveling Salesman Problem with Pickups and Deliveries on a Tree. ISAAC 2005: 1061-1070 - [c81]Songshan Guo, Weixing Li, Andrew Lim, Fan Wang:
The shortest route cut and fill problem in linear topological structure. SAC 2005: 409-410 - [c80]Andrew Lim, Xingwen Zhang:
The container loading problem. SAC 2005: 913-917 - [c79]Andrew Lim, Yi Zhu, Q. Lou, Brian Rodrigues:
Heuristic methods for graph coloring problems. SAC 2005: 933-939 - [c78]L. Zhang, Songshan Guo, Yunsong Zhu, Andrew Lim:
A tabu search algorithm for the safe transportation of hazardous materials. SAC 2005: 940-946 - 2004
- [j29]Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fei Xiao:
A Hybrid Framework for Over-Constrained Generalized. Artif. Intell. Rev. 22(3): 211-243 (2004) - [j28]Yunsong Guo, Andrew Lim, Brian Rodrigues, Shanhu Yu:
Minimizing total flow time in single machine environment with release time: an experimental analysis. Comput. Ind. Eng. 47(2-3): 123-140 (2004) - [j27]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
The Two-Dimensional Packing Problem for Irregular Objects. Int. J. Artif. Intell. Tools 13(3): 429-448 (2004) - [j26]Yanzhi Li, Fan Wang, Andrew Lim:
A genetic algorithm for machine scheduling problem under shared resource constraints. Int. J. Comput. Appl. Technol. 19(2): 77-83 (2004) - [j25]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) - [j24]Andrew Lim, Brian Rodrigues, L. Song:
Manpower allocation with time windows. J. Oper. Res. Soc. 55(11): 1178-1186 (2004) - [j23]Yanzhi Li, Andrew Lim, Brian Rodrigues:
Crossdocking - JIT scheduling with time windows. J. Oper. Res. Soc. 55(12): 1342-1351 (2004) - [j22]Andrew Lim, Brian Rodrigues, Xingwen Zhang:
Metaheuristics with Local Search Techniques for Retail Shelf-Space Optimization. Manag. Sci. 50(1): 117-131 (2004) - [j21]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
Port yard storage optimization. IEEE Trans Autom. Sci. Eng. 1(1): 26-37 (2004) - [c77]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 - [c76]Andrew Lim, Fan Wang, Zhou Xu:
On the Selection and Assignment with Minimum Quantity Commitments. COCOON 2004: 102-111 - [c75]Andrew Lim, Zhaowei Miao, Brian Rodrigues, Zhou Xu:
Transshipment Through Crossdocks with Inventory and Time Windows. COCOON 2004: 122-131 - [c74]Andrew Lim, Brian Rodrigues, Fan Wang, Zhou Xu:
k-Center Problems with Minimum Coverage. COCOON 2004: 349-359 - [c73]Andrew Lim, Brian Rodrigues, Zhou Xu:
Solving the Crane Scheduling Problem Using Intelligent Search Schemes. CP 2004: 747-751 - [c72]Gaofeng Huang, Andrew Lim:
An Effective Branch-and-Bound Algorithm to Solve the k-Longest Common Subsequence Problem. ECAI 2004: 191-195 - [c71]Fan Wang, Andrew Lim, Hong Chen:
Flexible Demand Assignment Problem. ECAI 2004: 698-704 - [c70]Andrew Lim, Zhou Xu:
A Critical-Shaking Neighbourhood Search for the Yard Allocation Problem. ECAI 2004: 1049-1050 - [c69]H. Ding, Andrew Lim, Brian Rodrigues, Yi Zhu:
Aircraft and Gate Scheduling Optimization at Airports. HICSS 2004 - [c68]Andrew Lim, Brian Rodrigues, Fei Xiao:
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem. HICSS 2004 - [c67]Yanzhi Li, Andrew Lim:
MetaIP - A New Approach to Combinatorial Optimization: Case Studies. ICTAI 2004: 56-62 - [c66]Andrew Lim, Fan Wang:
Meta-Heuristics for Robust Graph Coloring Problem. ICTAI 2004: 514-518 - [c65]Andrew Lim, Fan Wang:
A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. ICTAI 2004: 704-708 - [c64]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 - [c63]Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu:
Heuristics for a Brokering Set Packing Problem. AI&M 2004 - [c62]Gaofeng Huang, Andrew Lim:
A Simple Yet Effective Framework for Optimization Problems. AI&M 2004 - [c61]Yi Zhu, Andrew Lim:
Crane Scheduling with Spatial Constraints: Mathematical Models and Solving Approaches. AI&M 2004 - [c60]Andrew Lim, Zhou Xu:
The Bottleneck Problem with Minimum Quantity Commitments. SWAT 2004: 285-297 - [c59]Andrew Lim, Brian Rodrigues, Zhou Xu:
Approximation Schemes for the Crane Scheduling Problem. SWAT 2004: 323-335 - 2003
- [j20]Kai Song Goh, Andrew Lim, Brian Rodrigues:
Sexual Selection for Genetic Algorithms. Artif. Intell. Rev. 19(2): 123-152 (2003) - [j19]Brenda Cheang, Andy Kurnia, Andrew Lim, Wee-Chong Oon:
On automated grading of programming assignments in an academic institution. Comput. Educ. 41(2): 121-131 (2003) - [j18]Haibing Li, Andrew Lim:
Local search with annealing-like restarts to solve the VRPTW. Eur. J. Oper. Res. 150(1): 115-127 (2003) - [j17]Brenda Cheang, Haibing Li, Andrew Lim, Brian Rodrigues:
Nurse rostering problems - a bibliographic survey. Eur. J. Oper. Res. 151(3): 447-460 (2003) - [j16]Haibing Li, Andrew Lim:
A Metaheuristic for the Pickup and Delivery Problem with Time Windows. Int. J. Artif. Intell. Tools 12(2): 173-186 (2003) - [c58]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 - [c57]Andrew Lim, Brian Rodrigues, Fei Xiao:
Using an evolutionary algorithm for bandwidth minimization. IEEE Congress on Evolutionary Computation 2003: 678-683 - [c56]Yanzhi Li, Fan Wang, Andrew Lim:
Resource constraints machine scheduling: a genetic algorithm approach. IEEE Congress on Evolutionary Computation 2003: 1080-1085 - [c55]Zhaohui Fu, Andy Kurnia, Andrew Lim, Brian Rodrigues:
Shortest path problem with cache dependent path lengths. IEEE Congress on Evolutionary Computation 2003: 2756-2761 - [c54]Gaofeng Huang, Andrew Lim:
A hybrid genetic algorithm for three-index assignment problem. IEEE Congress on Evolutionary Computation 2003: 2762-2768 - [c53]Andrew Lim, Wee-Chong Oon, Wenbin Zhu:
Towards definitive benchmarking of algorithm performance. ECIS 2003: 1112-1129 - [c52]Gaofeng Huang, Andrew Lim:
Designing A Hybrid Genetic Algorithm for the Linear Ordering Problem. GECCO 2003: 1053-1064 - [c51]Andrew Lim, Brian Rodrigues, Fei Xiao:
Integrated Genetic Algorithm with Hill Climbing for Bandwidth Minimization Problem. GECCO 2003: 1594-1595 - [c50]Andrew Lim, Zhou Xu:
A Fixed-Length Subset Genetic Algorithm for the p-Median Problem. GECCO 2003: 1596-1597 - [c49]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
The General Yard Allocation Problem. GECCO 2003: 1986-1997 - [c48]Ping Chen, Zhaohui Fu, Andrew Lim, Brian Rodrigues:
Two-Dimensional acking For Irregular Shaped Objects. HICSS 2003: 86 - [c47]Yi Zhu, Andrew Lim, Brian Rodrigues:
Aircraft and Gate Scheduling with Time Windows. ICTAI 2003: 189-193 - [c46]Gaofeng Huang, Andrew Lim:
Fragmental Optimization on the 2-Machine Bicriteria Flowshop Scheduling Problem. ICTAI 2003: 194- - [c45]Yunsong Guo, Andrew Lim, Brian Rodrigues:
Transportation Bid Analysis Optimization with Shipper Input. ICTAI 2003: 290- - [c44]Andrew Lim, Brian Rodrigues, Fei Xiao:
A New Node Centroid Algorithm for Bandwidth Minimization. IJCAI 2003: 1544-1545 - [c43]Haibing Li, Andrew Lim, Brian Rodrigues:
A Hybrid AI Approach for Nurse Rostering Problem. SAC 2003: 730-735 - [c42]Andrew Lim, Brian Rodrigues, Lei Song:
Manpower Scheduling with Time Windows. SAC 2003: 741-746 - [c41]Chen Qun, Andrew Lim, Kian Win Ong:
D(k)-Index: An Adaptive Structural Summary for Graph-Structured Data. SIGMOD Conference 2003: 134-144 - 2002
- [j15]Donald L. Keefer, Javier Faulin, Alberto Bayo, Andrew Lim, Juay Chin Ang, Wee-Kit Ho, Wee-Chong Oon:
Practice Abstracts. Interfaces 32(6): 41-44 (2002) - [j14]Andrew Lim, Wee-Chong Oon, Chi-Hung Chi:
A matching-based algorithm for page access sequencing in join processing. J. Syst. Softw. 60(1): 11-19 (2002) - [c40]Ping Chen, Zhaohui Fu, Andrew Lim:
The Yard Allocation Problem. AAAI/IAAI 2002: 3-8 - [c39]Andrew Lim, Juay Chin Ang, Wee-Kit Ho, Wee-Chong Oon:
UTTSExam: A Campus-Wide University Exam-Timetabling System. AAAI/IAAI 2002: 838-844 - [c38]Wee-Chong Oon, Andrew Lim:
Multi-Player Game Approach to Solving Multi-Entity Problems. AAAI/IAAI 2002: 961-962 - [c37]Andrew Lim, Juay Chin Ang, Wee-Kit Ho, Wee-Chong Oon:
UTTSExam: A University Examination Timetable Scheduler. AAAI/IAAI 2002: 1004-1005 - [c36]Andrew Lim, Brian Rodrigues, Ramesh Thangarajo, Fei Xiao:
Over-Constrained Resource-Constrained Scheduling Problems with Prioritized Activities. FSKD 2002: 672-676 - [c35]Ping Chen, Zhaohui Fu, Andrew Lim:
Using Genetic Algorithms To Solve The Yard Allocation Problem. GECCO 2002: 1049-1056 - [c34]Andrew Lim, Brian Rodrigues, Fei Xiao, Yi Zhu:
Crane Scheduling Using Tabu Search. ICTAI 2002: 146-153 - [c33]Andrew Lim, Brian Rodrigues, Fei Xiao, Xingwen Zhang:
Adjusted Network Flow for the Shelf-Space Allocation Problem. ICTAI 2002: 224- - [c32]Wee-Chong Oon, Andrew Lim:
Multi-Player Game Approach to Scheduling Problems. ISPAN 2002: 205- - [c31]Haibing Li, Andrew Lim:
Local search with annealing-like restarts to solve the vehicle routing problem with time windows. SAC 2002: 560-565 - 2001
- [j13]Andy Kurnia, Andrew Lim, Brenda Cheang:
Online Judge. Comput. Educ. 36(4): 299-315 (2001) - [j12]Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon:
Page access scheduling in join processing. Data Knowl. Eng. 37(3): 267-284 (2001) - [j11]Wee-Kit Ho, Juay Chin Ang, Andrew Lim:
A Hybrid Search Algorithm for the Vehicle Routing Problem with Time Windows. Int. J. Artif. Intell. Tools 10(3): 431-449 (2001) - [c30]Chen Qun, Andrew Lim, Wee-Chong Oon:
Page Access Sequencing in Join Processing with Limited Buffer Space. DEXA 2001: 380-389 - [c29]Chen Qun, Andrew Lim, Yi Zhu:
Index and Data Allocation in Mobile Broadcast. DEXA 2001: 785-794 - [c28]Wee-Kit Ho, Andrew Lim:
A Hybrid-Based Framework for Constraint Satisfaction Optimization Problems. ICIS 2001: 65-76 - [c27]Haibing Li, Andrew Lim:
A Metaheuristic for the Pickup and Delivery Problem with Time Windows. ICTAI 2001: 160- - [c26]Wee-Kit Ho, Andrew Lim, Wee-Chong Oon:
Maximizing Paper Spread in Examination Timetabling Using a Vehicle Routing Method. ICTAI 2001: 359-366 - [c25]Andrew Lim, Wang Ying:
A New Method For The Three Dimensional Container Packing Problem. IJCAI 2001: 342-350 - 2000
- [c24]Hoong Chuin Lau, Andrew Lim, Qi Zhang Liu:
Solving a Supply Chain Optimization Problem Collaboratively. AAAI/IAAI 2000: 780-785 - [c23]Andrew Lim, Ang Juay Chin, Wee-Kit Ho, Wee-Chong Oon:
A Campus-Wide University Examination Timetabling Application. AAAI/IAAI 2000: 1020-1015 - [c22]Andrew Lim, Wee-Chong Oon, Chi-Hung Chi:
A New Algorithm for Page Access Sequencing in Join Processing. ADBIS-DASFAA 2000: 128-141 - [c21]Chi-Huing Chi, Xiang Li, Andrew Lim:
Dynamically Transcoding Data Quality for Faster Web Access. HPCN Europe 2000: 527-530 - [c20]Zhaohui Fu, Andrew Lim:
Heuristics for the exam scheduling problem. ICTAI 2000: 172-175 - [c19]Dennis Joshua Chia, Andrew Lim:
Local search algorithm for the compacted cells area problem. ICTAI 2000: 294-297 - [c18]Kai Song Goh, Andrew Lim:
Combining various algorithms to solve the ship berthing problem. ICTAI 2000: 370- - [c17]Kai Song Goh, Andrew Lim:
Algorithms for Solving the Ship Berthing Problem. PRICAI 2000: 797
1990 – 1999
- 1999
- [c16]Chia Jim Tong, Hoong Chuin Lau, Andrew Lim:
Ant Colony Optimization for the Ship Berthing Problem. ASIAN 1999: 359-370 - [c15]Andrew Lim, Jennifer Lai-Pheng Kwan, Wee-Chong Oon:
Page Access Scheduling in Join Processing. CIKM 1999: 276-283 - [c14]Chi-Hung Chi, Chen (Cherie) Ding, Andrew Lim:
Word Segmentation and Recognition for Web Document Framework. CIKM 1999: 458-465 - [c13]Ang Juay Chin, Wee-Kit Ho, Andrew Lim:
A New GA Approach for the Vehicle Routing Problem. ICTAI 1999: 307-310 - [c12]Andrew Lim:
An Effective Ship Berthing Algorithm. IJCAI 1999: 594-599 - 1998
- [j10]Andrew Lim:
The berth planning problem. Oper. Res. Lett. 22(2-3): 105-110 (1998) - [j9]Wynne Hsu, C. S. G. Lee, Andrew Lim:
A computer-aided product redesign system for robotic assembly. Robotica 16(3): 239-249 (1998) - 1997
- [j8]Andrew Lim, Venkat Thanvantri, Sartaj Sahni:
Planar topological routing. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 16(6): 651-656 (1997) - 1996
- [j7]Andrew Lim:
Minimum Area Joining of k Compacted Cells. Inf. Process. Lett. 58(6): 265-269 (1996) - [c11]Wynne Hsu, Andrew Lim, C. S. George Lee:
Conceptual level design for assembly analysis using state transitional approach. ICRA 1996: 3355-3360 - 1995
- [c10]Andrew Lim, Sartaj K. Sahni, Venkat Thanvantri:
A fast algorithm to test planar topological routability. VLSI Design 1995: 8-12 - 1994
- [j6]Andrew Lim, Sartaj Sahni:
Segmented Winner Trees. J. Inf. Process. Cybern. 30(1): 29-43 (1994) - [j5]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. Comput. Aided Des. Integr. Circuits Syst. 13(7): 857-864 (1994) - 1993
- [j4]Andrew Lim, Yeow Meng Chee, Siu-Wing Cheng:
Single Jog Minimum Area Joining of Compacted Cells. Inf. Process. Lett. 47(4): 167-172 (1993) - [j3]Andrew Lim, Siu-Wing Cheng, Sartaj Sahni:
Optimal Joining of Compacted Cells. IEEE Trans. Computers 42(5): 597-607 (1993) - [j2]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni:
On the circuit implementation problem. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 12(8): 1147-1156 (1993) - [c9]Andrew Lim, Siu-Wing Cheng, Ching-Ting Wu:
Performance Oriented Rectilinear Steiner Trees. DAC 1993: 171-176 - [c8]Siu-Wing Cheng, Andrew Lim, Ching-Ting Wu:
Optimal Rectilinear Steiner Tree for Extremal Point Sets. ISAAC 1993: 523-532 - 1992
- [j1]Yeow Meng Chee, Andrew Lim:
The Algorithmic Complexity of Colour Switching. Inf. Process. Lett. 43(2): 63-68 (1992) - [c7]Andrew Lim, Sartaj Sahni:
Segmented winner trees. ACM Southeast Regional Conference 1992: 157-164 - [c6]Wing Ning Li, Andrew Lim, Prathima Agrawal, Sartaj Sahni:
On the Circuit Implementation Problem. DAC 1992: 478-483 - [c5]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 - [c4]Andrew Lim, Yeow Meng Chee, Ching-Ting Wu:
Performance driven placement with global routing for macro cells. Great Lakes Symposium on VLSI 1992: 35-41 - [c3]Yeow Meng Chee, Andrew Lim:
A Complex Approach to the Security of Statistical Databases Subject to Off-line Sum Queries. SEC 1992: 373-384 - [c2]Ching-Ting Wu, Andrew Lim, David H. C. Du:
An Effective Timing-Driven Placement Algorithm For Macro Cells. VLSI Design 1992: 31-36 - 1991
- [c1]Ching-Ting Wu, Andrew Lim, David Hung-Chang Du:
Wafer Packing for Full Mask Exposure Fabrication. ICCAD 1991: 52-55
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-08-05 20:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint