Click here for Edward's personal webpage.
- E. Lam, P. Stuckey and D. Harabor. Optimal Multi-Agent Pickup and Delivery Using Branch-and-Cut-and-Price Algorithms. Transportation Science, (in print), 2024.
- E. Lam, D. Harabor, P. Stuckey and J. Li. Exact Anytime Multi-Agent Path Finding Using Branch-and-Cut-and-Price and Large Neighborhood Search. In International Conference on Automated Planning and Scheduling (ICAPS), 254-258, 2023.
- E. Lam, P. Le Bodic, D. Harabor and P. Stuckey. Branch-and-Cut-and-Price for Multi-Agent Path Finding. Computers and Operations Research, 2022.
- E. Lam and P. Le Bodic. New Valid Inequalities in Branch-and-Cut-and-Price for Multi-Agent Path Finding. In International Conference on Automated Planning and Scheduling (ICAPS), 184-192, 2020.
- E. Lam, P. Le Bodic, D. Harabor and P. Stuckey. Branch-and-Cut-and-Price for Multi-Agent Pathfinding. In International Joint Conference on Artificial Intelligence (IJCAI), (in print), 2019.
