Andrew Lim
Industrial and Manufacturing Engineering · with Li · 2001–2015
A researcher in the Science corpus: 4 papers; trusts 1 researcher and is trusted by 6 researchers here, as inferred from the citation graph.
Subfields
- Industrial and Manufacturing Engineering — 13 citations into it; #482 of 2,521 by trust here, #1,250 by citations
- Automotive Engineering — 11 citations into it; #573 of 3,081 by trust here, #2,332 by citations
- Building and Construction — 5 citations into it
Whom Andrew Lim trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Andrew Lim overall
Papers from Andrew Lim's perspective
Ordered by how strongly the researchers Andrew Lim trusts endorse each paper. Same corpus, a different order for every researcher.
- Tabu Search
- Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem (Mathematical programming)
- On the shortest spanning subtree of a graph and the traveling salesman problem
- A metaheuristic for the pickup and delivery problem with time windows (Proceedings 13th IEEE International Conference on Tools with Artificial Intelligence. ICTAI 2001)
- Solving the pickup and delivery problem with time windows using reactive tabu search
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (INFORMS journal on computing)
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows (Computers & Operations Research)
- A unified heuristic for a large class of Vehicle Routing Problems with Backhauls (European Journal of Operational Research)
- A reactive tabu search meta-heuristic for the vehicle routing problem with back-hauls
- Optimization by Simulated Annealing
Their papers
- Nurse rostering problems - a bibliographic survey (2003) — 552 citations
- A branch-and-cut algorithm for a realistic dial-a-ride problem (2015) — 101 citations
- A multi-faced buildup algorithm for three-dimensional packing problems (2003) — 64 citations
- A metaheuristic for the pickup and delivery problem with time windows (2001) — 455 citations